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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.6K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 3.0K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-09-00
FORMULA_NAME SmartHome-PT-09-01
FORMULA_NAME SmartHome-PT-09-02
FORMULA_NAME SmartHome-PT-09-03
FORMULA_NAME SmartHome-PT-09-04
FORMULA_NAME SmartHome-PT-09-05
FORMULA_NAME SmartHome-PT-09-06
FORMULA_NAME SmartHome-PT-09-07
FORMULA_NAME SmartHome-PT-09-08
FORMULA_NAME SmartHome-PT-09-09
FORMULA_NAME SmartHome-PT-09-10
FORMULA_NAME SmartHome-PT-09-11
FORMULA_NAME SmartHome-PT-09-12
FORMULA_NAME SmartHome-PT-09-13
FORMULA_NAME SmartHome-PT-09-14
FORMULA_NAME SmartHome-PT-09-15

=== Now, execution of the tool begins

BK_START 1590483705292

[2020-05-26 09:01:49] [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:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:49] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2020-05-26 09:01:49] [INFO ] Transformed 253 places.
[2020-05-26 09:01:49] [INFO ] Transformed 293 transitions.
[2020-05-26 09:01:49] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:49] [INFO ] Parsed PT model containing 253 places and 293 transitions in 166 ms.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 30 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 91 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 561 resets, run finished after 240 ms. (steps per millisecond=416 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 263 rows 224 cols
[2020-05-26 09:01:49] [INFO ] Computed 10 place invariants in 25 ms
[2020-05-26 09:01:50] [INFO ] [Real]Absence check using 10 positive place invariants in 152 ms returned sat
[2020-05-26 09:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:50] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2020-05-26 09:01:51] [INFO ] Deduced a trap composed of 67 places in 302 ms
[2020-05-26 09:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 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 10 positive place invariants in 278 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 1001 ms returned sat
[2020-05-26 09:01:53] [INFO ] Deduced a trap composed of 56 places in 896 ms
[2020-05-26 09:01:53] [INFO ] Deduced a trap composed of 45 places in 126 ms
[2020-05-26 09:01:53] [INFO ] Deduced a trap composed of 34 places in 107 ms
[2020-05-26 09:01:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1207 ms
[2020-05-26 09:01:54] [INFO ] Computed and/alt/rep : 262/751/262 causal constraints in 84 ms.
[2020-05-26 09:01:55] [INFO ] Added : 224 causal constraints over 45 iterations in 1991 ms. Result :sat
[2020-05-26 09:01:56] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-26 09:01:56] [INFO ] Flatten gal took : 120 ms
FORMULA SmartHome-PT-09-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:01:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:01:56] [INFO ] Flatten gal took : 31 ms
[2020-05-26 09:01:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-09-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-26 09:01:56] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-26 09:01:56] [INFO ] Flatten gal took : 18 ms
[2020-05-26 09:01:56] [INFO ] Input system was already deterministic with 263 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/graph3275098510535368261.txt, -o, /tmp/graph3275098510535368261.bin, -w, /tmp/graph3275098510535368261.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/graph3275098510535368261.bin, -l, -1, -v, -w, /tmp/graph3275098510535368261.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:01:57] [INFO ] Decomposing Gal with order
[2020-05-26 09:01:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:01:57] [INFO ] Removed a total of 54 redundant transitions.
[2020-05-26 09:01:57] [INFO ] Flatten gal took : 113 ms
[2020-05-26 09:01:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 21 ms.
[2020-05-26 09:01:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-26 09:01:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 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 10 LTL properties
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 263 rows 224 cols
[2020-05-26 09:01:57] [INFO ] Computed 10 place invariants in 5 ms
inv : p0 + p1 + p13 + p14 + p15 + p16 + p80 + p81 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p1 + p13 + p14 + p15 + p16 + p17 + p49 + p50 + p52 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 = 1
inv : p0 + p1 + p13 + p14 + p142 + p143 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 = 1
inv : p0 + p1 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p221 + p222 + p223 + p224 + p225 + p226 + p227 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 = 1
inv : p0 + p1 + p13 + p190 + p191 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p216 + p217 + p218 + p219 + p220 = 1
inv : p0 + p221 + p228 + p229 + p230 + p231 + p232 + p233 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p251 + p252 = 1
inv : p0 + p221 + p228 + p229 + p230 + p231 + p232 + p233 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 = 1
inv : p0 + p1 + p13 + p14 + p15 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p137 + p138 + p139 + p140 + p141 = 1
Total of 10 invariants.
[2020-05-26 09:01:57] [INFO ] Computed 10 place invariants in 6 ms
Checking formula 0 : !(((G("(i3.i1.u18.p63!=1)"))&&(!(G(!(X("(i10.i0.u66.p197==1)")))))))
Formula 0 simplified : !(G"(i3.i1.u18.p63!=1)" & !G!X"(i10.i0.u66.p197==1)")
built 24 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 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 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 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 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t23, t60, t115, t151, t187, t222, u1.t254, u1.t255, u1.t256, u1.t257, u1.t258, u1.t259, u1.t260, u1.t261, u1.t262, u1.t263, i1.i0.t247, i1.i0.t249, i1.i0.u5.t223, i3.i0.t191, i3.i0.u22.t188, i3.i2.t12, i3.i2.u80.t3, i4.i0.t176, i4.i0.t178, i4.i0.u32.t152, i5.i0.t140, i5.i0.t142, i5.i0.u44.t116, i6.t106, i6.t104, i6.t100, i6.t65, i6.u62.t61, i6.u62.t62, i9.t6, i9.u76.t13, i9.u76.t14, i9.u76.t15, i9.u76.t16, i9.u76.t17, i10.i0.t48, i10.i0.t50, i10.i0.u64.t24, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/212/44/256
Computing Next relation with stutter on 14 deadlock states
[2020-05-26 09:02:00] [INFO ] Proved 224 variables to be positive in 2478 ms
[2020-05-26 09:02:00] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2020-05-26 09:02:00] [INFO ] Computation of disable matrix completed :0/263 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:00] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:00] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2020-05-26 09:02:00] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
282 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,3.34174,125316,1,0,244322,1874,3019,350822,502,10596,457311
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-09-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((X(X(F("(i8.i1.u46.p188!=1)"))))U(X(F(G("(i8.i1.u46.p188==1)")))))))
Formula 1 simplified : !F(XXF"(i8.i1.u46.p188!=1)" U XFG"(i8.i1.u46.p188==1)")
Computing Next relation with stutter on 14 deadlock states
[2020-05-26 09:02:02] [INFO ] Computing symmetric co enabling matrix : 263 transitions.
[2020-05-26 09:02:03] [INFO ] Computation of co-enabling matrix(1/263) took 704 ms. Total solver calls (SAT/UNSAT): 43(0/43)
[2020-05-26 09:02:06] [INFO ] Computation of co-enabling matrix(25/263) took 3713 ms. Total solver calls (SAT/UNSAT): 1202(8/1194)
[2020-05-26 09:02:11] [INFO ] Computation of co-enabling matrix(49/263) took 8371 ms. Total solver calls (SAT/UNSAT): 1746(19/1727)
[2020-05-26 09:02:14] [INFO ] Computation of co-enabling matrix(69/263) took 11484 ms. Total solver calls (SAT/UNSAT): 2796(32/2764)
[2020-05-26 09:02:17] [INFO ] Computation of co-enabling matrix(83/263) took 14491 ms. Total solver calls (SAT/UNSAT): 3293(34/3259)
[2020-05-26 09:02:20] [INFO ] Computation of co-enabling matrix(102/263) took 17521 ms. Total solver calls (SAT/UNSAT): 3654(56/3598)
[2020-05-26 09:02:23] [INFO ] Computation of co-enabling matrix(116/263) took 20569 ms. Total solver calls (SAT/UNSAT): 4140(64/4076)
[2020-05-26 09:02:26] [INFO ] Computation of co-enabling matrix(128/263) took 23735 ms. Total solver calls (SAT/UNSAT): 4338(65/4273)
[2020-05-26 09:02:29] [INFO ] Computation of co-enabling matrix(182/263) took 26740 ms. Total solver calls (SAT/UNSAT): 5425(99/5326)
[2020-05-26 09:02:32] [INFO ] Computation of co-enabling matrix(234/263) took 29755 ms. Total solver calls (SAT/UNSAT): 6247(124/6123)
[2020-05-26 09:02:35] [INFO ] Computation of Finished co-enabling matrix. took 32271 ms. Total solver calls (SAT/UNSAT): 6416(228/6188)
[2020-05-26 09:02:35] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2020-05-26 09:02:35] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:35] [INFO ] Built C files in 38625ms 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 4104 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 83 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>((X(X(<>((LTLAP2==true)))))U(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(<>((LTLAP2==true)))))U(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(<>((LTLAP2==true)))))U(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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4894 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.2817,950468,1,0,1.64109e+06,1938,3046,2.66362e+06,502,11683,1320293
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-09-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(!(X(G(("(i10.i0.u64.p216==1)")U((X("(i10.i0.u64.p216==1)"))&&("(i7.i3.u58.p175==1)")))))))))
Formula 2 simplified : !GF!XG("(i10.i0.u64.p216==1)" U ("(i7.i3.u58.p175==1)" & X"(i10.i0.u64.p216==1)"))
Computing Next relation with stutter on 14 deadlock states
65 unique states visited
64 strongly connected components in search stack
68 transitions explored
65 items max in DFS search stack
246 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,54.7491,993300,1,0,1.7285e+06,1963,3088,2.80995e+06,504,11882,1460147
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-09-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F(G("((i3.i1.u20.p70==1)||(i4.i0.u24.p88==1))")))U("((i3.i1.u20.p70==1)||((i6.u62.p185==1)&&(i9.i1.u75.p247==1)))")))
Formula 3 simplified : !(FG"((i3.i1.u20.p70==1)||(i4.i0.u24.p88==1))" U "((i3.i1.u20.p70==1)||((i6.u62.p185==1)&&(i9.i1.u75.p247==1)))")
Computing Next relation with stutter on 14 deadlock states
29 unique states visited
29 strongly connected components in search stack
29 transitions explored
29 items max in DFS search stack
184 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,56.5951,1058400,1,0,1.87711e+06,1963,3157,2.98721e+06,505,11914,1651660
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-09-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(X("(i1.i1.u11.p33==1)")))&&(!(F(X("(i1.i0.u6.p26==1)"))))))
Formula 4 simplified : !(!X"(i1.i1.u11.p33==1)" & !FX"(i1.i0.u6.p26==1)")
Computing Next relation with stutter on 14 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
84 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,57.448,1089372,1,0,1.94535e+06,1969,3220,3.08213e+06,506,12190,1776319
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-09-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X("(i9.i1.u0.p1==1)"))))
Formula 5 simplified : !GX"(i9.i1.u0.p1==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
0 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,57.4502,1089628,1,0,1.94539e+06,1969,3239,3.08219e+06,506,12190,1776645
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-09-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G("(i3.i1.u17.p62==1)"))U(F(X(X(F("(i3.i1.u17.p62!=1)")))))))
Formula 6 simplified : !(G"(i3.i1.u17.p62==1)" U FXXF"(i3.i1.u17.p62!=1)")
Computing Next relation with stutter on 14 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 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,57.451,1089628,1,0,1.94539e+06,1969,3257,3.08219e+06,506,12190,1776673
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA SmartHome-PT-09-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((X((F("(i1.i1.u13.p38==1)"))U(X("(i5.i0.u37.p116==1)"))))U(("(i10.i0.u72.p202==1)")U(X(G("(i1.i1.u13.p38==1)")))))||(F("(i10.i0.u67.p199==1)"))))
Formula 7 simplified : !((X(F"(i1.i1.u13.p38==1)" U X"(i5.i0.u37.p116==1)") U ("(i10.i0.u72.p202==1)" U XG"(i1.i1.u13.p38==1)")) | F"(i10.i0.u67.p199==1)")
Computing Next relation with stutter on 14 deadlock states
29 unique states visited
29 strongly connected components in search stack
29 transitions explored
29 items max in DFS search stack
66 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,58.1233,1116292,1,0,2.00431e+06,1970,3340,3.16513e+06,506,12209,1858613
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-09-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((!(X((G("(i4.i1.u30.p99==1)"))&&("(i4.i1.u30.p99!=1)"))))&&(!(G((F("(i6.u49.p153==1)"))U(G("(i11.i0.u81.p243==1)")))))))
Formula 8 simplified : !(!X("(i4.i1.u30.p99!=1)" & G"(i4.i1.u30.p99==1)") & !G(F"(i6.u49.p153==1)" U G"(i11.i0.u81.p243==1)"))
Computing Next relation with stutter on 14 deadlock states
38 unique states visited
37 strongly connected components in search stack
39 transitions explored
37 items max in DFS search stack
150 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,59.643,1166612,1,0,2.11065e+06,1991,3408,3.33726e+06,508,12403,2034346
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-09-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(X((F("(i8.i0.u2.p14==1)"))&&("(i3.i1.u19.p65==1)"))))))
Formula 9 simplified : !XFX("(i3.i1.u19.p65==1)" & F"(i8.i0.u2.p14==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
158 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,61.2356,1188652,1,0,2.1552e+06,1994,3446,3.39997e+06,508,12427,2117601
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-09-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1590483786078

--------------------
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-09"
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-09, 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-159033546100066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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