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-159033546100042.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-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.1K May 14 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 56K 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-06-00
FORMULA_NAME SmartHome-PT-06-01
FORMULA_NAME SmartHome-PT-06-02
FORMULA_NAME SmartHome-PT-06-03
FORMULA_NAME SmartHome-PT-06-04
FORMULA_NAME SmartHome-PT-06-05
FORMULA_NAME SmartHome-PT-06-06
FORMULA_NAME SmartHome-PT-06-07
FORMULA_NAME SmartHome-PT-06-08
FORMULA_NAME SmartHome-PT-06-09
FORMULA_NAME SmartHome-PT-06-10
FORMULA_NAME SmartHome-PT-06-11
FORMULA_NAME SmartHome-PT-06-12
FORMULA_NAME SmartHome-PT-06-13
FORMULA_NAME SmartHome-PT-06-14
FORMULA_NAME SmartHome-PT-06-15

=== Now, execution of the tool begins

BK_START 1590483671202

[2020-05-26 09:01:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:12] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-05-26 09:01:12] [INFO ] Transformed 219 places.
[2020-05-26 09:01:12] [INFO ] Transformed 254 transitions.
[2020-05-26 09:01:12] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:12] [INFO ] Parsed PT model containing 219 places and 254 transitions in 98 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 18 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 675 resets, run finished after 148 ms. (steps per millisecond=675 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 236 rows 202 cols
[2020-05-26 09:01:13] [INFO ] Computed 9 place invariants in 8 ms
[2020-05-26 09:01:13] [INFO ] [Real]Absence check using 9 positive place invariants in 26 ms returned unsat
[2020-05-26 09:01:13] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2020-05-26 09:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:13] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-05-26 09:01:13] [INFO ] Deduced a trap composed of 47 places in 87 ms
[2020-05-26 09:01:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2020-05-26 09:01:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 147 ms returned sat
[2020-05-26 09:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:13] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-05-26 09:01:13] [INFO ] Deduced a trap composed of 47 places in 33 ms
[2020-05-26 09:01:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2020-05-26 09:01:14] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 51 ms.
[2020-05-26 09:01:14] [INFO ] Added : 233 causal constraints over 47 iterations in 1016 ms. Result :sat
[2020-05-26 09:01:15] [INFO ] Deduced a trap composed of 47 places in 71 ms
[2020-05-26 09:01:15] [INFO ] Deduced a trap composed of 75 places in 57 ms
[2020-05-26 09:01:15] [INFO ] Deduced a trap composed of 65 places in 40 ms
[2020-05-26 09:01:15] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2020-05-26 09:01:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 335 ms
[2020-05-26 09:01:15] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:15] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-05-26 09:01:15] [INFO ] Deduced a trap composed of 44 places in 35 ms
[2020-05-26 09:01:15] [INFO ] Deduced a trap composed of 47 places in 44 ms
[2020-05-26 09:01:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2020-05-26 09:01:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 379 ms returned sat
[2020-05-26 09:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:16] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-05-26 09:01:16] [INFO ] Deduced a trap composed of 33 places in 50 ms
[2020-05-26 09:01:16] [INFO ] Deduced a trap composed of 27 places in 67 ms
[2020-05-26 09:01:16] [INFO ] Deduced a trap composed of 47 places in 26 ms
[2020-05-26 09:01:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2020-05-26 09:01:16] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 12 ms.
[2020-05-26 09:01:17] [INFO ] Added : 235 causal constraints over 47 iterations in 894 ms. Result :sat
[2020-05-26 09:01:17] [INFO ] [Real]Absence check using 9 positive place invariants in 48 ms returned sat
[2020-05-26 09:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:17] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-26 09:01:17] [INFO ] Deduced a trap composed of 67 places in 59 ms
[2020-05-26 09:01:17] [INFO ] Deduced a trap composed of 27 places in 36 ms
[2020-05-26 09:01:17] [INFO ] Deduced a trap composed of 43 places in 133 ms
[2020-05-26 09:01:17] [INFO ] Deduced a trap composed of 34 places in 29 ms
[2020-05-26 09:01:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 306 ms
[2020-05-26 09:01:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 403 ms returned sat
[2020-05-26 09:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:18] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 27 places in 67 ms
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 33 places in 48 ms
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 47 places in 39 ms
[2020-05-26 09:01:18] [INFO ] Deduced a trap composed of 33 places in 34 ms
[2020-05-26 09:01:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 248 ms
[2020-05-26 09:01:18] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 19 ms.
[2020-05-26 09:01:19] [INFO ] Added : 235 causal constraints over 47 iterations in 849 ms. Result :sat
[2020-05-26 09:01:19] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:19] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-05-26 09:01:19] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 10 ms.
[2020-05-26 09:01:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 100 ms returned sat
[2020-05-26 09:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:19] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-05-26 09:01:20] [INFO ] Deduced a trap composed of 27 places in 41 ms
[2020-05-26 09:01:20] [INFO ] Deduced a trap composed of 52 places in 37 ms
[2020-05-26 09:01:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2020-05-26 09:01:20] [INFO ] Computed and/alt/rep : 235/716/235 causal constraints in 8 ms.
[2020-05-26 09:01:20] [INFO ] Added : 235 causal constraints over 47 iterations in 818 ms. Result :sat
[2020-05-26 09:01:20] [INFO ] Deduced a trap composed of 43 places in 35 ms
[2020-05-26 09:01:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-26 09:01:21] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-26 09:01:21] [INFO ] Flatten gal took : 103 ms
FORMULA SmartHome-PT-06-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:01:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:01:21] [INFO ] Flatten gal took : 12 ms
[2020-05-26 09:01:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:01:21] [INFO ] Applying decomposition
[2020-05-26 09:01:21] [INFO ] Flatten gal took : 15 ms
[2020-05-26 09:01:21] [INFO ] Input system was already deterministic with 236 transitions.
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/graph13475662405446607049.txt, -o, /tmp/graph13475662405446607049.bin, -w, /tmp/graph13475662405446607049.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/graph13475662405446607049.bin, -l, -1, -v, -w, /tmp/graph13475662405446607049.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:01:21] [INFO ] Decomposing Gal with order
[2020-05-26 09:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 236 rows 202 cols
[2020-05-26 09:01:21] [INFO ] Computed 9 place invariants in 2 ms
inv : p0 + p187 + p188 + p189 + p190 + p191 + p192 + p193 = 1
inv : p0 + p1 + p11 + p12 + p13 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p103 + p104 + p105 + p106 + p107 = 1
inv : p0 + p187 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p217 + p218 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 = 1
inv : p0 + p1 + p11 + p12 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 = 1
inv : p0 + p1 + p11 + p12 + p13 + p14 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p72 + p73 + p74 + p75 + p76 = 1
inv : p0 + p1 + p11 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p182 + p183 + p184 + p185 + p186 = 1
inv : p0 + p187 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 = 1
inv : p0 + p1 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 = 1
Total of 9 invariants.
[2020-05-26 09:01:21] [INFO ] Computed 9 place invariants in 3 ms
[2020-05-26 09:01:21] [INFO ] Removed a total of 45 redundant transitions.
[2020-05-26 09:01:22] [INFO ] Flatten gal took : 206 ms
[2020-05-26 09:01:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 6 ms.
[2020-05-26 09:01:22] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-26 09:01:22] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !(((G((!(X("((i4.i0.u25.p104!=1)||(i11.u64.p188!=1))")))&&("(i9.i2.u62.p185==1)")))||(X(!(G("(i1.i0.u11.p16==1)"))))))
Formula 0 simplified : !(G("(i9.i2.u62.p185==1)" & !X"((i4.i0.u25.p104!=1)||(i11.u64.p188!=1))") | X!G"(i1.i0.u11.p16==1)")
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-26 09:01:23] [INFO ] Proved 202 variables to be positive in 1262 ms
[2020-05-26 09:01:23] [INFO ] Computing symmetric may disable matrix : 236 transitions.
[2020-05-26 09:01:23] [INFO ] Computation of disable matrix completed :0/236 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:23] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:23] [INFO ] Computing symmetric may enable matrix : 236 transitions.
[2020-05-26 09:01:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t23, t60, t186, u1.t218, u1.t219, u1.t220, u1.t221, u1.t222, u1.t223, u1.t224, u1.t225, i1.i0.t190, i1.i0.u11.t187, i1.i0.u11.t215, i1.i0.u65.t3, i1.i0.u65.t12, i2.t151, i2.i0.t176, i2.i0.t178, i2.i0.u13.t152, i2.i0.u13.t180, i4.t115, i4.i0.t140, i4.i0.t142, i4.i0.u25.t116, i4.i0.u25.t144, i8.t100, i8.i1.t65, i8.i1.u51.t61, i8.i1.u51.t62, i8.i1.u51.t108, i10.i0.t48, i10.i0.t50, i10.i0.u53.t24, i10.i0.u53.t52, i11.t6, i11.u64.t13, i11.u64.t14, i11.u64.t15, i11.u64.t16, i11.u64.t17, i11.u66.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/185/42/227
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
180 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.84636,76336,1,0,119913,1803,2389,218886,444,10576,419028
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SmartHome-PT-06-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(X(X(F(G((X("(i2.i0.u15.p53==1)"))||("(i1.i1.u6.p29==1)")))))))||(F(X(X(X("(i2.i0.u15.p53==1)")))))))
Formula 1 simplified : !(GXXFG("(i1.i1.u6.p29==1)" | X"(i2.i0.u15.p53==1)") | FXXX"(i2.i0.u15.p53==1)")
Computing Next relation with stutter on 14 deadlock states
[2020-05-26 09:01:25] [INFO ] Computing symmetric co enabling matrix : 236 transitions.
[2020-05-26 09:01:26] [INFO ] Computation of co-enabling matrix(6/236) took 781 ms. Total solver calls (SAT/UNSAT): 381(0/381)
[2020-05-26 09:01:29] [INFO ] Computation of co-enabling matrix(64/236) took 3781 ms. Total solver calls (SAT/UNSAT): 2497(33/2464)
[2020-05-26 09:01:32] [INFO ] Computation of co-enabling matrix(140/236) took 6791 ms. Total solver calls (SAT/UNSAT): 4676(80/4596)
[2020-05-26 09:01:35] [INFO ] Computation of co-enabling matrix(177/236) took 10398 ms. Total solver calls (SAT/UNSAT): 5513(98/5415)
[2020-05-26 09:01:38] [INFO ] Computation of co-enabling matrix(201/236) took 13413 ms. Total solver calls (SAT/UNSAT): 5883(115/5768)
[2020-05-26 09:01:40] [INFO ] Computation of Finished co-enabling matrix. took 14696 ms. Total solver calls (SAT/UNSAT): 6143(208/5935)
[2020-05-26 09:01:40] [INFO ] Computing Do-Not-Accords matrix : 236 transitions.
[2020-05-26 09:01:40] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:40] [INFO ] Built C files in 18648ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 2135 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 76 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](X(X(<>([](( X((LTLAP3==true))) || ( (LTLAP4==true)) )))))) || ( <>(X(X(X((LTLAP3==true)))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](X(X(<>([](( X((LTLAP3==true))) || ( (LTLAP4==true)) )))))) || ( <>(X(X(X((LTLAP3==true)))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( [](X(X(<>([](( X((LTLAP3==true))) || ( (LTLAP4==true)) )))))) || ( <>(X(X(X((LTLAP3==true)))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
4942 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,51.2845,1075492,1,0,1.97752e+06,2187,2433,3.11932e+06,446,15254,1665115
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-06-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(!(G(!(X(G("(u1.p9==1)")))))))U(G("(i8.i1.u69.p216==1)"))))
Formula 2 simplified : !(G!G!XG"(u1.p9==1)" U G"(i8.i1.u69.p216==1)")
Computing Next relation with stutter on 14 deadlock states
25 unique states visited
25 strongly connected components in search stack
25 transitions explored
25 items max in DFS search stack
134 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,52.6264,1102680,1,0,2.02718e+06,2940,2940,3.2164e+06,485,17679,1772233
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-06-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F("(((i1.i0.u11.p42==1)&&(i1.i0.u10.p198==1))||(i10.i1.u60.p174==1))"))&&((G("((i8.i1.u51.p151==1)&&(i8.i1.u68.p217==1))"))||(!(G("((i1.i0.u11.p42==1)&&(i1.i0.u10.p198==1))"))))))
Formula 3 simplified : !(F"(((i1.i0.u11.p42==1)&&(i1.i0.u10.p198==1))||(i10.i1.u60.p174==1))" & (G"((i8.i1.u51.p151==1)&&(i8.i1.u68.p217==1))" | !G"((i1.i0.u11.p42==1)&&(i1.i0.u10.p198==1))"))
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
102 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,53.6462,1140628,1,0,2.10906e+06,3066,3008,3.33843e+06,488,18606,1887660
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-06-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G("(i2.i0.u13.p72!=1)"))&&(!(F(X("(i2.i0.u13.p72==1)"))))))
Formula 4 simplified : !(G"(i2.i0.u13.p72!=1)" & !FX"(i2.i0.u13.p72==1)")
Computing Next relation with stutter on 14 deadlock states
27 unique states visited
27 strongly connected components in search stack
28 transitions explored
27 items max in DFS search stack
189 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,55.5347,1176228,1,0,2.18266e+06,3178,3068,3.44781e+06,494,19485,2031389
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-06-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(G(X((X("(u1.p9==1)"))&&("(i6.i1.u48.p142==1)")))))))
Formula 5 simplified : !XXGX("(i6.i1.u48.p142==1)" & X"(u1.p9==1)")
Computing Next relation with stutter on 14 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,55.5677,1176988,1,0,2.18339e+06,3178,3074,3.44908e+06,494,19485,2032601
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-06-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((!(X("(i11.u66.p200==1)")))||("(i8.i0.u37.p117==1)"))U("(((i1.i0.u11.p17==1)&&(i8.i0.u37.p117==1))&&(i2.i0.u13.p48==1))"))))
Formula 6 simplified : !X(("(i8.i0.u37.p117==1)" | !X"(i11.u66.p200==1)") U "(((i1.i0.u11.p17==1)&&(i8.i0.u37.p117==1))&&(i2.i0.u13.p48==1))")
Computing Next relation with stutter on 14 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
2229 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,77.8556,1842040,1,0,3.47681e+06,3537,3146,5.65644e+06,494,22304,3709483
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-06-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("((i2.i1.u23.p76==1)&&(i6.i1.u48.p140==1))"))))
Formula 7 simplified : !XG"((i2.i1.u23.p76==1)&&(i6.i1.u48.p140==1))"
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,77.8743,1842304,1,0,3.47691e+06,3537,3171,5.65664e+06,494,22304,3709686
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-06-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(G((F("(i3.u17.p65==1)"))||("(i9.i2.u62.p185==1)"))))U(X(G("(i4.i1.u24.p77==1)")))))
Formula 8 simplified : !(!G("(i9.i2.u62.p185==1)" | F"(i3.u17.p65==1)") U XG"(i4.i1.u24.p77==1)")
Computing Next relation with stutter on 14 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
2132 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,99.1986,2294292,1,0,4.3011e+06,3589,3273,7.24056e+06,494,22567,4904665
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-06-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((G(("(i8.i1.u51.p109==1)")U(X("(i7.i1.u46.p125==1)"))))||(F(X(G("(i1.i1.u8.p34==1)")))))))
Formula 9 simplified : !G(G("(i8.i1.u51.p109==1)" U X"(i7.i1.u46.p125==1)") | FXG"(i1.i1.u8.p34==1)")
Computing Next relation with stutter on 14 deadlock states
28 unique states visited
28 strongly connected components in search stack
29 transitions explored
28 items max in DFS search stack
1330 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,112.497,2291852,1,0,4.3011e+06,3589,1573,7.24056e+06,274,22567,142330
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-06-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X((X(G((("(i1.i1.u9.p36==1)")U("((i4.i0.u25.p104==1)&&(i8.i1.u68.p214==1))"))||("(i8.i1.u50.p148!=1)"))))||(F(X("(i1.i1.u9.p36==1)")))))))
Formula 10 simplified : !XX(XG("(i8.i1.u50.p148!=1)" | ("(i1.i1.u9.p36==1)" U "((i4.i0.u25.p104==1)&&(i8.i1.u68.p214==1))")) | FX"(i1.i1.u9.p36==1)")
Computing Next relation with stutter on 14 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
81 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,113.304,2291852,1,0,4.3011e+06,3589,1800,7.24056e+06,294,22567,359073
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA SmartHome-PT-06-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((G(F("(i10.i1.u61.p176==1)")))||(F(X("(i10.i1.u61.p176==1)"))))))
Formula 11 simplified : !F(GF"(i10.i1.u61.p176==1)" | FX"(i10.i1.u61.p176==1)")
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,113.514,2291852,1,0,4.3011e+06,3589,1822,7.24056e+06,294,22567,385239
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA SmartHome-PT-06-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1590483796840

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-06"
export BK_EXAMINATION="LTLFireability"
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-06, examination is LTLFireability"
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-159033546100042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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