Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r193-csrt-159033389200740.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is EGFr-PT-02010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r193-csrt-159033389200740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.0K May 13 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 13 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 13 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 6 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 59K May 12 20:53 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 EGFr-PT-02010-CTLFireability-00
FORMULA_NAME EGFr-PT-02010-CTLFireability-01
FORMULA_NAME EGFr-PT-02010-CTLFireability-02
FORMULA_NAME EGFr-PT-02010-CTLFireability-03
FORMULA_NAME EGFr-PT-02010-CTLFireability-04
FORMULA_NAME EGFr-PT-02010-CTLFireability-05
FORMULA_NAME EGFr-PT-02010-CTLFireability-06
FORMULA_NAME EGFr-PT-02010-CTLFireability-07
FORMULA_NAME EGFr-PT-02010-CTLFireability-08
FORMULA_NAME EGFr-PT-02010-CTLFireability-09
FORMULA_NAME EGFr-PT-02010-CTLFireability-10
FORMULA_NAME EGFr-PT-02010-CTLFireability-11
FORMULA_NAME EGFr-PT-02010-CTLFireability-12
FORMULA_NAME EGFr-PT-02010-CTLFireability-13
FORMULA_NAME EGFr-PT-02010-CTLFireability-14
FORMULA_NAME EGFr-PT-02010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590556254807

[2020-05-27 05:10:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 05:10:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 05:10:57] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-27 05:10:57] [INFO ] Transformed 40 places.
[2020-05-27 05:10:57] [INFO ] Transformed 68 transitions.
[2020-05-27 05:10:57] [INFO ] Found NUPN structural information;
[2020-05-27 05:10:57] [INFO ] Parsed PT model containing 40 places and 68 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Incomplete random walk after 100000 steps, including 4480 resets, run finished after 362 ms. (steps per millisecond=276 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1]
[2020-05-27 05:10:57] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2020-05-27 05:10:57] [INFO ] Computed 20 place invariants in 6 ms
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 80 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-05-27 05:10:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 6 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 13 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 9 ms.
[2020-05-27 05:10:58] [INFO ] Added : 26 causal constraints over 6 iterations in 101 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 14 ms.
[2020-05-27 05:10:58] [INFO ] Added : 27 causal constraints over 6 iterations in 61 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 8 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Deduced a trap composed of 2 places in 34 ms
[2020-05-27 05:10:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned unsat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:58] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 7 ms.
[2020-05-27 05:10:58] [INFO ] Added : 27 causal constraints over 6 iterations in 34 ms. Result :sat
[2020-05-27 05:10:58] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Deduced a trap composed of 2 places in 13 ms
[2020-05-27 05:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-05-27 05:10:59] [INFO ] Added : 31 causal constraints over 7 iterations in 34 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 2 ms returned unsat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 11 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Deduced a trap composed of 2 places in 18 ms
[2020-05-27 05:10:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 11 ms.
[2020-05-27 05:10:59] [INFO ] Added : 28 causal constraints over 6 iterations in 64 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned unsat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-05-27 05:10:59] [INFO ] Deduced a trap composed of 2 places in 11 ms
[2020-05-27 05:10:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 15 ms
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 41 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 11 ms.
[2020-05-27 05:10:59] [INFO ] Added : 26 causal constraints over 6 iterations in 48 ms. Result :sat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2020-05-27 05:10:59] [INFO ] Deduced a trap composed of 2 places in 10 ms
[2020-05-27 05:10:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned unsat
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:10:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:10:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-27 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:10:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-05-27 05:11:00] [INFO ] Deduced a trap composed of 2 places in 11 ms
[2020-05-27 05:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2020-05-27 05:11:00] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 4 ms.
[2020-05-27 05:11:00] [INFO ] Added : 29 causal constraints over 6 iterations in 46 ms. Result :sat
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Added 22 Read/Feed constraints in 3 ms returned unsat
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2020-05-27 05:11:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 05:11:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-05-27 05:11:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 2 ms returned sat
[2020-05-27 05:11:00] [INFO ] Computed and/alt/rep : 65/85/36 causal constraints in 3 ms.
[2020-05-27 05:11:00] [INFO ] Added : 27 causal constraints over 6 iterations in 27 ms. Result :sat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-05-27 05:11:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 05:11:00] [INFO ] Flatten gal took : 89 ms
[2020-05-27 05:11:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 05:11:00] [INFO ] Flatten gal took : 31 ms
FORMULA EGFr-PT-02010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 05:11:00] [INFO ] Applying decomposition
[2020-05-27 05:11:00] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph15373937217986414010.txt, -o, /tmp/graph15373937217986414010.bin, -w, /tmp/graph15373937217986414010.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15373937217986414010.bin, -l, -1, -v, -w, /tmp/graph15373937217986414010.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 05:11:00] [INFO ] Decomposing Gal with order
[2020-05-27 05:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 05:11:00] [INFO ] Removed a total of 92 redundant transitions.
[2020-05-27 05:11:00] [INFO ] Flatten gal took : 38 ms
[2020-05-27 05:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2020-05-27 05:11:00] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 6 ms
[2020-05-27 05:11:00] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 21 ordering constraints for composite.
built 13 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4200,0.030806,5004,76,6,576,38,205,1099,12,43,0


Converting to forward existential form...Done !
original formula: (AX(EF(((i2.u11.ERBB2_3_equals_1==1)&&(i2.u12.ERBB3_equals_0==1)))) * !(EG(((((i0.i1.u2.CDK4_equals_0==1)&&(i1.u4.CyclinD1_equals_1==1))&&(i0.i1.u17.p21_equals_0==1))&&(i0.i0.u18.p27_equals_0==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((i2.u11.ERBB2_3_equals_1==1)&&(i2.u12.ERBB3_equals_0==1)))))] = FALSE * [FwdG(Init,((((i0.i1.u2.CDK4_equals_0==1)&&(i1.u4.CyclinD1_equals_1==1))&&(i0.i1.u17.p21_equals_0==1))&&(i0.i0.u18.p27_equals_0==1)))] = FALSE)
dead was empty
Reverse transition relation is NOT exact ! Due to transitions AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB1_2_equals_1, AKT1_equals_0_to_AKT1_equals_1_when_ERBB2_3_equals_1, CDK4_equals_0_to_CDK4_equals_1_when_CyclinD1_equals_1_and_p21_equals_0_and_p27_equals_0, CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_0_and_ERalpha_equals_1_and_MEK1_equals_1_and_MYC_equals_1, CyclinD1_equals_0_to_CyclinD1_equals_1_when_AKT1_equals_1_and_ERalpha_equals_1_and_MYC_equals_1, ERBB1_equals_0_to_ERBB1_equals_1_when_EGF_equals_1, ERalpha_equals_0_to_ERalpha_equals_1_when_MEK1_equals_1, IGF1R_equals_1_to_IGF1R_equals_0_when_ERBB2_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_ERBB2_3_equals_1, MEK1_equals_0_to_MEK1_equals_1_when_IGF1R_equals_1, MYC_equals_0_to_MYC_equals_1_when_AKT1_equals_1, MYC_equals_0_to_MYC_equals_1_when_ERalpha_equals_1, MYC_equals_0_to_MYC_equals_1_when_MEK1_equals_1, p21_equals_1_to_p21_equals_0_when_AKT1_equals_1, p21_equals_1_to_p21_equals_0_when_MYC_equals_1, i1.CDK6_equals_0_to_CDK6_equals_1_when_CyclinD1_equals_1, i2.ERBB3_equals_0_to_ERBB3_equals_1_when_EGF_equals_1, i2.ERBB2_3_equals_0_to_ERBB2_3_equals_1_when_ERBB2_equals_1_and_ERBB3_equals_1, i2.ERBB2_equals_0_to_ERBB2_equals_1_when_EGF_equals_1, i2.u6.EGF_equals_0_to_EGF_equals_1, i3.MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_3_equals_1, i3.MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_2_equals_1, i3.MEK1_equals_0_to_MEK1_equals_1_when_ERBB1_equals_1, i4.ERalpha_equals_0_to_ERalpha_equals_1_when_AKT1_equals_1, i4.AKT1_equals_0_to_AKT1_equals_1_when_IGF1R_equals_1, i5.CyclinE1_equals_0_to_CyclinE1_equals_1_when_MYC_equals_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :30/8/27/65
(forward)formula 0,0,0.076142,7028,1,0,4900,38,890,6094,45,43,12492
FORMULA EGFr-PT-02010-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (AG(((((i0.i0.u1.CDK2_equals_0==1)&&(i5.u5.CyclinE1_equals_1==1))&&(i0.i1.u17.p21_equals_0==1))&&(i0.i0.u18.p27_equals_0==1))) + EF(((i3.u7.ERBB1_equals_0==1)&&(i3.u9.ERBB1_3_equals_1==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U ((i3.u7.ERBB1_equals_0==1)&&(i3.u9.ERBB1_3_equals_1==1))))),TRUE) * !(((((i0.i0.u1.CDK2_equals_0==1)&&(i5.u5.CyclinE1_equals_1==1))&&(i0.i1.u17.p21_equals_0==1))&&(i0.i0.u18.p27_equals_0==1))))] = FALSE
(forward)formula 1,0,0.08509,7292,1,0,5127,38,1069,6591,46,43,14044
FORMULA EGFr-PT-02010-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF((EX((((i4.u0.AKT1_equals_1==1)&&(i0.i1.u17.p21_equals_1==1))||(((((i4.u0.AKT1_0==1)&&(i0.i0.u1.CDK2_equals_0==1))&&(i0.i1.u2.CDK4_equals_0==1))&&(i5.u16.MYC_equals_0==1))&&(i0.i0.u18.p27_equals_0==1)))) * ((((((i2.u6.EGF_equals_1==1)&&(i3.u7.ERBB1_equals_0==1))&&(i3.u9.ERBB1_3_equals_1==1))&&(i2.u12.ERBB3_equals_0==1))&&((i0.i1.u2.CDK4_equals_1!=1)||(i0.i1.u17.p21_equals_1!=1)))||(((i3.u8.ERBB1_2_equals_1==1)&&(i2.u10.ERBB2_equals_0==1))&&(((i0.i0.u1.CDK2_equals_1==1)&&(i5.u5.CyclinE1_equals_0==1))||((i1.u4.CyclinD1_equals_1==1)&&(i5.u16.MYC_equals_0==1)))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * ((((((i2.u6.EGF_equals_1==1)&&(i3.u7.ERBB1_equals_0==1))&&(i3.u9.ERBB1_3_equals_1==1))&&(i2.u12.ERBB3_equals_0==1))&&((i0.i1.u2.CDK4_equals_1!=1)||(i0.i1.u17.p21_equals_1!=1)))||(((i3.u8.ERBB1_2_equals_1==1)&&(i2.u10.ERBB2_equals_0==1))&&(((i0.i0.u1.CDK2_equals_1==1)&&(i5.u5.CyclinE1_equals_0==1))||((i1.u4.CyclinD1_equals_1==1)&&(i5.u16.MYC_equals_0==1))))))) * (((i4.u0.AKT1_equals_1==1)&&(i0.i1.u17.p21_equals_1==1))||(((((i4.u0.AKT1_0==1)&&(i0.i0.u1.CDK2_equals_0==1))&&(i0.i1.u2.CDK4_equals_0==1))&&(i5.u16.MYC_equals_0==1))&&(i0.i0.u18.p27_equals_0==1))))] != FALSE
(forward)formula 2,0,0.090474,7556,1,0,5144,38,1134,6597,47,43,14182
FORMULA EGFr-PT-02010-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: (!(AF(((i4.u13.ERalpha_equals_1==1)&&(i5.u16.MYC_equals_0==1)))) * E((((((i4.u0.AKT1_equals_1!=1)||(i2.u11.ERBB2_3_equals_0!=1))||(i4.u14.IGF1R_equals_0!=1))&&(i4.u13.ERalpha_equals_1==1))&&(i5.u16.MYC_equals_0==1)) U EF(((i2.u11.ERBB2_3_equals_1==1)&&(i4.u14.IGF1R_equals_1==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU((Init * !(!(EG(!(((i4.u13.ERalpha_equals_1==1)&&(i5.u16.MYC_equals_0==1))))))),(((((i4.u0.AKT1_equals_1!=1)||(i2.u11.ERBB2_3_equals_0!=1))||(i4.u14.IGF1R_equals_0!=1))&&(i4.u13.ERalpha_equals_1==1))&&(i5.u16.MYC_equals_0==1))),TRUE) * ((i2.u11.ERBB2_3_equals_1==1)&&(i4.u14.IGF1R_equals_1==1)))] != FALSE
(forward)formula 3,1,0.121156,8612,1,0,7409,38,1195,9108,48,43,17264
FORMULA EGFr-PT-02010-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AF(((((i4.u0.AKT1_0==1)&&(i4.u13.ERalpha_equals_0==1))&&(i3.u15.MEK1_equals_0==1))&&(i5.u16.MYC_equals_1==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((i4.u0.AKT1_0==1)&&(i4.u13.ERalpha_equals_0==1))&&(i3.u15.MEK1_equals_0==1))&&(i5.u16.MYC_equals_1==1))))] = FALSE
(forward)formula 4,0,0.121977,8612,1,0,7409,38,1206,9112,48,43,17310
FORMULA EGFr-PT-02010-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EX(AF(((((i4.u0.AKT1_equals_1==1)&&(i5.u16.MYC_equals_0==1))&&(i3.u9.ERBB1_3_equals_1==1))&&(i3.u15.MEK1_equals_0==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((((i4.u0.AKT1_equals_1==1)&&(i5.u16.MYC_equals_0==1))&&(i3.u9.ERBB1_3_equals_1==1))&&(i3.u15.MEK1_equals_0==1))))))] != FALSE
(forward)formula 5,0,0.142358,8876,1,0,9026,38,1225,10864,48,43,19601
FORMULA EGFr-PT-02010-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(AF((((i2.u6.EGF_equals_1==1)&&(i2.u10.ERBB2_equals_0==1))||((((i4.u0.AKT1_0==1)&&(i4.u13.ERalpha_equals_0==1))&&(i3.u15.MEK1_equals_0==1))&&(i5.u16.MYC_equals_1==1)))) U AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((((i2.u6.EGF_equals_1==1)&&(i2.u10.ERBB2_equals_0==1))||((((i4.u0.AKT1_0==1)&&(i4.u13.ERalpha_equals_0==1))&&(i3.u15.MEK1_equals_0==1))&&(i5.u16.MYC_equals_1==1))))))) * !(EX(!(FALSE))))] != FALSE
(forward)formula 6,0,0.160413,9404,1,0,10384,38,1245,12445,48,43,22270
FORMULA EGFr-PT-02010-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(EX(EG(((i2.u6.EGF_equals_1==1)&&(i3.u7.ERBB1_equals_0==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),((i2.u6.EGF_equals_1==1)&&(i3.u7.ERBB1_equals_0==1)))] != FALSE
dead was empty
(forward)formula 7,0,0.161006,9668,1,0,10386,38,1245,12448,48,43,22293
FORMULA EGFr-PT-02010-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(((((((i4.u0.AKT1_0==1)&&(i0.i0.u1.CDK2_equals_0==1))&&(i0.i1.u2.CDK4_equals_0==1))&&(i5.u16.MYC_equals_0==1))&&(i0.i0.u18.p27_equals_0==1))||((((i1.u4.CyclinD1_equals_1==1)&&(i4.u13.ERalpha_equals_0==1))&&(i2.u6.EGF_equals_0==1))&&(i2.u12.ERBB3_equals_1==1))) U AG((((i3.u7.ERBB1_equals_1==1)&&(i3.u8.ERBB1_2_equals_0==1))&&(i2.u10.ERBB2_equals_1==1))))
=> equivalent forward existential formula: [(FwdU(Init,((((((i4.u0.AKT1_0==1)&&(i0.i0.u1.CDK2_equals_0==1))&&(i0.i1.u2.CDK4_equals_0==1))&&(i5.u16.MYC_equals_0==1))&&(i0.i0.u18.p27_equals_0==1))||((((i1.u4.CyclinD1_equals_1==1)&&(i4.u13.ERalpha_equals_0==1))&&(i2.u6.EGF_equals_0==1))&&(i2.u12.ERBB3_equals_1==1)))) * !(E(TRUE U !((((i3.u7.ERBB1_equals_1==1)&&(i3.u8.ERBB1_2_equals_0==1))&&(i2.u10.ERBB2_equals_1==1))))))] != FALSE
(forward)formula 8,0,0.162673,9668,1,0,10441,38,1257,12554,48,43,22408
FORMULA EGFr-PT-02010-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(AG(EF(((i3.u8.ERBB1_2_equals_1==1)&&(i3.u15.MEK1_equals_0==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i3.u8.ERBB1_2_equals_1==1)&&(i3.u15.MEK1_equals_0==1)))))] != FALSE
(forward)formula 9,1,0.164674,9932,1,0,10564,38,1261,12714,48,43,22680
FORMULA EGFr-PT-02010-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(AF((((((i1.u4.CyclinD1_equals_1==1)&&(i5.u16.MYC_equals_0==1))||((((i4.u0.AKT1_0==1)&&(i2.u11.ERBB2_3_equals_0==1))&&(i4.u13.ERalpha_equals_1==1))&&(i4.u14.IGF1R_equals_0==1)))&&((i4.u0.AKT1_0!=1)||(i3.u7.ERBB1_equals_1!=1))) + EG(((i4.u0.AKT1_0==1)&&(i3.u8.ERBB1_2_equals_1==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((((i1.u4.CyclinD1_equals_1==1)&&(i5.u16.MYC_equals_0==1))||((((i4.u0.AKT1_0==1)&&(i2.u11.ERBB2_3_equals_0==1))&&(i4.u13.ERalpha_equals_1==1))&&(i4.u14.IGF1R_equals_0==1)))&&((i4.u0.AKT1_0!=1)||(i3.u7.ERBB1_equals_1!=1))) + EG(((i4.u0.AKT1_0==1)&&(i3.u8.ERBB1_2_equals_1==1))))))] != FALSE
(forward)formula 10,1,0.167567,9932,1,0,10567,38,1296,12717,48,43,22777
FORMULA EGFr-PT-02010-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: !(AF((((((((i3.u7.ERBB1_equals_0!=1)||(i3.u9.ERBB1_3_equals_1!=1))&&(i2.u11.ERBB2_3_equals_1==1))&&(i3.u15.MEK1_equals_0==1))&&(i4.u0.AKT1_equals_1==1))&&(i0.i1.u17.p21_equals_1==1)) * EG((((i0.i1.u2.CDK4_equals_1==1)&&(i1.u3.CDK6_equals_1==1))&&(i1.u19.pRB1_equals_0==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((i3.u7.ERBB1_equals_0!=1)||(i3.u9.ERBB1_3_equals_1!=1))&&(i2.u11.ERBB2_3_equals_1==1))&&(i3.u15.MEK1_equals_0==1))&&(i4.u0.AKT1_equals_1==1))&&(i0.i1.u17.p21_equals_1==1)) * EG((((i0.i1.u2.CDK4_equals_1==1)&&(i1.u3.CDK6_equals_1==1))&&(i1.u19.pRB1_equals_0==1))))))] != FALSE
(forward)formula 11,1,0.169879,9932,1,0,10567,38,1333,12722,48,43,22810
FORMULA EGFr-PT-02010-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX((EG((((i3.u7.ERBB1_equals_1==1)&&(i3.u15.MEK1_equals_0==1))||((((i4.u0.AKT1_0==1)&&(i4.u13.ERalpha_equals_0==1))&&(i3.u15.MEK1_equals_0==1))&&(i5.u16.MYC_equals_1==1)))) + EF((((((i4.u0.AKT1_0==1)&&(i0.i0.u1.CDK2_equals_0==1))&&(i0.i1.u2.CDK4_equals_0==1))&&(i5.u16.MYC_equals_0==1))&&(i0.i0.u18.p27_equals_0==1)))))
=> equivalent forward existential formula: [((EY(Init) * !(E(TRUE U (((((i4.u0.AKT1_0==1)&&(i0.i0.u1.CDK2_equals_0==1))&&(i0.i1.u2.CDK4_equals_0==1))&&(i5.u16.MYC_equals_0==1))&&(i0.i0.u18.p27_equals_0==1))))) * !(EG((((i3.u7.ERBB1_equals_1==1)&&(i3.u15.MEK1_equals_0==1))||((((i4.u0.AKT1_0==1)&&(i4.u13.ERalpha_equals_0==1))&&(i3.u15.MEK1_equals_0==1))&&(i5.u16.MYC_equals_1==1))))))] = FALSE
(forward)formula 12,0,0.173776,9932,1,0,10693,38,1346,12925,48,43,23121
FORMULA EGFr-PT-02010-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EX(AF(((i3.u7.ERBB1_equals_1==1)&&(i3.u15.MEK1_equals_0==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((i3.u7.ERBB1_equals_1==1)&&(i3.u15.MEK1_equals_0==1))))))] != FALSE
(forward)formula 13,0,0.187269,10196,1,0,11903,38,1359,14072,48,43,24705
FORMULA EGFr-PT-02010-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1590556261339

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="EGFr-PT-02010"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EGFr-PT-02010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r193-csrt-159033389200740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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