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.r178-tajo-158987882200334.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 Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591217402481

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:50:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:50:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:50:04] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2020-06-03 20:50:04] [INFO ] Transformed 250 places.
[2020-06-03 20:50:04] [INFO ] Transformed 2600 transitions.
[2020-06-03 20:50:04] [INFO ] Found NUPN structural information;
[2020-06-03 20:50:04] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 254 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 105 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 132 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0]
Probabilistic random walk after 10000001 steps, saw 66418 distinct states, run finished after 25323 ms. (steps per millisecond=394 ) properties seen :[0, 0, 0]
[2020-06-03 20:50:30] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-06-03 20:50:30] [INFO ] Computed 150 place invariants in 12 ms
[2020-06-03 20:50:30] [INFO ] [Real]Absence check using 100 positive place invariants in 60 ms returned sat
[2020-06-03 20:50:30] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-06-03 20:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:31] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-03 20:50:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:50:31] [INFO ] [Nat]Absence check using 100 positive place invariants in 51 ms returned sat
[2020-06-03 20:50:31] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-06-03 20:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:31] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2020-06-03 20:50:31] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:50:31] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-06-03 20:50:31] [INFO ] Deduced a trap composed of 5 places in 139 ms
[2020-06-03 20:50:31] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 85 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 44 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:50:32] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:50:32] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1297 ms
[2020-06-03 20:50:32] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 43 ms.
[2020-06-03 20:50:33] [INFO ] Added : 51 causal constraints over 11 iterations in 345 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 20:50:33] [INFO ] [Real]Absence check using 100 positive place invariants in 29 ms returned sat
[2020-06-03 20:50:33] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 28 ms returned sat
[2020-06-03 20:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:33] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-06-03 20:50:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:50:33] [INFO ] [Nat]Absence check using 100 positive place invariants in 23 ms returned sat
[2020-06-03 20:50:33] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-06-03 20:50:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:33] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2020-06-03 20:50:33] [INFO ] [Nat]Added 50 Read/Feed constraints in 17 ms returned sat
[2020-06-03 20:50:33] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:50:33] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 91 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-06-03 20:50:34] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:50:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 797 ms
[2020-06-03 20:50:34] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 62 ms.
[2020-06-03 20:50:35] [INFO ] Added : 51 causal constraints over 11 iterations in 500 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 20:50:35] [INFO ] [Real]Absence check using 100 positive place invariants in 273 ms returned sat
[2020-06-03 20:50:35] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 20 ms returned sat
[2020-06-03 20:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:35] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 20:50:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:50:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 26 ms returned sat
[2020-06-03 20:50:35] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2020-06-03 20:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:36] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-03 20:50:36] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:50:36] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:50:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 628 ms
[2020-06-03 20:50:36] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 58 ms.
[2020-06-03 20:50:37] [INFO ] Added : 51 causal constraints over 11 iterations in 534 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
Incomplete Parikh walk after 11500 steps, including 98 resets, run finished after 161 ms. (steps per millisecond=71 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA Dekker-PT-050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11700 steps, including 98 resets, run finished after 146 ms. (steps per millisecond=80 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 98 resets, run finished after 143 ms. (steps per millisecond=80 ) properties seen :[1, 0] could not realise parikh vector
FORMULA Dekker-PT-050-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 319 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 923 ms. (steps per millisecond=108 ) properties seen :[0]
[2020-06-03 20:50:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-06-03 20:50:38] [INFO ] Computed 150 place invariants in 6 ms
[2020-06-03 20:50:39] [INFO ] [Real]Absence check using 100 positive place invariants in 50 ms returned sat
[2020-06-03 20:50:39] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-06-03 20:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:39] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-03 20:50:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:50:39] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2020-06-03 20:50:39] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2020-06-03 20:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:50:39] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-03 20:50:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:50:39] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 70 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-06-03 20:50:39] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:50:40] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:50:40] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:50:40] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:50:40] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:50:40] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:50:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 603 ms
[2020-06-03 20:50:40] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 37 ms.
[2020-06-03 20:50:40] [INFO ] Added : 51 causal constraints over 11 iterations in 443 ms. Result :sat
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6152 ms. (steps per millisecond=162 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1792 ms. (steps per millisecond=558 ) properties seen :[0]
Interrupted probabilistic random walk after 11677042 steps, run timeout after 30001 ms. (steps per millisecond=389 ) properties seen :[0]
Probabilistic random walk after 11677042 steps, saw 76147 distinct states, run finished after 30002 ms. (steps per millisecond=389 ) properties seen :[0]
[2020-06-03 20:51:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-06-03 20:51:18] [INFO ] Computed 150 place invariants in 13 ms
[2020-06-03 20:51:18] [INFO ] [Real]Absence check using 100 positive place invariants in 42 ms returned sat
[2020-06-03 20:51:18] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 19 ms returned sat
[2020-06-03 20:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:51:18] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-03 20:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:51:18] [INFO ] [Nat]Absence check using 100 positive place invariants in 23 ms returned sat
[2020-06-03 20:51:18] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 23 ms returned sat
[2020-06-03 20:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:51:19] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2020-06-03 20:51:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:51:19] [INFO ] [Nat]Added 50 Read/Feed constraints in 23 ms returned sat
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:51:19] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:51:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 521 ms
[2020-06-03 20:51:19] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 33 ms.
[2020-06-03 20:51:20] [INFO ] Added : 51 causal constraints over 11 iterations in 422 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 11700 steps, including 98 resets, run finished after 151 ms. (steps per millisecond=77 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 99 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 187 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2020-06-03 20:51:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-06-03 20:51:20] [INFO ] Computed 150 place invariants in 2 ms
[2020-06-03 20:51:21] [INFO ] Implicit Places using invariants in 1101 ms returned [100, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 1105 ms to find 48 implicit places.
[2020-06-03 20:51:21] [INFO ] Redundant transitions in 211 ms returned []
[2020-06-03 20:51:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-06-03 20:51:21] [INFO ] Computed 102 place invariants in 14 ms
[2020-06-03 20:51:24] [INFO ] Dead Transitions using invariants and state equation in 2084 ms returned []
Starting structural reductions, iteration 1 : 202/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 105 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2020-06-03 20:51:24] [INFO ] Redundant transitions in 50 ms returned []
[2020-06-03 20:51:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-06-03 20:51:24] [INFO ] Computed 102 place invariants in 1 ms
[2020-06-03 20:51:26] [INFO ] Dead Transitions using invariants and state equation in 2117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 202/250 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6890 ms. (steps per millisecond=145 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties seen :[0]
Interrupted probabilistic random walk after 15162609 steps, run timeout after 30001 ms. (steps per millisecond=505 ) properties seen :[0]
Probabilistic random walk after 15162609 steps, saw 96641 distinct states, run finished after 30001 ms. (steps per millisecond=505 ) properties seen :[0]
[2020-06-03 20:52:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-06-03 20:52:04] [INFO ] Computed 102 place invariants in 3 ms
[2020-06-03 20:52:04] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2020-06-03 20:52:04] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 2 ms returned sat
[2020-06-03 20:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:04] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2020-06-03 20:52:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2020-06-03 20:52:04] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2020-06-03 20:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:04] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2020-06-03 20:52:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:52:05] [INFO ] [Nat]Added 50 Read/Feed constraints in 15 ms returned sat
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 230 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-06-03 20:52:05] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:52:06] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:52:06] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 1381 ms
[2020-06-03 20:52:06] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 46 ms.
[2020-06-03 20:52:06] [INFO ] Added : 51 causal constraints over 11 iterations in 394 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 13100 steps, including 98 resets, run finished after 260 ms. (steps per millisecond=50 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 95 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 2600/2600 transitions.
Starting structural reductions, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 92 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2020-06-03 20:52:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-06-03 20:52:07] [INFO ] Computed 102 place invariants in 1 ms
[2020-06-03 20:52:07] [INFO ] Implicit Places using invariants in 692 ms returned []
[2020-06-03 20:52:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-06-03 20:52:07] [INFO ] Computed 102 place invariants in 2 ms
[2020-06-03 20:52:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:52:08] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2020-06-03 20:52:08] [INFO ] Redundant transitions in 203 ms returned []
[2020-06-03 20:52:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2020-06-03 20:52:08] [INFO ] Computed 102 place invariants in 1 ms
[2020-06-03 20:52:10] [INFO ] Dead Transitions using invariants and state equation in 1735 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 2600/2600 transitions.
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Graph (complete) has 310 edges and 202 vertex of which 18 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.35 ms
Ensure Unique test removed 2 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 195 place count 16 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 199 place count 14 transition count 14
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 202 place count 14 transition count 11
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 211 place count 8 transition count 8
Applied a total of 211 rules in 47 ms. Remains 8 /202 variables (removed 194) and now considering 8/2600 (removed 2592) transitions.
// Phase 1: matrix 8 rows 8 cols
[2020-06-03 20:52:10] [INFO ] Computed 4 place invariants in 0 ms
[2020-06-03 20:52:10] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2020-06-03 20:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2020-06-03 20:52:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:52:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 20:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:52:10] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2020-06-03 20:52:10] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints in 0 ms.
[2020-06-03 20:52:10] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2020-06-03 20:52:10] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2020-06-03 20:52:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
[2020-06-03 20:52:11] [INFO ] Flatten gal took : 308 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Dekker-PT-050 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ Dekker-PT-050

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:52:11 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 79196,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p114 <= 0)) OR ((1 <= p167)) OR ((p26 <= 0)) OR ((1 <= p102)))))",
"processed_size": 76,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 17652,
"conflict_clusters": 1,
"places": 202,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 2600
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"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: 2802/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 202
lola: finding significant places
lola: 202 places, 2600 transitions, 100 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: A (G ((((p114 <= 0)) OR ((1 <= p167)) OR ((p26 <= 0)) OR ((1 <= p102)))))
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 ((((p114 <= 0)) OR ((1 <= p167)) OR ((p26 <= 0)) OR ((1 <= p102)))))
lola: processed formula length: 76
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p114)) AND ((p167 <= 0)) AND ((1 <= p26)) AND ((p102 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 79196 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
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 Dekker-PT-050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;