Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477100175.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477100175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 3.0K May 14 00:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 338K May 12 20: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 ShieldIIPs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591291509383

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:25:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 17:25:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:25:11] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2020-06-04 17:25:11] [INFO ] Transformed 1003 places.
[2020-06-04 17:25:11] [INFO ] Transformed 963 transitions.
[2020-06-04 17:25:11] [INFO ] Found NUPN structural information;
[2020-06-04 17:25:11] [INFO ] Parsed PT model containing 1003 places and 963 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 59 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 126 ms. (steps per millisecond=79 ) properties seen :[1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 963 rows 1003 cols
[2020-06-04 17:25:11] [INFO ] Computed 361 place invariants in 18 ms
[2020-06-04 17:25:12] [INFO ] [Real]Absence check using 361 positive place invariants in 200 ms returned sat
[2020-06-04 17:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:14] [INFO ] [Real]Absence check using state equation in 1966 ms returned sat
[2020-06-04 17:25:14] [INFO ] Computed and/alt/rep : 962/3843/962 causal constraints in 60 ms.
[2020-06-04 17:25:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:25:14] [INFO ] [Nat]Absence check using 361 positive place invariants in 174 ms returned sat
[2020-06-04 17:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:16] [INFO ] [Nat]Absence check using state equation in 2108 ms returned sat
[2020-06-04 17:25:16] [INFO ] Computed and/alt/rep : 962/3843/962 causal constraints in 60 ms.
[2020-06-04 17:25:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t214 0) (or (and (> t505 0) (< o505 o214)) (and (> t511 0) (< o511 o214))))") while checking expression at index 0
[2020-06-04 17:25:19] [INFO ] [Real]Absence check using 361 positive place invariants in 247 ms returned sat
[2020-06-04 17:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:21] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2020-06-04 17:25:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:25:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 234 ms returned sat
[2020-06-04 17:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:24] [INFO ] [Nat]Absence check using state equation in 2087 ms returned sat
[2020-06-04 17:25:24] [INFO ] Computed and/alt/rep : 962/3843/962 causal constraints in 114 ms.
[2020-06-04 17:25:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t184 0) (or (and (> t567 0) (< o567 o184)) (and (> t569 0) (< o569 o184))))") while checking expression at index 1
[2020-06-04 17:25:27] [INFO ] [Real]Absence check using 361 positive place invariants in 295 ms returned sat
[2020-06-04 17:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:29] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2020-06-04 17:25:29] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-06-04 17:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2020-06-04 17:25:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:25:30] [INFO ] [Nat]Absence check using 361 positive place invariants in 350 ms returned sat
[2020-06-04 17:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:32] [INFO ] [Nat]Absence check using state equation in 2049 ms returned sat
[2020-06-04 17:25:32] [INFO ] Computed and/alt/rep : 962/3843/962 causal constraints in 85 ms.
[2020-06-04 17:25:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t210 0) (and (or (and (> t500 0) (< o500 o210)) (and (> t501 0) (< o501 o210))) (or (and (> t498 0) (< o498 o210)) (and (> t499 0) (< o499 o210)))))") while checking expression at index 2
[2020-06-04 17:25:35] [INFO ] [Real]Absence check using 361 positive place invariants in 245 ms returned sat
[2020-06-04 17:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:37] [INFO ] [Real]Absence check using state equation in 1900 ms returned sat
[2020-06-04 17:25:37] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2020-06-04 17:25:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-06-04 17:25:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:25:37] [INFO ] [Nat]Absence check using 361 positive place invariants in 235 ms returned sat
[2020-06-04 17:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:39] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2020-06-04 17:25:39] [INFO ] Computed and/alt/rep : 962/3843/962 causal constraints in 86 ms.
[2020-06-04 17:25:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t304 0) (and (or (and (> t280 0) (< o280 o304)) (and (> t700 0) (< o700 o304)) (and (> t701 0) (< o701 o304)) (and (> t706 0) (< o706 o304)) (and (> t707 0) (< o707 o304))) (or (and (> t129 0) (< o129 o304)) (and (> t130 0) (< o130 o304)) (and (> t678 0) (< o678 o304)) (and (> t686 0) (< o686 o304)) (and (> t692 0) (< o692 o304)))))") while checking expression at index 3
Support contains 44 out of 1003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Partial Free-agglomeration rule applied 260 times.
Drop transitions removed 260 transitions
Iterating global reduction 0 with 260 rules applied. Total rules applied 262 place count 1002 transition count 962
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 263 place count 1002 transition count 962
Applied a total of 263 rules in 420 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1002/1003 places, 962/963 transitions.
Incomplete random walk after 1000000 steps, including 311 resets, run finished after 7055 ms. (steps per millisecond=141 ) properties seen :[1, 1, 0, 1]
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 970075 steps, including 18 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen :[0]
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:25:54] [INFO ] Computed 361 place invariants in 116 ms
[2020-06-04 17:25:55] [INFO ] [Real]Absence check using 351 positive place invariants in 240 ms returned sat
[2020-06-04 17:25:55] [INFO ] [Real]Absence check using 351 positive and 10 generalized place invariants in 8 ms returned sat
[2020-06-04 17:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:25:57] [INFO ] [Real]Absence check using state equation in 1941 ms returned sat
[2020-06-04 17:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:25:57] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-04 17:25:57] [INFO ] Deduced a trap composed of 15 places in 160 ms
[2020-06-04 17:25:57] [INFO ] Deduced a trap composed of 17 places in 117 ms
[2020-06-04 17:25:57] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-06-04 17:25:58] [INFO ] Deduced a trap composed of 15 places in 108 ms
[2020-06-04 17:25:58] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2020-06-04 17:25:58] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-06-04 17:25:58] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-06-04 17:25:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1001 ms
[2020-06-04 17:25:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:25:58] [INFO ] [Nat]Absence check using 351 positive place invariants in 224 ms returned sat
[2020-06-04 17:25:58] [INFO ] [Nat]Absence check using 351 positive and 10 generalized place invariants in 8 ms returned sat
[2020-06-04 17:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:26:00] [INFO ] [Nat]Absence check using state equation in 1996 ms returned sat
[2020-06-04 17:26:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 9 places in 132 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 27 places in 108 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 21 places in 99 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-06-04 17:26:01] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-06-04 17:26:02] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-06-04 17:26:02] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2020-06-04 17:26:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1304 ms
[2020-06-04 17:26:02] [INFO ] Computed and/alt/rep : 961/6092/961 causal constraints in 74 ms.
[2020-06-04 17:26:22] [INFO ] Added : 840 causal constraints over 168 iterations in 20358 ms.(timeout) Result :sat
[2020-06-04 17:26:23] [INFO ] Deduced a trap composed of 9 places in 717 ms
[2020-06-04 17:26:23] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-04 17:26:23] [INFO ] Deduced a trap composed of 9 places in 18 ms
[2020-06-04 17:26:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1289 ms
Attempting to minimize the solution found.
Minimization took 153 ms.
Incomplete Parikh walk after 143500 steps, including 843 resets, run finished after 1080 ms. (steps per millisecond=132 ) properties seen :[0] could not realise parikh vector
Support contains 17 out of 1002 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1002 transition count 962
Applied a total of 12 rules in 57 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 1000000 steps, including 235 resets, run finished after 7340 ms. (steps per millisecond=136 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 15 resets, run finished after 4359 ms. (steps per millisecond=229 ) properties seen :[0]
Interrupted probabilistic random walk after 1898188 steps, run timeout after 30001 ms. (steps per millisecond=63 ) properties seen :[0]
Probabilistic random walk after 1898188 steps, saw 268218 distinct states, run finished after 30001 ms. (steps per millisecond=63 ) properties seen :[0]
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:27:06] [INFO ] Computed 361 place invariants in 47 ms
[2020-06-04 17:27:07] [INFO ] [Real]Absence check using 357 positive place invariants in 371 ms returned sat
[2020-06-04 17:27:07] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 17:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:27:09] [INFO ] [Real]Absence check using state equation in 2020 ms returned sat
[2020-06-04 17:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:27:09] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-04 17:27:09] [INFO ] Deduced a trap composed of 24 places in 55 ms
[2020-06-04 17:27:09] [INFO ] Deduced a trap composed of 11 places in 48 ms
[2020-06-04 17:27:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2020-06-04 17:27:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:27:10] [INFO ] [Nat]Absence check using 357 positive place invariants in 220 ms returned sat
[2020-06-04 17:27:10] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 17:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:27:11] [INFO ] [Nat]Absence check using state equation in 1800 ms returned sat
[2020-06-04 17:27:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 15 places in 177 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 18 places in 78 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 5 places in 81 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 12 places in 69 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 12 places in 55 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 36 places in 47 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 15 places in 43 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-06-04 17:27:12] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2020-06-04 17:27:13] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2020-06-04 17:27:13] [INFO ] Deduced a trap composed of 24 places in 42 ms
[2020-06-04 17:27:13] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-06-04 17:27:13] [INFO ] Deduced a trap composed of 24 places in 56 ms
[2020-06-04 17:27:13] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1413 ms
[2020-06-04 17:27:13] [INFO ] Computed and/alt/rep : 961/6209/961 causal constraints in 61 ms.
[2020-06-04 17:27:33] [INFO ] Added : 790 causal constraints over 158 iterations in 20555 ms.(timeout) Result :sat
[2020-06-04 17:27:34] [INFO ] Deduced a trap composed of 6 places in 135 ms
[2020-06-04 17:27:34] [INFO ] Deduced a trap composed of 5 places in 146 ms
[2020-06-04 17:27:34] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2020-06-04 17:27:35] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-06-04 17:27:35] [INFO ] Deduced a trap composed of 5 places in 134 ms
[2020-06-04 17:27:35] [INFO ] Deduced a trap composed of 8 places in 130 ms
[2020-06-04 17:27:35] [INFO ] Deduced a trap composed of 5 places in 121 ms
[2020-06-04 17:27:36] [INFO ] Deduced a trap composed of 15 places in 134 ms
[2020-06-04 17:27:36] [INFO ] Deduced a trap composed of 9 places in 91 ms
[2020-06-04 17:27:36] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-06-04 17:27:36] [INFO ] Deduced a trap composed of 15 places in 98 ms
[2020-06-04 17:27:37] [INFO ] Deduced a trap composed of 14 places in 76 ms
[2020-06-04 17:27:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3405 ms
Attempting to minimize the solution found.
Minimization took 135 ms.
Incomplete Parikh walk after 127700 steps, including 1000 resets, run finished after 1028 ms. (steps per millisecond=124 ) properties seen :[0] could not realise parikh vector
Support contains 17 out of 1002 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 25 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1002/1002 places, 962/962 transitions.
Starting structural reductions, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 24 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:27:38] [INFO ] Computed 361 place invariants in 7 ms
[2020-06-04 17:27:41] [INFO ] Implicit Places using invariants in 2896 ms returned []
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:27:41] [INFO ] Computed 361 place invariants in 8 ms
[2020-06-04 17:27:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:27:51] [INFO ] Implicit Places using invariants and state equation in 9980 ms returned []
Implicit Place search using SMT with State Equation took 12879 ms to find 0 implicit places.
[2020-06-04 17:27:51] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:27:51] [INFO ] Computed 361 place invariants in 10 ms
[2020-06-04 17:27:54] [INFO ] Dead Transitions using invariants and state equation in 2587 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 100000 steps, including 24 resets, run finished after 848 ms. (steps per millisecond=117 ) properties seen :[0]
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:27:55] [INFO ] Computed 361 place invariants in 8 ms
[2020-06-04 17:27:55] [INFO ] [Real]Absence check using 357 positive place invariants in 571 ms returned sat
[2020-06-04 17:27:55] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 17:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:27:57] [INFO ] [Real]Absence check using state equation in 1771 ms returned sat
[2020-06-04 17:27:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:27:57] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-06-04 17:27:57] [INFO ] Deduced a trap composed of 24 places in 57 ms
[2020-06-04 17:27:57] [INFO ] Deduced a trap composed of 11 places in 24 ms
[2020-06-04 17:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2020-06-04 17:27:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:27:58] [INFO ] [Nat]Absence check using 357 positive place invariants in 230 ms returned sat
[2020-06-04 17:27:58] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 17:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:00] [INFO ] [Nat]Absence check using state equation in 1827 ms returned sat
[2020-06-04 17:28:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 18 places in 93 ms
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-04 17:28:00] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 36 places in 76 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 18 places in 43 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 15 places in 46 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 24 places in 70 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 18 places in 59 ms
[2020-06-04 17:28:01] [INFO ] Deduced a trap composed of 24 places in 61 ms
[2020-06-04 17:28:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1652 ms
[2020-06-04 17:28:01] [INFO ] Computed and/alt/rep : 961/6209/961 causal constraints in 85 ms.
[2020-06-04 17:28:17] [INFO ] Added : 700 causal constraints over 140 iterations in 16093 ms. Result :unknown
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1002 transition count 962
Applied a total of 1 rules in 132 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
// Phase 1: matrix 962 rows 1002 cols
[2020-06-04 17:28:18] [INFO ] Computed 361 place invariants in 34 ms
[2020-06-04 17:28:18] [INFO ] [Real]Absence check using 357 positive place invariants in 443 ms returned sat
[2020-06-04 17:28:18] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-04 17:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:22] [INFO ] [Real]Absence check using state equation in 3983 ms returned sat
[2020-06-04 17:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:28:22] [INFO ] [Real]Added 1 Read/Feed constraints in 28 ms returned sat
[2020-06-04 17:28:22] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2020-06-04 17:28:23] [INFO ] Deduced a trap composed of 12 places in 93 ms
[2020-06-04 17:28:23] [INFO ] Deduced a trap composed of 24 places in 40 ms
[2020-06-04 17:28:23] [INFO ] Deduced a trap composed of 11 places in 22 ms
[2020-06-04 17:28:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 439 ms
[2020-06-04 17:28:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:28:23] [INFO ] [Nat]Absence check using 357 positive place invariants in 313 ms returned sat
[2020-06-04 17:28:23] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-04 17:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:26] [INFO ] [Nat]Absence check using state equation in 2589 ms returned sat
[2020-06-04 17:28:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:28:26] [INFO ] Deduced a trap composed of 5 places in 171 ms
[2020-06-04 17:28:26] [INFO ] Deduced a trap composed of 11 places in 139 ms
[2020-06-04 17:28:26] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 12 places in 110 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 18 places in 126 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 9 places in 106 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 12 places in 84 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 18 places in 46 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 24 places in 35 ms
[2020-06-04 17:28:27] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2020-06-04 17:28:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1516 ms
[2020-06-04 17:28:28] [INFO ] Computed and/alt/rep : 961/6209/961 causal constraints in 66 ms.
[2020-06-04 17:28:48] [INFO ] Added : 775 causal constraints over 155 iterations in 20626 ms.(timeout) Result :sat
[2020-06-04 17:28:48] [INFO ] Deduced a trap composed of 5 places in 129 ms
[2020-06-04 17:28:49] [INFO ] Deduced a trap composed of 6 places in 156 ms
[2020-06-04 17:28:49] [INFO ] Deduced a trap composed of 5 places in 136 ms
[2020-06-04 17:28:49] [INFO ] Deduced a trap composed of 6 places in 171 ms
[2020-06-04 17:28:50] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-06-04 17:28:50] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-06-04 17:28:50] [INFO ] Deduced a trap composed of 9 places in 117 ms
[2020-06-04 17:28:50] [INFO ] Deduced a trap composed of 9 places in 107 ms
[2020-06-04 17:28:51] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-06-04 17:28:51] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2020-06-04 17:28:51] [INFO ] Deduced a trap composed of 8 places in 98 ms
[2020-06-04 17:28:52] [INFO ] Deduced a trap composed of 9 places in 99 ms
[2020-06-04 17:28:52] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-06-04 17:28:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3995 ms
Attempting to minimize the solution found.
Minimization took 150 ms.
[2020-06-04 17:28:52] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-04 17:28:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 22 ms.
[2020-06-04 17:28:53] [INFO ] Flatten gal took : 291 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-040A @ 3570 seconds

FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3562
rslt: Output for ReachabilityFireability @ ShieldIIPs-PT-040A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:28:53 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 29376,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "A (G (((p188 <= 0) OR ((1 <= p900)) OR (p198 <= 0) OR (p200 <= 0) OR (p988 <= 0) OR (p997 <= 0) OR (p1001 <= 0) OR (((p688 <= 0) OR (p696 <= 0) OR (p702 <= 0)) AND (((1 <= p697)) OR ((1 <= p61) AND (1 <= p65) AND (1 <= p76) AND (1 <= p111) AND (1 <= p117) AND (1 <= p127)))))))",
"processed_size": 287,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 4910,
"conflict_clusters": 124,
"places": 1002,
"places_significant": 641,
"singleton_clusters": 0,
"transitions": 962
},
"result":
{
"edges": 84,
"markings": 85,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 64,
"problems": 7
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1964/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32064
lola: finding significant places
lola: 1002 places, 962 transitions, 641 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p900 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p988 <= 1)
lola: LP says that atomic proposition is always true: (p997 <= 1)
lola: LP says that atomic proposition is always true: (p1001 <= 1)
lola: LP says that atomic proposition is always true: (p688 <= 1)
lola: LP says that atomic proposition is always true: (p696 <= 1)
lola: LP says that atomic proposition is always true: (p702 <= 1)
lola: LP says that atomic proposition is always true: (p697 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: A (G (((p188 <= 0) OR ((1 <= p900)) OR (p198 <= 0) OR (p200 <= 0) OR (p988 <= 0) OR (p997 <= 0) OR (p1001 <= 0) OR (((p688 <= 0) OR (p696 <= 0) OR (p702 <= 0)) AND (((1 <= p697)) OR ((1 <= p61) AND (1 <= p65) AND (1 <= p76) AND (1 <= p111) AND (1 <= p117) AND (1 <= p127)))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p188 <= 0) OR ((1 <= p900)) OR (p198 <= 0) OR (p200 <= 0) OR (p988 <= 0) OR (p997 <= 0) OR (p1001 <= 0) OR (((p688 <= 0) OR (p696 <= 0) OR (p702 <= 0)) AND (((1 <= p697)) OR ((1 <= p61) AND (1 <= p65) AND (1 <= p76) AND (1 <= p111) AND (1 <= p117) AND (1 <= p127)))))))
lola: processed formula length: 287
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p188) AND ((p900 <= 0)) AND (1 <= p198) AND (1 <= p200) AND (1 <= p988) AND (1 <= p997) AND (1 <= p1001) AND (((1 <= p688) AND (1 <= p696) AND (1 <= p702)) OR (((p697 <= 0)) AND ((p61 <= 0) OR (p65 <= 0) OR (p76 <= 0) OR (p111 <= 0) OR (p117 <= 0) OR (p127 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 64 literals and 7 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: local time limit reached - aborting
lola: 85 markings, 84 edges
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 29376 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

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="ShieldIIPs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is ShieldIIPs-PT-040A, 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 r211-tajo-159033477100175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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