Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745600162.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 itstools
Input is SmartHome-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745600162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 27K May 5 16:52 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-02-CTLFireability-00
FORMULA_NAME SmartHome-PT-02-CTLFireability-01
FORMULA_NAME SmartHome-PT-02-CTLFireability-02
FORMULA_NAME SmartHome-PT-02-CTLFireability-03
FORMULA_NAME SmartHome-PT-02-CTLFireability-04
FORMULA_NAME SmartHome-PT-02-CTLFireability-05
FORMULA_NAME SmartHome-PT-02-CTLFireability-06
FORMULA_NAME SmartHome-PT-02-CTLFireability-07
FORMULA_NAME SmartHome-PT-02-CTLFireability-08
FORMULA_NAME SmartHome-PT-02-CTLFireability-09
FORMULA_NAME SmartHome-PT-02-CTLFireability-10
FORMULA_NAME SmartHome-PT-02-CTLFireability-11
FORMULA_NAME SmartHome-PT-02-CTLFireability-12
FORMULA_NAME SmartHome-PT-02-CTLFireability-13
FORMULA_NAME SmartHome-PT-02-CTLFireability-14
FORMULA_NAME SmartHome-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621165518114

Running Version 0
[2021-05-16 11:45:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 11:45:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 11:45:20] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-16 11:45:20] [INFO ] Transformed 41 places.
[2021-05-16 11:45:20] [INFO ] Transformed 127 transitions.
[2021-05-16 11:45:20] [INFO ] Found NUPN structural information;
[2021-05-16 11:45:20] [INFO ] Parsed PT model containing 41 places and 127 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-16 11:45:20] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 66 transitions
Reduce redundant transitions removed 66 transitions.
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 61/61 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 49
Applied a total of 12 rules in 13 ms. Remains 41 /41 variables (removed 0) and now considering 49/61 (removed 12) transitions.
[2021-05-16 11:45:20] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 41 cols
[2021-05-16 11:45:20] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-16 11:45:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2021-05-16 11:45:20] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 41 cols
[2021-05-16 11:45:20] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-16 11:45:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-16 11:45:20] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2021-05-16 11:45:20] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 41 cols
[2021-05-16 11:45:20] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-16 11:45:20] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 49/61 transitions.
[2021-05-16 11:45:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 11:45:20] [INFO ] Flatten gal took : 27 ms
FORMULA SmartHome-PT-02-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 11:45:20] [INFO ] Flatten gal took : 20 ms
[2021-05-16 11:45:20] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 72) seen :63
Running SMT prover for 9 properties.
[2021-05-16 11:45:21] [INFO ] Flow matrix only has 36 transitions (discarded 13 similar events)
// Phase 1: matrix 36 rows 41 cols
[2021-05-16 11:45:21] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 11:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 11:45:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 11:45:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 1 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned unsat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 11:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 11:45:21] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-16 11:45:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 11:45:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
Graph (complete) has 110 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 37 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 37 transition count 46
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 17 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 31 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 31 transition count 39
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 31 transition count 35
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 30 transition count 34
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 30 transition count 34
Applied a total of 25 rules in 27 ms. Remains 30 /41 variables (removed 11) and now considering 34/49 (removed 15) transitions.
[2021-05-16 11:45:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 11:45:21] [INFO ] Flatten gal took : 3 ms
FORMULA SmartHome-PT-02-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 11:45:21] [INFO ] Flatten gal took : 2 ms
[2021-05-16 11:45:21] [INFO ] Input system was already deterministic with 34 transitions.
Graph (trivial) has 8 edges and 41 vertex of which 2 / 41 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 36 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 36 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 35 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 34 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 34 transition count 40
Applied a total of 14 rules in 10 ms. Remains 34 /41 variables (removed 7) and now considering 40/49 (removed 9) transitions.
[2021-05-16 11:45:21] [INFO ] Flatten gal took : 3 ms
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 3 ms
[2021-05-16 11:45:22] [INFO ] Input system was already deterministic with 40 transitions.
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 3 ms
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 3 ms
[2021-05-16 11:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11536811157413340533.gal : 2 ms
[2021-05-16 11:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9965249839301846991.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11536811157413340533.gal, -t, CGAL, -ctl, /tmp/CTLFireability9965249839301846991.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11536811157413340533.gal -t CGAL -ctl /tmp/CTLFireability9965249839301846991.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,17665,0.012689,4424,2,129,5,622,6,0,156,559,0


Converting to forward existential form...Done !
original formula: AG((AF(((((((p16==1)||(p18==1))||(p2==1))||(p7==1))||((p1==1)&&(p10==1)))||(p24==1))) + EG(((((((((((p16==1)||(p18==1))||((p26==1)&&(p28==1)))||((p13==1)&&(p27==1)))||(p4==1))||((p10==1)&&(p27==1)))||(p7==1))||((p1==1)&&(p26==1)))||(p25==1))||(p9==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(((((((((((p16==1)||(p18==1))||((p26==1)&&(p28==1)))||((p13==1)&&(p27==1)))||(p4==1))||((p10==1)&&(p27==1)))||(p7==1))||((p1==1)&&(p26==1)))||(p25==1))||(p9==1))))),!(((((((p16==1)||(p18==1))||(p2==1))||(p7==1))||((p1==1)&&(p10==1)))||(p24==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t28, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/37/3/40
Hit Full ! (commute/partial/dont) 12/131/28
(forward)formula 0,1,0.030652,5076,1,0,51,2472,100,35,1085,2605,85
FORMULA SmartHome-PT-02-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 16 edges and 41 vertex of which 4 / 41 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 38 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 33 transition count 39
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 31 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 31 transition count 35
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 31 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 30 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 30 transition count 31
Applied a total of 22 rules in 12 ms. Remains 30 /41 variables (removed 11) and now considering 31/49 (removed 18) transitions.
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 2 ms
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 1 ms
[2021-05-16 11:45:22] [INFO ] Input system was already deterministic with 31 transitions.
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 2 ms
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 2 ms
[2021-05-16 11:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14497454108181773086.gal : 0 ms
[2021-05-16 11:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15590939359950230488.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14497454108181773086.gal, -t, CGAL, -ctl, /tmp/CTLFireability15590939359950230488.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14497454108181773086.gal -t CGAL -ctl /tmp/CTLFireability15590939359950230488.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,1105,0.005181,4384,2,91,5,361,6,0,123,310,0


Converting to forward existential form...Done !
original formula: EG(!(A((p12==1) U (((((((((p1==1)&&(p18==1))||(p8==1))||((p1==1)&&(p10==1)))||((p1==1)&&(p26==1)))||(p25==1))||(p11==1))||((p5==1)&&(p27==1)))||(p14==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((((((((((p1==1)&&(p18==1))||(p8==1))||((p1==1)&&(p10==1)))||((p1==1)&&(p26==1)))||(p25==1))||(p11==1))||((p5==1)&&(p27==1)))||(p14==1))) U (!((p12==1)) * !((((((((((p1==1)&&(p18==1))||(p8==1))||((p1==1)&&(p10==1)))||((p1==1)&&(p26==1)))||(p25==1))||(p11==1))||((p5==1)&&(p27==1)))||(p14==1))))) + EG(!((((((((((p1==1)&&(p18==1))||(p8==1))||((p1==1)&&(p10==1)))||((p1==1)&&(p26==1)))||(p25==1))||(p11==1))||((p5==1)&&(p27==1)))||(p14==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t23, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/28/3/31
(forward)formula 0,0,0.019841,5088,1,0,41,1313,82,24,814,1283,69
FORMULA SmartHome-PT-02-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-16 11:45:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 5 ms
FORMULA SmartHome-PT-02-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 4 ms
[2021-05-16 11:45:22] [INFO ] Applying decomposition
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5025170968115124047.txt, -o, /tmp/graph5025170968115124047.bin, -w, /tmp/graph5025170968115124047.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5025170968115124047.bin, -l, -1, -v, -w, /tmp/graph5025170968115124047.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-16 11:45:22] [INFO ] Decomposing Gal with order
[2021-05-16 11:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 11:45:22] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-16 11:45:22] [INFO ] Flatten gal took : 26 ms
[2021-05-16 11:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 11:45:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15857389715363434150.gal : 2 ms
[2021-05-16 11:45:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10972667501659126537.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15857389715363434150.gal, -t, CGAL, -ctl, /tmp/CTLFireability10972667501659126537.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15857389715363434150.gal -t CGAL -ctl /tmp/CTLFireability10972667501659126537.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
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,86401,0.009671,4688,57,25,318,101,144,309,37,178,0


Converting to forward existential form...Done !
original formula: (EX(AG((((((((i2.u0.p2==1)||(i0.u1.p4==1))||(i7.u9.p24==1))||(u3.p9==1))||(i5.u10.p26==1))||(u3.p10==1))||(i6.u4.p13==1)))) + (AX(A(((((i5.u10.p26==1)&&(i5.u11.p28==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))&&((((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1))||(i2.u0.p11==1))) U AF(((i7.u9.p22==1)||(i2.u0.p11==1))))) * AG((((((((((((((((((((((((((EX(((((((((((i2.u6.p16==1)||(i2.u0.p2==1))||(i0.u1.p4==1))||((i3.u7.p18==1)&&(i3.u14.p37==1)))||((i0.u1.p1==1)&&(u8.p21==1)))||(i7.u9.p22==1))||(i0.u2.p7==1))||(i7.u9.p23==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))||((i2.u5.p14==1)&&(i2.u5.p34==1)))) + ((i0.u1.p1==1)&&(u3.p10==1))) + (i2.u0.p8==1)) + ((i0.u1.p1==1)&&(i2.u6.p16==1))) + ((i5.u10.p26==1)&&(i5.u11.p28==1))) + (i2.u0.p2==1)) + ((i3.u7.p18==1)&&(i3.u14.p37==1))) + (u8.p21==1)) + ((i0.u1.p1==1)&&(u8.p21==1))) + (i7.u9.p24==1)) + (i2.u0.p8==1)) + (i6.u4.p13==1)) + (i3.u7.p18==1)) + ((i5.u10.p26==1)&&(i5.u11.p28==1))) + (i0.u1.p3==1)) + ((i3.u7.p18==1)&&(i3.u14.p37==1))) + ((i0.u1.p1==1)&&(i0.u1.p4==1))) + (i7.u9.p22==1)) + ((i0.u1.p1==1)&&(i6.u4.p13==1))) + (i2.u5.p14==1)) + (i2.u6.p16==1)) + (i3.u7.p18==1)) + (u8.p19==1)) + (u8.p20==1)) + ((i0.u1.p1==1)&&(i7.u9.p24==1))) + ((i0.u1.p1==1)&&(i6.u4.p13==1))))))
=> equivalent forward existential formula: (([FwdG((FwdU(EY((Init * !(EX(!(E(TRUE U !((((((((i2.u0.p2==1)||(i0.u1.p4==1))||(i7.u9.p24==1))||(u3.p9==1))||(i5.u10.p26==1))||(u3.p10==1))||(i6.u4.p13==1))))))))),!(!(EG(!(((i7.u9.p22==1)||(i2.u0.p11==1))))))) * !(((((i5.u10.p26==1)&&(i5.u11.p28==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))&&((((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1))||(i2.u0.p11==1))))),!(((i7.u9.p22==1)||(i2.u0.p11==1))))] = FALSE * [FwdG(EY((Init * !(EX(!(E(TRUE U !((((((((i2.u0.p2==1)||(i0.u1.p4==1))||(i7.u9.p24==1))||(u3.p9==1))||(i5.u10.p26==1))||(u3.p10==1))||(i6.u4.p13==1))))))))),!(!(EG(!(((i7.u9.p22==1)||(i2.u0.p11==1)))))))] = FALSE) * [((((((((((((((((((((((((((FwdU((Init * !(EX(!(E(TRUE U !((((((((i2.u0.p2==1)||(i0.u1.p4==1))||(i7.u9.p24==1))||(u3.p9==1))||(i5.u10.p26==1))||(u3.p10==1))||(i6.u4.p13==1)))))))),TRUE) * !(((i0.u1.p1==1)&&(i6.u4.p13==1)))) * !(((i0.u1.p1==1)&&(i7.u9.p24==1)))) * !((u8.p20==1))) * !((u8.p19==1))) * !((i3.u7.p18==1))) * !((i2.u6.p16==1))) * !((i2.u5.p14==1))) * !(((i0.u1.p1==1)&&(i6.u4.p13==1)))) * !((i7.u9.p22==1))) * !(((i0.u1.p1==1)&&(i0.u1.p4==1)))) * !(((i3.u7.p18==1)&&(i3.u14.p37==1)))) * !((i0.u1.p3==1))) * !(((i5.u10.p26==1)&&(i5.u11.p28==1)))) * !((i3.u7.p18==1))) * !((i6.u4.p13==1))) * !((i2.u0.p8==1))) * !((i7.u9.p24==1))) * !(((i0.u1.p1==1)&&(u8.p21==1)))) * !((u8.p21==1))) * !(((i3.u7.p18==1)&&(i3.u14.p37==1)))) * !((i2.u0.p2==1))) * !(((i5.u10.p26==1)&&(i5.u11.p28==1)))) * !(((i0.u1.p1==1)&&(i2.u6.p16==1)))) * !((i2.u0.p8==1))) * !(((i0.u1.p1==1)&&(u3.p10==1)))) * !(EX(((((((((((i2.u6.p16==1)||(i2.u0.p2==1))||(i0.u1.p4==1))||((i3.u7.p18==1)&&(i3.u14.p37==1)))||((i0.u1.p1==1)&&(u8.p21==1)))||(i7.u9.p22==1))||(i0.u2.p7==1))||(i7.u9.p23==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))||((i2.u5.p14==1)&&(i2.u5.p34==1))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t32, t36, i2.u5.t30, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/46/3/49
Fast SCC detection found an 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
(forward)formula 0,1,0.023827,5716,1,0,660,104,785,748,169,178,2265
FORMULA SmartHome-PT-02-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AX(AG(EF((((((((((i2.u6.p16==1)||(i3.u7.p17==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||(u8.p21==1))||(i7.u9.p22==1))||(i0.u2.p6==1))||(i2.u0.p8==1))||(i7.u9.p24==1))||(u3.p10==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((((((((i2.u6.p16==1)||(i3.u7.p17==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||(u8.p21==1))||(i7.u9.p22==1))||(i0.u2.p6==1))||(i2.u0.p8==1))||(i7.u9.p24==1))||(u3.p10==1)))))] != FALSE
(forward)formula 1,0,0.02603,5716,1,0,681,108,809,798,171,178,2578
FORMULA SmartHome-PT-02-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((AG(EX(AF((((i2.u0.p5==1)||(i5.u10.p26==1))||((i0.u1.p1==1)&&(i7.u9.p24==1)))))) * AX(AX((((((((u8.p19==1)||(i0.u1.p4==1))||((i0.u1.p1==1)&&(u3.p10==1)))||(u3.p9==1))||(u3.p10==1))||(i6.u4.p12==1))||((i0.u1.p1==1)&&(i6.u4.p13==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !(EX(!(EG(!((((i2.u0.p5==1)||(i5.u10.p26==1))||((i0.u1.p1==1)&&(i7.u9.p24==1)))))))))] = FALSE * [(EY(EY(FwdU(Init,TRUE))) * !((((((((u8.p19==1)||(i0.u1.p4==1))||((i0.u1.p1==1)&&(u3.p10==1)))||(u3.p9==1))||(u3.p10==1))||(i6.u4.p12==1))||((i0.u1.p1==1)&&(i6.u4.p13==1)))))] = FALSE)
(forward)formula 2,1,0.029046,5716,1,0,700,108,846,896,171,178,2797
FORMULA SmartHome-PT-02-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EX(AG((AG(((((((i2.u0.p5==1)||(i7.u9.p23==1))||((i0.u1.p1==1)&&(u3.p10==1)))||((u8.p21==1)&&(i2.u0.p27==1)))||(i6.u4.p13==1))||((i3.u7.p18==1)&&(i2.u0.p27==1)))) * EX(((((u8.p20==1)||(i2.u0.p5==1))||(i7.u9.p24==1))||(i2.u5.p14==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U !((!(E(TRUE U !(((((((i2.u0.p5==1)||(i7.u9.p23==1))||((i0.u1.p1==1)&&(u3.p10==1)))||((u8.p21==1)&&(i2.u0.p27==1)))||(i6.u4.p13==1))||((i3.u7.p18==1)&&(i2.u0.p27==1)))))) * EX(((((u8.p20==1)||(i2.u0.p5==1))||(i7.u9.p24==1))||(i2.u5.p14==1))))))))))] = FALSE
(forward)formula 3,1,0.032557,5716,1,0,700,108,867,910,171,178,2892
FORMULA SmartHome-PT-02-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(EX(EX((AF(((((((i0.u1.p3==1)||((i7.u9.p24==1)&&(i2.u0.p27==1)))||(i2.u0.p5==1))||((i2.u5.p14==1)&&(i2.u5.p34==1)))||(i6.u4.p13==1))&&(((i2.u6.p16==1)||(i2.u0.p2==1))||(i2.u5.p14==1)))) * EG((((((u8.p21==0)&&((i0.u1.p1==0)||(i0.u1.p4==0)))&&(i7.u9.p23==0))&&((i0.u2.p7==0)||(i2.u0.p27==0)))&&(i2.u5.p14==0)))))))
=> equivalent forward existential formula: [FwdG((EY(EY(Init)) * !(EG(!(((((((i0.u1.p3==1)||((i7.u9.p24==1)&&(i2.u0.p27==1)))||(i2.u0.p5==1))||((i2.u5.p14==1)&&(i2.u5.p34==1)))||(i6.u4.p13==1))&&(((i2.u6.p16==1)||(i2.u0.p2==1))||(i2.u5.p14==1))))))),(((((u8.p21==0)&&((i0.u1.p1==0)||(i0.u1.p4==0)))&&(i7.u9.p23==0))&&((i0.u2.p7==0)||(i2.u0.p27==0)))&&(i2.u5.p14==0)))] = FALSE
(forward)formula 4,1,0.035512,5716,1,0,745,110,934,971,176,178,3199
FORMULA SmartHome-PT-02-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EG(AG((((i2.u0.p8==0)&&((i0.u1.p1==0)||(i3.u7.p18==0)))&&((i0.u1.p1==0)||(i0.u2.p7==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(E(TRUE U !((((i2.u0.p8==0)&&((i0.u1.p1==0)||(i3.u7.p18==0)))&&((i0.u1.p1==0)||(i0.u2.p7==0)))))))))] = FALSE
(forward)formula 5,0,0.036694,5716,1,0,745,110,952,972,177,178,3272
FORMULA SmartHome-PT-02-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AF(EG(EF((i2.u6.p16==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(E(TRUE U (i2.u6.p16==1)))))))] != FALSE
(forward)formula 6,1,0.037394,5716,1,0,745,110,953,972,177,178,3312
FORMULA SmartHome-PT-02-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (((!(EG((((((((((((((((((((i0.u1.p1==0)||(i3.u7.p18==0))&&((i7.u9.p24==0)||(i5.u11.p30==0)))&&(u8.p19==0))&&(i0.u1.p3==0))&&(u8.p20==0))&&(i0.u2.p6==0))&&(i7.u9.p22==0))&&(i7.u9.p23==0))&&(i2.u0.p8==0))&&(i6.u4.p12==0))&&(i2.u6.p16==0))&&((i7.u9.p24==0)||(i5.u11.p29==0)))&&(u8.p21==0))&&((i0.u1.p1==0)||(u8.p21==0)))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(u3.p10==0))&&(i2.u0.p11==0)))) * !(A(!(AF(((((i0.u1.p3==1)||(u8.p21==1))||(u3.p9==1))||(i2.u0.p11==1)))) U !(AF(((i7.u9.p24==1)&&(i5.u11.p29==1))))))) * A(!(AF((((((((((((i0.u1.p4==0)||(i2.u0.p27==0))&&(i3.u7.p17==0))&&(i0.u1.p3==0))&&(i7.u9.p22==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&(i7.u9.p24==0))&&(u3.p9==0))&&(i5.u10.p26==0))&&(i6.u4.p12==0)))) U EG(A((i0.u2.p7==0) U (((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0)))))) * (AG((((((((((((u8.p20==0)&&((i3.u7.p18==0)||(i3.u14.p37==0)))&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i5.u10.p25==0))&&((i0.u1.p1==0)||(i0.u2.p7==0)))&&(i2.u0.p11==0)) + E(((i0.u1.p1==1)&&(i2.u6.p16==1)) U ((((((i3.u7.p18==1)||(u8.p21==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i7.u9.p24==1))||(i2.u0.p8==1))||((i0.u1.p1==1)&&(i0.u2.p7==1))))) * (i2.u0.p11==1)) * EX(((((((((i0.u1.p1==1)&&(i3.u7.p18==1))||(i0.u1.p4==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||((u3.p10==1)&&(i2.u0.p27==1)))||(u3.p10==1))||((i0.u1.p1==1)&&(i0.u2.p7==1)))||(i6.u4.p13==1)))) * A((((((u8.p19==1)||(i2.u0.p5==1))||(i7.u9.p22==1))||(i5.u10.p25==1))||(i5.u10.p26==1)) U (((i2.u0.p2==1)||(i0.u2.p7==1))||(i7.u9.p23==1))))) + EF((i3.u7.p18==1))))
=> equivalent forward existential formula: ((([FwdG(Init,(((((((((((((((((((i0.u1.p1==0)||(i3.u7.p18==0))&&((i7.u9.p24==0)||(i5.u11.p30==0)))&&(u8.p19==0))&&(i0.u1.p3==0))&&(u8.p20==0))&&(i0.u2.p6==0))&&(i7.u9.p22==0))&&(i7.u9.p23==0))&&(i2.u0.p8==0))&&(i6.u4.p12==0))&&(i2.u6.p16==0))&&((i7.u9.p24==0)||(i5.u11.p29==0)))&&(u8.p21==0))&&((i0.u1.p1==0)||(u8.p21==0)))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(u3.p10==0))&&(i2.u0.p11==0)))] = FALSE * [((Init * !(EG(!(!(!(EG(!(((i7.u9.p24==1)&&(i5.u11.p29==1)))))))))) * !(E(!(!(!(EG(!(((i7.u9.p24==1)&&(i5.u11.p29==1))))))) U (!(!(!(EG(!(((((i0.u1.p3==1)||(u8.p21==1))||(u3.p9==1))||(i2.u0.p11==1))))))) * !(!(!(EG(!(((i7.u9.p24==1)&&(i5.u11.p29==1)))))))))))] = FALSE) * ([((FwdU(Init,!(EG(!((E(!((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))) U (!((i0.u2.p7==0)) * !((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))))) + EG(!((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))))))))) * !(!(!(EG(!((((((((((((i0.u1.p4==0)||(i2.u0.p27==0))&&(i3.u7.p17==0))&&(i0.u1.p3==0))&&(i7.u9.p22==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&(i7.u9.p24==0))&&(u3.p9==0))&&(i5.u10.p26==0))&&(i6.u4.p12==0)))))))) * !(EG(!((E(!((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))) U (!((i0.u2.p7==0)) * !((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))))) + EG(!((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0)))))))))] = FALSE * [FwdG(Init,!(EG(!((E(!((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))) U (!((i0.u2.p7==0)) * !((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0))))) + EG(!((((((((i2.u6.p16==0)&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i0.u2.p7==0))&&(i2.u0.p8==0))&&((i2.u5.p14==0)||(i2.u5.p34==0)))&&(i2.u0.p11==0)))))))))] = FALSE)) * ((([((FwdU((Init * !(E(TRUE U (i3.u7.p18==1)))),TRUE) * !((((((((u8.p20==0)&&((i3.u7.p18==0)||(i3.u14.p37==0)))&&(i0.u1.p4==0))&&(i7.u9.p23==0))&&(i5.u10.p25==0))&&((i0.u1.p1==0)||(i0.u2.p7==0)))&&(i2.u0.p11==0)))) * !(E(((i0.u1.p1==1)&&(i2.u6.p16==1)) U ((((((i3.u7.p18==1)||(u8.p21==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i7.u9.p24==1))||(i2.u0.p8==1))||((i0.u1.p1==1)&&(i0.u2.p7==1))))))] = FALSE * [(FwdU((Init * !(E(TRUE U (i3.u7.p18==1)))),TRUE) * !((i2.u0.p11==1)))] = FALSE) * [(FwdU((Init * !(E(TRUE U (i3.u7.p18==1)))),TRUE) * !(EX(((((((((i0.u1.p1==1)&&(i3.u7.p18==1))||(i0.u1.p4==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||((u3.p10==1)&&(i2.u0.p27==1)))||(u3.p10==1))||((i0.u1.p1==1)&&(i0.u2.p7==1)))||(i6.u4.p13==1)))))] = FALSE) * ([(FwdU(FwdU((Init * !(E(TRUE U (i3.u7.p18==1)))),TRUE),!((((i2.u0.p2==1)||(i0.u2.p7==1))||(i7.u9.p23==1)))) * (!((((((u8.p19==1)||(i2.u0.p5==1))||(i7.u9.p22==1))||(i5.u10.p25==1))||(i5.u10.p26==1))) * !((((i2.u0.p2==1)||(i0.u2.p7==1))||(i7.u9.p23==1)))))] = FALSE * [FwdG(FwdU((Init * !(E(TRUE U (i3.u7.p18==1)))),TRUE),!((((i2.u0.p2==1)||(i0.u2.p7==1))||(i7.u9.p23==1))))] = FALSE)))
Using saturation style SCC detection
(forward)formula 7,0,0.052019,5716,1,0,1008,127,1274,1300,192,224,4810
FORMULA SmartHome-PT-02-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: ((A(((((i6.u4.p13==1)&&(i6.u12.p31==1))||(i0.u2.p7==1))||(i2.u0.p11==1)) U ((((((((((((((!(AF(((i3.u7.p18==1)||((i2.u5.p14==1)&&(i6.u12.p32==1))))) * !(E((((u8.p21==1)||(i5.u10.p25==1))||((u8.p21==1)&&(i2.u0.p27==1))) U (((((((i3.u7.p18==1)||(((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1)))||(i2.u0.p5==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i5.u10.p26==1))||((i0.u1.p1==1)&&(i6.u4.p13==1)))||(i2.u6.p15==1))))) * ((i0.u1.p1==0)||(u8.p21==0))) * (u3.p10==0)) * ((i0.u1.p1==0)||(i0.u2.p7==0))) * ((i2.u0.p5==0)||(i2.u0.p27==0))) * (i2.u5.p14==0)) * (i3.u7.p18==0)) * (i2.u0.p2==0)) * (i0.u1.p3==0)) * ((i6.u4.p13==0)||(i2.u0.p27==0))) * (i2.u0.p8==0)) * (i5.u10.p25==0)) * (i2.u0.p11==0)) * ((i2.u6.p16==0)||(i2.u0.p27==0)))) + AF(EX(EG(AG((((((((i2.u6.p16==1)||((i5.u10.p26==1)&&(i5.u11.p28==1)))||(u8.p20==1))||((i2.u5.p14==1)&&(i6.u12.p32==1)))||((i0.u1.p1==1)&&(i0.u2.p7==1)))||((u8.p21==1)&&(i2.u0.p27==1)))||(i2.u6.p15==1))))))) + (EF((((((((((((EX(((u8.p21==1)&&(i2.u0.p27==1))) + EX((((((((((u8.p19==1)||(i0.u1.p4==1))||((u3.p10==1)&&(i2.u0.p27==1)))||(i7.u9.p23==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))||(i2.u0.p8==1))||(i7.u9.p24==1))||(i5.u10.p25==1))||(i2.u5.p14==1)))) + (i3.u7.p17==1)) + (i0.u1.p4==1)) + ((i3.u7.p18==1)&&(i3.u14.p37==1))) + ((i7.u9.p24==1)&&(i7.u15.p39==1))) + ((u3.p10==1)&&(i2.u0.p27==1))) + (i7.u9.p24==1)) + (u3.p10==1)) + (i2.u0.p11==1)) + (i2.u5.p14==1)) * A(((((((((((i6.u4.p13==1)&&(i6.u12.p31==1))||(i2.u0.p2==1))||(u8.p20==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||((i0.u1.p1==1)&&(i0.u1.p4==1)))||(i7.u9.p23==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i6.u4.p13==1))||(i2.u0.p11==1)) U AF((((((i7.u9.p24==1)&&(i5.u11.p29==1))||(u8.p19==1))||(i0.u1.p3==1))||(i0.u2.p7==1)))))) * EF((((((((EG(((((i2.u0.p0==1)||(i0.u1.p3==1))||((i6.u4.p13==1)&&(i2.u0.p27==1)))||((i2.u6.p16==1)&&(i2.u0.p27==1)))) * AX(((((((i2.u0.p2==1)||(i0.u1.p4==1))||(i7.u9.p22==1))||(i0.u2.p7==1))||(i5.u10.p26==1))||(i2.u0.p11==1)))) + ((i2.u5.p14==1)&&(i2.u13.p35==1))) + ((i0.u1.p1==1)&&(i7.u9.p24==1))) + ((i0.u1.p1==1)&&(i3.u7.p18==1))) + (((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1))) + (i2.u0.p5==1)) + (i0.u2.p7==1)))))
=> equivalent forward existential formula: [FwdG(((Init * !((E(TRUE U (((((((((((EX(((u8.p21==1)&&(i2.u0.p27==1))) + EX((((((((((u8.p19==1)||(i0.u1.p4==1))||((u3.p10==1)&&(i2.u0.p27==1)))||(i7.u9.p23==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))||(i2.u0.p8==1))||(i7.u9.p24==1))||(i5.u10.p25==1))||(i2.u5.p14==1)))) + (i3.u7.p17==1)) + (i0.u1.p4==1)) + ((i3.u7.p18==1)&&(i3.u14.p37==1))) + ((i7.u9.p24==1)&&(i7.u15.p39==1))) + ((u3.p10==1)&&(i2.u0.p27==1))) + (i7.u9.p24==1)) + (u3.p10==1)) + (i2.u0.p11==1)) + (i2.u5.p14==1)) * !((E(!(!(EG(!((((((i7.u9.p24==1)&&(i5.u11.p29==1))||(u8.p19==1))||(i0.u1.p3==1))||(i0.u2.p7==1)))))) U (!(((((((((((i6.u4.p13==1)&&(i6.u12.p31==1))||(i2.u0.p2==1))||(u8.p20==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||((i0.u1.p1==1)&&(i0.u1.p4==1)))||(i7.u9.p23==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i6.u4.p13==1))||(i2.u0.p11==1))) * !(!(EG(!((((((i7.u9.p24==1)&&(i5.u11.p29==1))||(u8.p19==1))||(i0.u1.p3==1))||(i0.u2.p7==1)))))))) + EG(!(!(EG(!((((((i7.u9.p24==1)&&(i5.u11.p29==1))||(u8.p19==1))||(i0.u1.p3==1))||(i0.u2.p7==1))))))))))) * E(TRUE U (((((((EG(((((i2.u0.p0==1)||(i0.u1.p3==1))||((i6.u4.p13==1)&&(i2.u0.p27==1)))||((i2.u6.p16==1)&&(i2.u0.p27==1)))) * !(EX(!(((((((i2.u0.p2==1)||(i0.u1.p4==1))||(i7.u9.p22==1))||(i0.u2.p7==1))||(i5.u10.p26==1))||(i2.u0.p11==1)))))) + ((i2.u5.p14==1)&&(i2.u13.p35==1))) + ((i0.u1.p1==1)&&(i7.u9.p24==1))) + ((i0.u1.p1==1)&&(i3.u7.p18==1))) + (((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1))) + (i2.u0.p5==1)) + (i0.u2.p7==1)))))) * !(!((E(!(((((((((((((((!(!(EG(!(((i3.u7.p18==1)||((i2.u5.p14==1)&&(i6.u12.p32==1))))))) * !(E((((u8.p21==1)||(i5.u10.p25==1))||((u8.p21==1)&&(i2.u0.p27==1))) U (((((((i3.u7.p18==1)||(((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1)))||(i2.u0.p5==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i5.u10.p26==1))||((i0.u1.p1==1)&&(i6.u4.p13==1)))||(i2.u6.p15==1))))) * ((i0.u1.p1==0)||(u8.p21==0))) * (u3.p10==0)) * ((i0.u1.p1==0)||(i0.u2.p7==0))) * ((i2.u0.p5==0)||(i2.u0.p27==0))) * (i2.u5.p14==0)) * (i3.u7.p18==0)) * (i2.u0.p2==0)) * (i0.u1.p3==0)) * ((i6.u4.p13==0)||(i2.u0.p27==0))) * (i2.u0.p8==0)) * (i5.u10.p25==0)) * (i2.u0.p11==0)) * ((i2.u6.p16==0)||(i2.u0.p27==0)))) U (!(((((i6.u4.p13==1)&&(i6.u12.p31==1))||(i0.u2.p7==1))||(i2.u0.p11==1))) * !(((((((((((((((!(!(EG(!(((i3.u7.p18==1)||((i2.u5.p14==1)&&(i6.u12.p32==1))))))) * !(E((((u8.p21==1)||(i5.u10.p25==1))||((u8.p21==1)&&(i2.u0.p27==1))) U (((((((i3.u7.p18==1)||(((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1)))||(i2.u0.p5==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i5.u10.p26==1))||((i0.u1.p1==1)&&(i6.u4.p13==1)))||(i2.u6.p15==1))))) * ((i0.u1.p1==0)||(u8.p21==0))) * (u3.p10==0)) * ((i0.u1.p1==0)||(i0.u2.p7==0))) * ((i2.u0.p5==0)||(i2.u0.p27==0))) * (i2.u5.p14==0)) * (i3.u7.p18==0)) * (i2.u0.p2==0)) * (i0.u1.p3==0)) * ((i6.u4.p13==0)||(i2.u0.p27==0))) * (i2.u0.p8==0)) * (i5.u10.p25==0)) * (i2.u0.p11==0)) * ((i2.u6.p16==0)||(i2.u0.p27==0)))))) + EG(!(((((((((((((((!(!(EG(!(((i3.u7.p18==1)||((i2.u5.p14==1)&&(i6.u12.p32==1))))))) * !(E((((u8.p21==1)||(i5.u10.p25==1))||((u8.p21==1)&&(i2.u0.p27==1))) U (((((((i3.u7.p18==1)||(((i7.u9.p24==1)&&(i3.u14.p38==1))&&(i7.u15.p40==1)))||(i2.u0.p5==1))||((i7.u9.p24==1)&&(i7.u15.p39==1)))||(i5.u10.p26==1))||((i0.u1.p1==1)&&(i6.u4.p13==1)))||(i2.u6.p15==1))))) * ((i0.u1.p1==0)||(u8.p21==0))) * (u3.p10==0)) * ((i0.u1.p1==0)||(i0.u2.p7==0))) * ((i2.u0.p5==0)||(i2.u0.p27==0))) * (i2.u5.p14==0)) * (i3.u7.p18==0)) * (i2.u0.p2==0)) * (i0.u1.p3==0)) * ((i6.u4.p13==0)||(i2.u0.p27==0))) * (i2.u0.p8==0)) * (i5.u10.p25==0)) * (i2.u0.p11==0)) * ((i2.u6.p16==0)||(i2.u0.p27==0))))))))),!(EX(EG(!(E(TRUE U !((((((((i2.u6.p16==1)||((i5.u10.p26==1)&&(i5.u11.p28==1)))||(u8.p20==1))||((i2.u5.p14==1)&&(i6.u12.p32==1)))||((i0.u1.p1==1)&&(i0.u2.p7==1)))||((u8.p21==1)&&(i2.u0.p27==1)))||(i2.u6.p15==1)))))))))] = FALSE
Fast SCC detection found an 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 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
(forward)formula 8,1,0.083003,5980,1,0,1498,129,1467,1906,195,226,6391
FORMULA SmartHome-PT-02-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(AG((AX(((((((((((((i5.u10.p26==1)&&(i2.u0.p27==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||(i7.u9.p22==1))||(i5.u10.p25==1))||(u3.p10==1))||((i2.u5.p14==1)&&(i2.u13.p35==1)))||(i5.u10.p26==1))||(i2.u0.p11==1))||(i6.u4.p13==1))&&(i2.u0.p11==1))&&(i2.u0.p27==1))) * (A(EF(((((((((((i2.u0.p2==1)||(u8.p20==1))||(i7.u9.p24==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))||(i2.u0.p8==1))||((i0.u1.p1==1)&&(i7.u9.p24==1)))||(u3.p10==1))||(i2.u0.p11==1))||((i2.u0.p5==1)&&(i2.u0.p27==1)))||((i0.u1.p1==1)&&(i6.u4.p13==1)))) U E((((i0.u1.p3==1)||(i2.u0.p5==1))||(i6.u4.p13==1)) U ((((i7.u9.p24==1)&&(i2.u0.p27==1))||(i2.u0.p11==1))||(i6.u4.p13==1)))) + EG(EX((((((((i7.u9.p24==1)&&(i5.u11.p30==1))||(i7.u9.p22==1))||(i0.u2.p6==1))||((i2.u0.p11==1)&&(i2.u0.p27==1)))||(i5.u10.p25==1))||(i2.u0.p11==1))))))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !(((((((((((((i5.u10.p26==1)&&(i2.u0.p27==1))||((i7.u9.p24==1)&&(i2.u0.p27==1)))||(i7.u9.p22==1))||(i5.u10.p25==1))||(u3.p10==1))||((i2.u5.p14==1)&&(i2.u13.p35==1)))||(i5.u10.p26==1))||(i2.u0.p11==1))||(i6.u4.p13==1))&&(i2.u0.p11==1))&&(i2.u0.p27==1))))] != FALSE + ([((FwdU((FwdU(Init,TRUE) * !(EG(EX((((((((i7.u9.p24==1)&&(i5.u11.p30==1))||(i7.u9.p22==1))||(i0.u2.p6==1))||((i2.u0.p11==1)&&(i2.u0.p27==1)))||(i5.u10.p25==1))||(i2.u0.p11==1)))))),!(E((((i0.u1.p3==1)||(i2.u0.p5==1))||(i6.u4.p13==1)) U ((((i7.u9.p24==1)&&(i2.u0.p27==1))||(i2.u0.p11==1))||(i6.u4.p13==1))))) * !(E(TRUE U ((((((((((i2.u0.p2==1)||(u8.p20==1))||(i7.u9.p24==1))||((i0.u1.p1==1)&&(i5.u10.p26==1)))||(i2.u0.p8==1))||((i0.u1.p1==1)&&(i7.u9.p24==1)))||(u3.p10==1))||(i2.u0.p11==1))||((i2.u0.p5==1)&&(i2.u0.p27==1)))||((i0.u1.p1==1)&&(i6.u4.p13==1)))))) * !(E((((i0.u1.p3==1)||(i2.u0.p5==1))||(i6.u4.p13==1)) U ((((i7.u9.p24==1)&&(i2.u0.p27==1))||(i2.u0.p11==1))||(i6.u4.p13==1)))))] != FALSE + [FwdG((FwdU(Init,TRUE) * !(EG(EX((((((((i7.u9.p24==1)&&(i5.u11.p30==1))||(i7.u9.p22==1))||(i0.u2.p6==1))||((i2.u0.p11==1)&&(i2.u0.p27==1)))||(i5.u10.p25==1))||(i2.u0.p11==1)))))),!(E((((i0.u1.p3==1)||(i2.u0.p5==1))||(i6.u4.p13==1)) U ((((i7.u9.p24==1)&&(i2.u0.p27==1))||(i2.u0.p11==1))||(i6.u4.p13==1)))))] != FALSE))
(forward)formula 9,0,0.091262,6244,1,0,1506,129,1557,1918,203,226,6592
FORMULA SmartHome-PT-02-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621165523432

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-02"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-02, 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 r254-tall-162106745600162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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