fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r544-smll-171701111200287
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
908.107 22768.00 50162.00 200.30 TTTTTTTTFTFFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r544-smll-171701111200287.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111200287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 207K May 18 16:43 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 Vasy2003-PT-none-ReachabilityFireability-2024-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717282102060

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 22:48:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 22:48:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 22:48:24] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-01 22:48:24] [INFO ] Transformed 485 places.
[2024-06-01 22:48:24] [INFO ] Transformed 776 transitions.
[2024-06-01 22:48:24] [INFO ] Found NUPN structural information;
[2024-06-01 22:48:24] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
RANDOM walk for 40000 steps (8 resets) in 3173 ms. (12 steps per ms) remains 8/16 properties
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 879 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1829 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 8/8 properties
[2024-06-01 22:48:26] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2024-06-01 22:48:26] [INFO ] Computed 66 invariants in 34 ms
[2024-06-01 22:48:27] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 280/426 variables, 32/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 280/458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 3/461 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 50/476 variables, 27/488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 50/538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 9/485 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 9/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 695/1180 variables, 485/1036 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 72/1108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1180 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/1181 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1181 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1181 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1181/1181 variables, and 1109 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2655 ms.
Refiners :[Domain max(s): 485/485 constraints, Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 485/485 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem Vasy2003-PT-none-ReachabilityFireability-2024-01 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Vasy2003-PT-none-ReachabilityFireability-2024-09 is UNSAT
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 280/426 variables, 32/178 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 280/458 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 3/461 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-01 22:48:31] [INFO ] Deduced a trap composed of 124 places in 267 ms of which 44 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 1/462 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/462 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 50/476 variables, 27/489 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 50/539 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/539 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/485 variables, 4/543 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 9/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 695/1180 variables, 485/1037 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1180 variables, 72/1109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1180 variables, 6/1115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1180 variables, 0/1115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/1181 variables, 1/1116 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1181/1181 variables, and 1116 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5011 ms.
Refiners :[Domain max(s): 485/485 constraints, Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 485/485 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 8404ms problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 103 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 483 transition count 741
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 480 transition count 741
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 126 place count 361 transition count 622
Iterating global reduction 0 with 119 rules applied. Total rules applied 245 place count 361 transition count 622
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 272 place count 361 transition count 595
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 321 place count 312 transition count 535
Iterating global reduction 1 with 49 rules applied. Total rules applied 370 place count 312 transition count 535
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 400 place count 312 transition count 505
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 420 place count 292 transition count 477
Iterating global reduction 2 with 20 rules applied. Total rules applied 440 place count 292 transition count 477
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 452 place count 292 transition count 465
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 459 place count 285 transition count 454
Iterating global reduction 3 with 7 rules applied. Total rules applied 466 place count 285 transition count 454
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 470 place count 283 transition count 452
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 472 place count 281 transition count 450
Iterating global reduction 3 with 2 rules applied. Total rules applied 474 place count 281 transition count 450
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 478 place count 281 transition count 446
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 480 place count 279 transition count 443
Iterating global reduction 4 with 2 rules applied. Total rules applied 482 place count 279 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 483 place count 279 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 485 place count 279 transition count 440
Applied a total of 485 rules in 245 ms. Remains 279 /485 variables (removed 206) and now considering 440/752 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 279/485 places, 440/752 transitions.
RANDOM walk for 40000 steps (8 resets) in 1356 ms. (29 steps per ms) remains 3/6 properties
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 3/3 properties
[2024-06-01 22:48:36] [INFO ] Flow matrix only has 402 transitions (discarded 38 similar events)
// Phase 1: matrix 402 rows 279 cols
[2024-06-01 22:48:36] [INFO ] Computed 66 invariants in 6 ms
[2024-06-01 22:48:36] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/205 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 66/271 variables, 35/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/279 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 402/681 variables, 279/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 58/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/681 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 403 constraints, problems are : Problem set: 0 solved, 3 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 279/279 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/205 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:48:37] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-06-01 22:48:37] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 66/271 variables, 35/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/279 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 402/681 variables, 279/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 58/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/681 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 408 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1718 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 279/279 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 2427ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 882 ms.
Support contains 42 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 440/440 transitions.
Graph (complete) has 943 edges and 279 vertex of which 277 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 277 transition count 435
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 276 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 275 transition count 434
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 275 transition count 431
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 272 transition count 431
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 62 place count 224 transition count 369
Ensure Unique test removed 1 places
Iterating global reduction 3 with 49 rules applied. Total rules applied 111 place count 223 transition count 369
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 141 place count 223 transition count 339
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 159 place count 205 transition count 314
Iterating global reduction 4 with 18 rules applied. Total rules applied 177 place count 205 transition count 314
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 14 rules applied. Total rules applied 191 place count 205 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 204 transition count 300
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 197 place count 199 transition count 292
Iterating global reduction 6 with 5 rules applied. Total rules applied 202 place count 199 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 203 place count 199 transition count 291
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 211 place count 195 transition count 287
Graph (complete) has 637 edges and 195 vertex of which 179 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 212 place count 179 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 220 place count 179 transition count 275
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 223 place count 176 transition count 271
Iterating global reduction 9 with 3 rules applied. Total rules applied 226 place count 176 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 232 place count 176 transition count 265
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 234 place count 174 transition count 262
Iterating global reduction 10 with 2 rules applied. Total rules applied 236 place count 174 transition count 262
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 245 place count 174 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 251 place count 174 transition count 247
Applied a total of 251 rules in 90 ms. Remains 174 /279 variables (removed 105) and now considering 247/440 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 174/279 places, 247/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 825467 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 1
Probabilistic random walk after 825467 steps, saw 590507 distinct states, run finished after 3024 ms. (steps per millisecond=272 ) properties seen :0
[2024-06-01 22:48:42] [INFO ] Flow matrix only has 222 transitions (discarded 25 similar events)
// Phase 1: matrix 222 rows 174 cols
[2024-06-01 22:48:42] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 22:48:42] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/108 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 61/169 variables, 33/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/174 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 222/396 variables, 174/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 47/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/396 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 174/174 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/108 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:48:43] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/169 variables, 33/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/174 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/396 variables, 174/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 47/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 174/174 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 42 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 247/247 transitions.
Applied a total of 0 rules in 15 ms. Remains 174 /174 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 174/174 places, 247/247 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 247/247 transitions.
Applied a total of 0 rules in 10 ms. Remains 174 /174 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2024-06-01 22:48:43] [INFO ] Flow matrix only has 222 transitions (discarded 25 similar events)
[2024-06-01 22:48:43] [INFO ] Invariant cache hit.
[2024-06-01 22:48:43] [INFO ] Implicit Places using invariants in 174 ms returned [68, 71, 73, 76, 77, 78, 81, 148, 153]
Discarding 9 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 188 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 165/174 places, 245/247 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 165 transition count 243
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 163 transition count 243
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 163 transition count 240
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 160 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 158 transition count 238
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 158 transition count 238
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 16 place count 157 transition count 239
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 157 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 157 transition count 235
Applied a total of 20 rules in 59 ms. Remains 157 /165 variables (removed 8) and now considering 235/245 (removed 10) transitions.
[2024-06-01 22:48:44] [INFO ] Flow matrix only has 214 transitions (discarded 21 similar events)
// Phase 1: matrix 214 rows 157 cols
[2024-06-01 22:48:44] [INFO ] Computed 45 invariants in 3 ms
[2024-06-01 22:48:44] [INFO ] Implicit Places using invariants in 146 ms returned [43, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/174 places, 235/247 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 155 transition count 233
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 230
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 153 transition count 230
Applied a total of 8 rules in 31 ms. Remains 153 /155 variables (removed 2) and now considering 230/235 (removed 5) transitions.
[2024-06-01 22:48:44] [INFO ] Flow matrix only has 212 transitions (discarded 18 similar events)
// Phase 1: matrix 212 rows 153 cols
[2024-06-01 22:48:44] [INFO ] Computed 43 invariants in 2 ms
[2024-06-01 22:48:44] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 22:48:44] [INFO ] Flow matrix only has 212 transitions (discarded 18 similar events)
[2024-06-01 22:48:44] [INFO ] Invariant cache hit.
[2024-06-01 22:48:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 22:48:44] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 153/174 places, 230/247 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 878 ms. Remains : 153/174 places, 230/247 transitions.
RANDOM walk for 30234 steps (6 resets) in 292 ms. (103 steps per ms) remains 0/1 properties
FORMULA Vasy2003-PT-none-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20830 ms.
ITS solved all properties within timeout

BK_STOP 1717282124828

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Vasy2003-PT-none, 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 r544-smll-171701111200287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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