Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546100060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 SmartHome-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.1K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.0K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 64K 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 SmartHome-PT-08-CTLFireability-00
FORMULA_NAME SmartHome-PT-08-CTLFireability-01
FORMULA_NAME SmartHome-PT-08-CTLFireability-02
FORMULA_NAME SmartHome-PT-08-CTLFireability-03
FORMULA_NAME SmartHome-PT-08-CTLFireability-04
FORMULA_NAME SmartHome-PT-08-CTLFireability-05
FORMULA_NAME SmartHome-PT-08-CTLFireability-06
FORMULA_NAME SmartHome-PT-08-CTLFireability-07
FORMULA_NAME SmartHome-PT-08-CTLFireability-08
FORMULA_NAME SmartHome-PT-08-CTLFireability-09
FORMULA_NAME SmartHome-PT-08-CTLFireability-10
FORMULA_NAME SmartHome-PT-08-CTLFireability-11
FORMULA_NAME SmartHome-PT-08-CTLFireability-12
FORMULA_NAME SmartHome-PT-08-CTLFireability-13
FORMULA_NAME SmartHome-PT-08-CTLFireability-14
FORMULA_NAME SmartHome-PT-08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1590483696324

[2020-05-26 09:01:37] [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-26 09:01:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:38] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-05-26 09:01:38] [INFO ] Transformed 252 places.
[2020-05-26 09:01:38] [INFO ] Transformed 291 transitions.
[2020-05-26 09:01:38] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:38] [INFO ] Parsed PT model containing 252 places and 291 transitions in 122 ms.
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 21 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 60 ms.
Incomplete random walk after 100000 steps, including 575 resets, run finished after 181 ms. (steps per millisecond=552 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
// Phase 1: matrix 270 rows 232 cols
[2020-05-26 09:01:38] [INFO ] Computed 11 place invariants in 7 ms
[2020-05-26 09:01:38] [INFO ] [Real]Absence check using 11 positive place invariants in 29 ms returned sat
[2020-05-26 09:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:38] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 47 places in 206 ms
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 50 places in 127 ms
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 56 places in 57 ms
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 51 places in 41 ms
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 74 places in 76 ms
[2020-05-26 09:01:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 640 ms
[2020-05-26 09:01:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned sat
[2020-05-26 09:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:39] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 33 places in 104 ms
[2020-05-26 09:01:39] [INFO ] Deduced a trap composed of 49 places in 85 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 51 places in 45 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 29 places in 74 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 50 places in 36 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 71 places in 36 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 74 places in 48 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 47 places in 35 ms
[2020-05-26 09:01:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 745 ms
[2020-05-26 09:01:40] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 40 ms.
[2020-05-26 09:01:41] [INFO ] Added : 269 causal constraints over 54 iterations in 1129 ms. Result :sat
[2020-05-26 09:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-26 09:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:41] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 33 places in 47 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 46 places in 32 ms
[2020-05-26 09:01:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2020-05-26 09:01:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 106 ms returned sat
[2020-05-26 09:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:42] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2020-05-26 09:01:42] [INFO ] Deduced a trap composed of 33 places in 54 ms
[2020-05-26 09:01:42] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-05-26 09:01:42] [INFO ] Deduced a trap composed of 46 places in 43 ms
[2020-05-26 09:01:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 173 ms
[2020-05-26 09:01:42] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 12 ms.
[2020-05-26 09:01:43] [INFO ] Added : 266 causal constraints over 54 iterations in 1042 ms. Result :sat
[2020-05-26 09:01:43] [INFO ] Deduced a trap composed of 27 places in 21 ms
[2020-05-26 09:01:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2020-05-26 09:01:43] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:43] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-05-26 09:01:43] [INFO ] Deduced a trap composed of 32 places in 120 ms
[2020-05-26 09:01:43] [INFO ] Deduced a trap composed of 46 places in 74 ms
[2020-05-26 09:01:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2020-05-26 09:01:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 135 ms returned sat
[2020-05-26 09:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:44] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-05-26 09:01:44] [INFO ] Deduced a trap composed of 32 places in 110 ms
[2020-05-26 09:01:44] [INFO ] Deduced a trap composed of 46 places in 146 ms
[2020-05-26 09:01:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2020-05-26 09:01:44] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 24 ms.
[2020-05-26 09:01:45] [INFO ] Added : 269 causal constraints over 54 iterations in 1178 ms. Result :sat
[2020-05-26 09:01:45] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:45] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 27 places in 128 ms
[2020-05-26 09:01:46] [INFO ] Deduced a trap composed of 51 places in 999 ms
[2020-05-26 09:01:46] [INFO ] Deduced a trap composed of 46 places in 53 ms
[2020-05-26 09:01:47] [INFO ] Deduced a trap composed of 57 places in 94 ms
[2020-05-26 09:01:47] [INFO ] Deduced a trap composed of 57 places in 95 ms
[2020-05-26 09:01:47] [INFO ] Deduced a trap composed of 76 places in 133 ms
[2020-05-26 09:01:47] [INFO ] Deduced a trap composed of 75 places in 27 ms
[2020-05-26 09:01:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1622 ms
[2020-05-26 09:01:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 373 ms returned sat
[2020-05-26 09:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:48] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 35 places in 58 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 27 places in 87 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 51 places in 46 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 46 places in 43 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 57 places in 43 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 57 places in 32 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 76 places in 26 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 51 places in 27 ms
[2020-05-26 09:01:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 440 ms
[2020-05-26 09:01:48] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 14 ms.
[2020-05-26 09:01:49] [INFO ] Added : 269 causal constraints over 54 iterations in 959 ms. Result :sat
[2020-05-26 09:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-26 09:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:49] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 46 places in 41 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 33 places in 27 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 39 places in 24 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 32 places in 15 ms
[2020-05-26 09:01:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 157 ms
[2020-05-26 09:01:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 118 ms returned sat
[2020-05-26 09:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:50] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2020-05-26 09:01:50] [INFO ] Deduced a trap composed of 38 places in 40 ms
[2020-05-26 09:01:50] [INFO ] Deduced a trap composed of 33 places in 28 ms
[2020-05-26 09:01:50] [INFO ] Deduced a trap composed of 46 places in 21 ms
[2020-05-26 09:01:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 130 ms
[2020-05-26 09:01:50] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 12 ms.
[2020-05-26 09:01:51] [INFO ] Added : 269 causal constraints over 54 iterations in 906 ms. Result :sat
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-26 09:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-05-26 09:01:51] [INFO ] Deduced a trap composed of 50 places in 51 ms
[2020-05-26 09:01:51] [INFO ] Deduced a trap composed of 32 places in 102 ms
[2020-05-26 09:01:51] [INFO ] Deduced a trap composed of 76 places in 70 ms
[2020-05-26 09:01:51] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-05-26 09:01:51] [INFO ] Deduced a trap composed of 27 places in 29 ms
[2020-05-26 09:01:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 379 ms
[2020-05-26 09:01:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 135 ms returned sat
[2020-05-26 09:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:52] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2020-05-26 09:01:52] [INFO ] Deduced a trap composed of 35 places in 119 ms
[2020-05-26 09:01:52] [INFO ] Deduced a trap composed of 32 places in 74 ms
[2020-05-26 09:01:52] [INFO ] Deduced a trap composed of 36 places in 56 ms
[2020-05-26 09:01:52] [INFO ] Deduced a trap composed of 28 places in 168 ms
[2020-05-26 09:01:52] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2020-05-26 09:01:52] [INFO ] Deduced a trap composed of 47 places in 27 ms
[2020-05-26 09:01:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 595 ms
[2020-05-26 09:01:52] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 22 ms.
[2020-05-26 09:01:53] [INFO ] Added : 268 causal constraints over 54 iterations in 1117 ms. Result :sat
[2020-05-26 09:01:53] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2020-05-26 09:01:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2020-05-26 09:01:54] [INFO ] Flatten gal took : 85 ms
[2020-05-26 09:01:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:01:54] [INFO ] Flatten gal took : 15 ms
FORMULA SmartHome-PT-08-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:01:54] [INFO ] Applying decomposition
[2020-05-26 09:01:54] [INFO ] Flatten gal took : 12 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/graph8298814620994708063.txt, -o, /tmp/graph8298814620994708063.bin, -w, /tmp/graph8298814620994708063.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/graph8298814620994708063.bin, -l, -1, -v, -w, /tmp/graph8298814620994708063.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:01:54] [INFO ] Decomposing Gal with order
[2020-05-26 09:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:01:54] [INFO ] Removed a total of 55 redundant transitions.
[2020-05-26 09:01:54] [INFO ] Flatten gal took : 51 ms
[2020-05-26 09:01:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2020-05-26 09:01:54] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 23 ms
[2020-05-26 09:01:54] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 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 15 CTL formulae.
built 28 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 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,8.06569e+11,0.819373,32256,2732,269,49819,1248,530,100212,112,8928,0


Converting to forward existential form...Done !
original formula: ((AF((AF((i2.i0.u5.p25==1)) * EG((i11.i2.u70.p204==1)))) + EX(AF((i5.i0.u44.p113==1)))) + EF(EG((i2.i0.u6.p26==1))))
=> equivalent forward existential formula: [FwdG(((Init * !(E(TRUE U EG((i2.i0.u6.p26==1))))) * !(EX(!(EG(!((i5.i0.u44.p113==1))))))),!((!(EG(!((i2.i0.u5.p25==1)))) * EG((i11.i2.u70.p204==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t57, t112, t148, t184, t219, u1.t251, u1.t252, u1.t253, u1.t254, u1.t255, u1.t256, u1.t257, u1.t258, u1.t259, u1.t260, i2.i0.t244, i2.i0.t246, i2.i0.u13.t220, i2.i0.u13.t248, i3.i1.t188, i3.i1.u22.t185, i3.i1.u22.t213, i4.i0.t173, i4.i0.t175, i4.i0.u25.t149, i4.i0.u25.t177, i5.i0.t137, i5.i0.t139, i5.i0.u44.t113, i5.i0.u44.t141, i6.u75.t10, i6.u75.t11, i6.u75.t12, i6.u75.t13, i6.u75.t14, i8.t103, i8.t101, i8.t97, i8.t62, i8.u62.t58, i8.u62.t59, i8.u62.t105, i11.t47, i11.t20, i11.i0.u64.t21, i11.i0.u64.t49, i11.i0.u76.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/216/48/264
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,4.7972,180476,1,0,373640,2390,3470,561058,531,13653,862436
FORMULA SmartHome-PT-08-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG(AX((i2.i1.u9.p31!=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((i2.i1.u9.p31!=1)))] != FALSE
(forward)formula 1,1,4.92228,186548,1,0,385326,2394,3504,589456,540,13673,874358
FORMULA SmartHome-PT-08-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(AX((i2.i0.u7.p27==1))) U (((i5.i0.u44.p138==1)&&(i12.i1.u80.p247==1))||((i8.u62.p185==1)&&(i12.i1.u80.p250==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!((i2.i0.u7.p27==1)))))) * (((i5.i0.u44.p138==1)&&(i12.i1.u80.p247==1))||((i8.u62.p185==1)&&(i12.i1.u80.p250==1))))] != FALSE
(forward)formula 2,1,93.0251,2014768,1,0,3.59858e+06,2436,3534,5.71623e+06,541,15198,3041212
FORMULA SmartHome-PT-08-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((EF((i4.i1.u30.p95==1)) * (((i4.i1.u32.p99==1)||(i5.i1.u40.p130!=1))||(i2.i0.u13.p19!=1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (i4.i1.u30.p95==1))))] = FALSE * [(FwdU(Init,TRUE) * !((((i4.i1.u32.p99==1)||(i5.i1.u40.p130!=1))||(i2.i0.u13.p19!=1))))] = FALSE)
(forward)formula 3,0,93.0525,2016088,1,0,3.60202e+06,2437,3547,5.72099e+06,541,15199,3044768
FORMULA SmartHome-PT-08-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AX((((i12.i0.u81.p248==1)&&(i12.i0.u82.p251==1))&&(i2.i0.u13.p45==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((((i12.i0.u81.p248==1)&&(i12.i0.u82.p251==1))&&(i2.i0.u13.p45==1))))))] != FALSE
(forward)formula 4,1,93.0964,2017936,1,0,3.60548e+06,2445,3560,5.72819e+06,541,15234,3050583
FORMULA SmartHome-PT-08-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(((i5.i0.u44.p138==1)&&(i12.i1.u80.p247==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i5.i0.u44.p138==1)&&(i12.i1.u80.p247==1)))))] = FALSE
(forward)formula 5,0,93.5938,2037472,1,0,3.64622e+06,2455,3560,5.79377e+06,541,15299,3118134
FORMULA SmartHome-PT-08-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((((i2.i0.u13.p45==1)&&(i11.i1.u65.p194==1)) * EG((i2.i1.u9.p31==1))) * AF((i10.i0.u56.p165!=1))) * ((i2.i0.u8.p30==1)||((i4.i0.u25.p107==1)&&(i12.i1.u79.p239==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i2.i0.u8.p30==1)||((i4.i0.u25.p107==1)&&(i12.i1.u79.p239==1)))) * (((i2.i0.u13.p45==1)&&(i11.i1.u65.p194==1)) * EG((i2.i1.u9.p31==1)))) * !(EG(!((i10.i0.u56.p165!=1)))))] != FALSE
(forward)formula 6,0,93.7302,2043280,1,0,3.65788e+06,2478,3588,5.81206e+06,541,15465,3141967
FORMULA SmartHome-PT-08-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(AG((i4.i1.u32.p99==1))) + (EF((i2.i0.u6.p26==1)) * EF(((i2.i0.u8.p40!=1)&&((i8.u62.p185!=1)||(i12.i1.u80.p250!=1))))))
=> equivalent forward existential formula: [(FwdU(EY((Init * !((E(TRUE U (i2.i0.u6.p26==1)) * E(TRUE U ((i2.i0.u8.p40!=1)&&((i8.u62.p185!=1)||(i12.i1.u80.p250!=1)))))))),TRUE) * !((i4.i1.u32.p99==1)))] = FALSE
(forward)formula 7,1,93.7995,2045392,1,0,3.66244e+06,2486,3603,5.81729e+06,542,15487,3153912
FORMULA SmartHome-PT-08-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((E((i10.i1.u57.p168==1) U ((i8.u62.p185==1)&&(i12.i0.u82.p246==1))) * (EG((i5.i0.u36.p116==1)) + (i8.u49.p150==1))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * E((i10.i1.u57.p168==1) U ((i8.u62.p185==1)&&(i12.i0.u82.p246==1)))),(i5.i0.u36.p116==1))] != FALSE + [((FwdU(Init,TRUE) * E((i10.i1.u57.p168==1) U ((i8.u62.p185==1)&&(i12.i0.u82.p246==1)))) * (i8.u49.p150==1))] != FALSE)
(forward)formula 8,1,93.9164,2048560,1,0,3.67035e+06,2936,4133,5.82794e+06,583,16862,3175143
FORMULA SmartHome-PT-08-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(EF(((i4.i0.u28.p89==1)||(i9.i1.u58.p172==1)))) * E(((i7.u46.p189!=1)||(((i11.i0.u64.p217==1)&&(i6.u75.p222==1))&&(i9.i0.u60.p178==1))) U ((i3.i1.u22.p76==1)&&(i12.i1.u79.p242==1))))
=> equivalent forward existential formula: [(FwdU((Init * EX(E(TRUE U ((i4.i0.u28.p89==1)||(i9.i1.u58.p172==1))))),((i7.u46.p189!=1)||(((i11.i0.u64.p217==1)&&(i6.u75.p222==1))&&(i9.i0.u60.p178==1)))) * ((i3.i1.u22.p76==1)&&(i12.i1.u79.p242==1)))] != FALSE
(forward)formula 9,0,94.3247,2063608,1,0,3.69997e+06,2954,4200,5.8858e+06,583,16952,3232292
FORMULA SmartHome-PT-08-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((AF(((i4.i0.u26.p88==1)||(i0.i1.u23.p78==1))) + ((i9.i1.u59.p173!=1)&&((i0.i1.u15.p79==1)||((i8.u62.p185==1)&&(i12.i1.u80.p250==1))))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(((i9.i1.u59.p173!=1)&&((i0.i1.u15.p79==1)||((i8.u62.p185==1)&&(i12.i1.u80.p250==1)))))),!(((i4.i0.u26.p88==1)||(i0.i1.u23.p78==1))))] = FALSE
(forward)formula 10,0,94.8974,2089216,1,0,3.7618e+06,3002,4260,5.95146e+06,583,17108,3340375
FORMULA SmartHome-PT-08-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((AF((i4.i0.u25.p82==1)) * (u1.p3!=1)) * ((i3.i1.u22.p76!=1)||(i3.i1.u78.p233!=1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((i3.i1.u22.p76!=1)||(i3.i1.u78.p233!=1))) * (u1.p3!=1)) * !(EG(!((i4.i0.u25.p82==1)))))] != FALSE
(forward)formula 11,1,96.2824,2136416,1,0,3.85548e+06,3071,4302,6.07793e+06,583,17359,3467447
FORMULA SmartHome-PT-08-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((A((i3.i0.u17.p67==1) U (i2.i1.u9.p32==1)) * (i11.i0.u76.p229==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i11.i0.u76.p229==1)) * !(EG(!((i2.i1.u9.p32==1))))) * !(E(!((i2.i1.u9.p32==1)) U (!((i3.i0.u17.p67==1)) * !((i2.i1.u9.p32==1))))))] != FALSE
(forward)formula 12,1,112.603,2209268,1,0,4.02444e+06,3071,1056,6.30427e+06,267,17402,53544
FORMULA SmartHome-PT-08-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AX(EF(((i8.u61.p181==1)||(i3.i0.u17.p66==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((i8.u61.p181==1)||(i3.i0.u17.p66==1)))))] != FALSE
(forward)formula 13,0,113.021,2209268,1,0,4.02444e+06,3071,1794,6.30427e+06,298,17402,157027
FORMULA SmartHome-PT-08-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EF((i9.i1.u59.p174==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i9.i1.u59.p174==1))] = FALSE
(forward)formula 14,0,113.022,2209268,1,0,4.02444e+06,3071,1797,6.30427e+06,298,17402,157034
FORMULA SmartHome-PT-08-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1590483827890

--------------------
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="SmartHome-PT-08"
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 SmartHome-PT-08, 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 r227-oct2-159033546100060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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