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.r549-tall-171734898200255.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 greatspnxred
Input is FireWire-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16:33 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 FireWire-PT-11-ReachabilityFireability-2024-00
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME FireWire-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717367828040

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:37:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:37:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:37:09] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-02 22:37:09] [INFO ] Transformed 169 places.
[2024-06-02 22:37:09] [INFO ] Transformed 508 transitions.
[2024-06-02 22:37:09] [INFO ] Found NUPN structural information;
[2024-06-02 22:37:09] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
RANDOM walk for 40000 steps (1074 resets) in 2244 ms. (17 steps per ms) remains 8/16 properties
FORMULA FireWire-PT-11-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (432 resets) in 1111 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (53 resets) in 300 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (155 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (218 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
[2024-06-02 22:37:10] [INFO ] Flow matrix only has 405 transitions (discarded 38 similar events)
// Phase 1: matrix 405 rows 169 cols
[2024-06-02 22:37:11] [INFO ] Computed 10 invariants in 13 ms
[2024-06-02 22:37:11] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem FireWire-PT-11-ReachabilityFireability-2024-00 is UNSAT
FORMULA FireWire-PT-11-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 61/167 variables, 10/116 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 61/177 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 404/571 variables, 167/344 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 57/401 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/573 variables, 2/403 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/405 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/574 variables, 1/406 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/574 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 406 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1242 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem FireWire-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-11-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-11-ReachabilityFireability-2024-02 is UNSAT
FORMULA FireWire-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-11-ReachabilityFireability-2024-13 is UNSAT
FORMULA FireWire-PT-11-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 65/167 variables, 10/112 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 65/177 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 22:37:12] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 16 ms to minimize.
[2024-06-02 22:37:12] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 2/179 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 22:37:13] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 1/180 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/180 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 404/571 variables, 167/347 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 57/404 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 2/406 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/406 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/573 variables, 2/408 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 2/410 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 2/412 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 0/412 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/574 variables, 1/413 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/574 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/574 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 574/574 variables, and 413 constraints, problems are : Problem set: 4 solved, 4 unsolved in 2421 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 3986ms problems are : Problem set: 4 solved, 4 unsolved
FORMULA FireWire-PT-11-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1329 ms.
Support contains 49 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 443/443 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 169 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 169 transition count 438
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 167 transition count 438
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 164 transition count 432
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 164 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 164 transition count 426
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 164 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 164 transition count 425
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 163 transition count 424
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 163 transition count 424
Applied a total of 25 rules in 115 ms. Remains 163 /169 variables (removed 6) and now considering 424/443 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 163/169 places, 424/443 transitions.
RANDOM walk for 40000 steps (1181 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (171 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 809828 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 2
Probabilistic random walk after 809828 steps, saw 189188 distinct states, run finished after 3004 ms. (steps per millisecond=269 ) properties seen :0
[2024-06-02 22:37:19] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
// Phase 1: matrix 394 rows 163 cols
[2024-06-02 22:37:19] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 22:37:19] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/161 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 394/555 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 57/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/557 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/557 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 230 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 163/163 constraints, ReadFeed: 57/57 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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 106/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/161 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 394/555 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 57/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/557 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/557 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 163/163 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 971ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 292 ms.
Support contains 49 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 424/424 transitions.
Applied a total of 0 rules in 11 ms. Remains 163 /163 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 163/163 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 424/424 transitions.
Applied a total of 0 rules in 10 ms. Remains 163 /163 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 22:37:21] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
[2024-06-02 22:37:21] [INFO ] Invariant cache hit.
[2024-06-02 22:37:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 22:37:21] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
[2024-06-02 22:37:21] [INFO ] Invariant cache hit.
[2024-06-02 22:37:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 22:37:21] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [61, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 327 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/163 places, 424/424 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 351 ms. Remains : 161/163 places, 424/424 transitions.
RANDOM walk for 40000 steps (1189 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (206 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 768882 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 2
Probabilistic random walk after 768882 steps, saw 181455 distinct states, run finished after 3004 ms. (steps per millisecond=255 ) properties seen :0
[2024-06-02 22:37:24] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
// Phase 1: matrix 394 rows 161 cols
[2024-06-02 22:37:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:37:24] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/157 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 394/551 variables, 157/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 57/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/555 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 57/57 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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 102/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/157 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 394/551 variables, 157/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 57/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/555 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:37:25] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/555 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1109ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 531 ms.
Support contains 49 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 424/424 transitions.
Applied a total of 0 rules in 23 ms. Remains 161 /161 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 161/161 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 424/424 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 22:37:26] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
[2024-06-02 22:37:26] [INFO ] Invariant cache hit.
[2024-06-02 22:37:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:37:26] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
[2024-06-02 22:37:26] [INFO ] Invariant cache hit.
[2024-06-02 22:37:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 22:37:26] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-06-02 22:37:26] [INFO ] Redundant transitions in 29 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 22:37:26] [INFO ] Flow matrix only has 394 transitions (discarded 30 similar events)
[2024-06-02 22:37:26] [INFO ] Invariant cache hit.
[2024-06-02 22:37:26] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:37:29] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 394/555 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 57/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 17486 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:37:46] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (OVERLAPS) 394/555 variables, 161/179 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 423/659 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 22:37:58] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:37:59] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 661 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 12/12 constraints]
After SMT, in 47923ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 47928ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48285 ms. Remains : 161/161 places, 424/424 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 38 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 34 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 158 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 20 place count 158 transition count 372
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 21 place count 158 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 158 transition count 371
Applied a total of 22 rules in 44 ms. Remains 158 /161 variables (removed 3) and now considering 371/424 (removed 53) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:38:14] [INFO ] Flow matrix only has 369 transitions (discarded 2 similar events)
// Phase 1: matrix 369 rows 158 cols
[2024-06-02 22:38:14] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:38:14] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:38:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 22:38:14] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:38:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:38:15] [INFO ] After 148ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:38:15] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:38:15] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 880 ms.
[2024-06-02 22:38:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-02 22:38:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 424 transitions and 1567 arcs took 5 ms.
[2024-06-02 22:38:15] [INFO ] Flatten gal took : 68 ms
Total runtime 66414 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-11

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 161
TRANSITIONS: 424
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.002s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 649
MODEL NAME: /home/mcc/execution/415/model
161 places, 424 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 FireWire-PT-11-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA FireWire-PT-11-ReachabilityFireability-2024-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717368274721

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-11"
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 FireWire-PT-11, 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 r549-tall-171734898200255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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