About the Execution of LTSMin+red for FlexibleBarrier-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 474.403 | 46026.00 | 76293.00 | 197.40 | FFTTFFFFT??TFTFF | 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.r496-tall-171640602500031.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 FlexibleBarrier-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500031
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717181916133
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:58:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:58:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:58:37] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-31 18:58:37] [INFO ] Transformed 542 places.
[2024-05-31 18:58:37] [INFO ] Transformed 621 transitions.
[2024-05-31 18:58:37] [INFO ] Found NUPN structural information;
[2024-05-31 18:58:37] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (769 resets) in 1965 ms. (20 steps per ms) remains 8/16 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (106 resets) in 245 ms. (162 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (102 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (109 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (114 resets) in 922 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (111 resets) in 930 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (109 resets) in 86 ms. (459 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 621 rows 542 cols
[2024-05-31 18:58:38] [INFO ] Computed 8 invariants in 25 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 135/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FlexibleBarrier-PT-06b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem FlexibleBarrier-PT-06b-ReachabilityFireability-2024-06 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 407/542 variables, 8/143 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 407/550 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 0/550 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 621/1163 variables, 542/1092 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1163 variables, 0/1092 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 1092 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1191 ms.
Refiners :[Domain max(s): 542/542 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 542/542 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
Problem FlexibleBarrier-PT-06b-ReachabilityFireability-2024-13 is UNSAT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 107/107 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/107 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 435/542 variables, 8/115 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/542 variables, 435/550 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-31 18:58:41] [INFO ] Deduced a trap composed of 144 places in 395 ms of which 47 ms to minimize.
[2024-05-31 18:58:41] [INFO ] Deduced a trap composed of 93 places in 302 ms of which 4 ms to minimize.
[2024-05-31 18:58:41] [INFO ] Deduced a trap composed of 98 places in 249 ms of which 8 ms to minimize.
[2024-05-31 18:58:42] [INFO ] Deduced a trap composed of 67 places in 373 ms of which 35 ms to minimize.
[2024-05-31 18:58:42] [INFO ] Deduced a trap composed of 193 places in 323 ms of which 7 ms to minimize.
[2024-05-31 18:58:42] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 3 ms to minimize.
[2024-05-31 18:58:43] [INFO ] Deduced a trap composed of 187 places in 217 ms of which 5 ms to minimize.
[2024-05-31 18:58:43] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 8/558 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-31 18:58:45] [INFO ] Deduced a trap composed of 160 places in 2003 ms of which 3 ms to minimize.
SMT process timed out in 6462ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 542 transition count 557
Reduce places removed 64 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 84 rules applied. Total rules applied 148 place count 478 transition count 537
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 168 place count 458 transition count 537
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 168 place count 458 transition count 485
Deduced a syphon composed of 52 places in 17 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 272 place count 406 transition count 485
Discarding 125 places :
Symmetric choice reduction at 3 with 125 rule applications. Total rules 397 place count 281 transition count 360
Iterating global reduction 3 with 125 rules applied. Total rules applied 522 place count 281 transition count 360
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 528 place count 275 transition count 354
Iterating global reduction 3 with 6 rules applied. Total rules applied 534 place count 275 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 537 place count 275 transition count 351
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 605 place count 241 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 609 place count 239 transition count 317
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 612 place count 239 transition count 314
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 615 place count 236 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 616 place count 236 transition count 313
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 619 place count 236 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 620 place count 235 transition count 312
Applied a total of 620 rules in 303 ms. Remains 235 /542 variables (removed 307) and now considering 312/621 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 235/542 places, 312/621 transitions.
RANDOM walk for 40000 steps (1408 resets) in 643 ms. (62 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (129 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (196 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (194 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
[2024-05-31 18:58:46] [INFO ] Flow matrix only has 310 transitions (discarded 2 similar events)
// Phase 1: matrix 310 rows 235 cols
[2024-05-31 18:58:46] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 18:58:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 140/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 310/545 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 244 constraints, problems are : Problem set: 0 solved, 3 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 235/235 constraints, ReadFeed: 1/1 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/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 140/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:58:46] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-31 18:58:46] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-31 18:58:46] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-31 18:58:46] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 310/545 variables, 235/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:58:47] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 18:58:47] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-31 18:58:47] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/545 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 254 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 235/235 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 1967ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 607 ms.
Support contains 67 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 312/312 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 235 transition count 307
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 230 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 229 transition count 306
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 12 place count 229 transition count 300
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 223 transition count 300
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 32 place count 215 transition count 292
Iterating global reduction 3 with 8 rules applied. Total rules applied 40 place count 215 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 214 transition count 291
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 214 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 214 transition count 290
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 73 place count 199 transition count 275
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 75 place count 197 transition count 273
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 197 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 197 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 83 place count 195 transition count 290
Free-agglomeration rule applied 28 times.
Iterating global reduction 5 with 28 rules applied. Total rules applied 111 place count 195 transition count 262
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 139 place count 167 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 148 place count 167 transition count 253
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 167 transition count 253
Applied a total of 149 rules in 65 ms. Remains 167 /235 variables (removed 68) and now considering 253/312 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 167/235 places, 253/312 transitions.
RANDOM walk for 40000 steps (1251 resets) in 608 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (184 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (190 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1048690 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :0 out of 2
Probabilistic random walk after 1048690 steps, saw 263616 distinct states, run finished after 3010 ms. (steps per millisecond=348 ) properties seen :0
[2024-05-31 18:58:52] [INFO ] Flow matrix only has 250 transitions (discarded 3 similar events)
// Phase 1: matrix 250 rows 167 cols
[2024-05-31 18:58:52] [INFO ] Computed 8 invariants in 4 ms
[2024-05-31 18:58:52] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 250/417 variables, 167/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/417 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 3 ms to minimize.
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:58:52] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 250/417 variables, 167/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 6/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 190 constraints, problems are : Problem set: 0 solved, 2 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 67 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 167 /167 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 167/167 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 253/253 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 18:58:53] [INFO ] Flow matrix only has 250 transitions (discarded 3 similar events)
[2024-05-31 18:58:53] [INFO ] Invariant cache hit.
[2024-05-31 18:58:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 18:58:53] [INFO ] Flow matrix only has 250 transitions (discarded 3 similar events)
[2024-05-31 18:58:53] [INFO ] Invariant cache hit.
[2024-05-31 18:58:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-31 18:58:53] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-31 18:58:53] [INFO ] Redundant transitions in 9 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 18:58:53] [INFO ] Flow matrix only has 250 transitions (discarded 3 similar events)
[2024-05-31 18:58:53] [INFO ] Invariant cache hit.
[2024-05-31 18:58:53] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 3/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 18:58:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:58:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:58:55] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 250/417 variables, 167/178 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/417 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 184 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7701 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 3/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 250/417 variables, 167/178 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 6/184 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 250/434 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 18:59:03] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:59:05] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 18:59:06] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:59:06] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 18:59:10] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (OVERLAPS) 0/417 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 439 constraints, problems are : Problem set: 0 solved, 250 unsolved in 18788 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 167/167 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 8/8 constraints]
After SMT, in 26585ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 26588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26814 ms. Remains : 167/167 places, 253/253 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 167 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 164 transition count 247
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 164 transition count 247
Applied a total of 9 rules in 9 ms. Remains 164 /167 variables (removed 3) and now considering 247/253 (removed 6) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 247 rows 164 cols
[2024-05-31 18:59:20] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 18:59:20] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 18:59:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 18:59:20] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 5 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 327 ms
TRAPS : Iteration 1
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:59:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
TRAPS : Iteration 2
[2024-05-31 18:59:21] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-31 18:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-31 18:59:21] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-31 18:59:21] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-31 18:59:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
TRAPS : Iteration 3
[2024-05-31 18:59:21] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-31 18:59:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-31 18:59:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
TRAPS : Iteration 4
[2024-05-31 18:59:21] [INFO ] After 1520ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 18:59:21] [INFO ] After 1646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1724 ms.
[2024-05-31 18:59:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 18:59:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 167 places, 253 transitions and 821 arcs took 4 ms.
[2024-05-31 18:59:21] [INFO ] Flatten gal took : 51 ms
Total runtime 44693 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityFireability-2024-09
Could not compute solution for formula : FlexibleBarrier-PT-06b-ReachabilityFireability-2024-10
BK_STOP 1717181962159
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
rfs formula name FlexibleBarrier-PT-06b-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/685/inv_0_
rfs formula name FlexibleBarrier-PT-06b-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/685/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r496-tall-171640602500031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b 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 '
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 ;