Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397700215.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V20P20N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 18K Apr 13 00:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 13 00:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 158K Apr 13 00:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 632K Apr 13 00:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 00:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 13 00:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 284K Apr 13 00:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 13 00:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 790K May 18 16:42 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 BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716286272235

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:11:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:11:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:11:13] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-05-21 10:11:13] [INFO ] Transformed 78 places.
[2024-05-21 10:11:13] [INFO ] Transformed 968 transitions.
[2024-05-21 10:11:13] [INFO ] Parsed PT model containing 78 places and 968 transitions and 7350 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (228 resets) in 2378 ms. (16 steps per ms) remains 9/15 properties
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (105 resets) in 406 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (108 resets) in 4210 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (108 resets) in 1465 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (87 resets) in 312 ms. (127 steps per ms) remains 8/9 properties
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (96 resets) in 1011 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (84 resets) in 376 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (76 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (83 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
[2024-05-21 10:11:17] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-05-21 10:11:17] [INFO ] Computed 7 invariants in 14 ms
[2024-05-21 10:11:17] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-07 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 170/248 variables, 78/85 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 42/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 127 constraints, problems are : Problem set: 4 solved, 4 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/75 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 10:11:20] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3/78 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 170/248 variables, 78/86 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 42/128 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 4/132 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-05-21 10:11:21] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 1/133 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/133 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/248 variables, 0/133 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 133 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1918 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 4043ms problems are : Problem set: 4 solved, 4 unsolved
Parikh walk visited 0 properties in 780 ms.
Support contains 52 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 107 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-05-21 10:11:22] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2024-05-21 10:11:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 10:11:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-05-21 10:11:29] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 2 ms to minimize.
[2024-05-21 10:11:31] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-05-21 10:11:33] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 170/246 variables, 76/84 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 42/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 246/246 variables, and 126 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 76/76 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 170/246 variables, 76/84 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 42/126 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 923/1049 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 1049 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 76/76 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 923/965 constraints, Known Traps: 3/3 constraints]
After SMT, in 43320ms problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43335ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 926/968 transitions.
Applied a total of 0 rules in 79 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43552 ms. Remains : 76/78 places, 926/968 transitions.
RANDOM walk for 40000 steps (228 resets) in 433 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (81 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (83 resets) in 394 ms. (101 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 349995 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 4
Probabilistic random walk after 349995 steps, saw 90016 distinct states, run finished after 3005 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-21 10:12:09] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-05-21 10:12:09] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 10:12:09] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 166/241 variables, 75/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/242 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 123 constraints, problems are : Problem set: 0 solved, 4 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:12:10] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-21 10:12:10] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 166/241 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/242 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 129 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1885ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 644 ms.
Support contains 52 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 38 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 76/76 places, 926/926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 926/926 transitions.
Applied a total of 0 rules in 35 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-05-21 10:12:12] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 10:12:12] [INFO ] Invariant cache hit.
[2024-05-21 10:12:12] [INFO ] Implicit Places using invariants in 106 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 75/76 places, 926/926 transitions.
Applied a total of 0 rules in 60 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 210 ms. Remains : 75/76 places, 926/926 transitions.
RANDOM walk for 40000 steps (228 resets) in 354 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (84 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (76 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (83 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (82 resets) in 245 ms. (162 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 419482 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 4
Probabilistic random walk after 419482 steps, saw 107187 distinct states, run finished after 3002 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-21 10:12:15] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 75 cols
[2024-05-21 10:12:15] [INFO ] Computed 6 invariants in 7 ms
[2024-05-21 10:12:15] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 166/240 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 40/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/241 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:12:16] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:12:16] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 166/240 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/241 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 127 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1395ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 558 ms.
Support contains 52 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 926/926 transitions.
Applied a total of 0 rules in 41 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 75/75 places, 926/926 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 926/926 transitions.
Applied a total of 0 rules in 39 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
[2024-05-21 10:12:17] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 10:12:17] [INFO ] Invariant cache hit.
[2024-05-21 10:12:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 10:12:17] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 10:12:17] [INFO ] Invariant cache hit.
[2024-05-21 10:12:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 10:12:18] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-21 10:12:18] [INFO ] Redundant transitions in 53 ms returned []
Running 923 sub problems to find dead transitions.
[2024-05-21 10:12:18] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 10:12:18] [INFO ] Invariant cache hit.
[2024-05-21 10:12:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 10:12:23] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/241 variables, 75/82 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 40/122 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 10:12:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 923 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 123 constraints, problems are : Problem set: 0 solved, 923 unsolved in 28955 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 166/241 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 923/1046 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 1046 constraints, problems are : Problem set: 0 solved, 923 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 61594ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 61603ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61956 ms. Remains : 75/75 places, 926/926 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 760 transitions
Reduce isomorphic transitions removed 760 transitions.
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 75 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 764 place count 73 transition count 164
Applied a total of 764 rules in 37 ms. Remains 73 /75 variables (removed 2) and now considering 164/926 (removed 762) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 164 rows 73 cols
[2024-05-21 10:13:19] [INFO ] Computed 6 invariants in 21 ms
[2024-05-21 10:13:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 10:13:20] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
TRAPS : Iteration 0
[2024-05-21 10:13:20] [INFO ] After 87ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-21 10:13:20] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-21 10:13:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 10:13:20] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 10:13:20] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-21 10:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
TRAPS : Iteration 1
[2024-05-21 10:13:20] [INFO ] After 715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 10:13:20] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1179 ms.
[2024-05-21 10:13:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 14 ms.
[2024-05-21 10:13:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 926 transitions and 6980 arcs took 27 ms.
[2024-05-21 10:13:21] [INFO ] Flatten gal took : 241 ms
Total runtime 127989 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P20N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 75
TRANSITIONS: 926
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.000s]


SAVING FILE /home/mcc/execution/422/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 666
MODEL NAME: /home/mcc/execution/422/model
75 places, 926 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N20-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716286522042

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BridgeAndVehicles-PT-V20P20N20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V20P20N20, 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 r047-tajo-171620397700215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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