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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 2.7K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.2K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 14K 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 68K 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-10-00
FORMULA_NAME SmartHome-PT-10-01
FORMULA_NAME SmartHome-PT-10-02
FORMULA_NAME SmartHome-PT-10-03
FORMULA_NAME SmartHome-PT-10-04
FORMULA_NAME SmartHome-PT-10-05
FORMULA_NAME SmartHome-PT-10-06
FORMULA_NAME SmartHome-PT-10-07
FORMULA_NAME SmartHome-PT-10-08
FORMULA_NAME SmartHome-PT-10-09
FORMULA_NAME SmartHome-PT-10-10
FORMULA_NAME SmartHome-PT-10-11
FORMULA_NAME SmartHome-PT-10-12
FORMULA_NAME SmartHome-PT-10-13
FORMULA_NAME SmartHome-PT-10-14
FORMULA_NAME SmartHome-PT-10-15

=== Now, execution of the tool begins

BK_START 1590483724930

[2020-05-26 09:02:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:02:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:02:06] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-05-26 09:02:06] [INFO ] Transformed 273 places.
[2020-05-26 09:02:06] [INFO ] Transformed 308 transitions.
[2020-05-26 09:02:06] [INFO ] Found NUPN structural information;
[2020-05-26 09:02:06] [INFO ] Parsed PT model containing 273 places and 308 transitions in 90 ms.
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 45 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 651 resets, run finished after 170 ms. (steps per millisecond=588 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1]
// Phase 1: matrix 263 rows 233 cols
[2020-05-26 09:02:06] [INFO ] Computed 12 place invariants in 8 ms
[2020-05-26 09:02:06] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-26 09:02:06] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 4 ms returned sat
[2020-05-26 09:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-05-26 09:02:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned unsat
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-05-26 09:02:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned unsat
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:07] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-26 09:02:07] [INFO ] Deduced a trap composed of 34 places in 191 ms
[2020-05-26 09:02:07] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2020-05-26 09:02:08] [INFO ] Deduced a trap composed of 27 places in 36 ms
[2020-05-26 09:02:08] [INFO ] Deduced a trap composed of 41 places in 27 ms
[2020-05-26 09:02:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2020-05-26 09:02:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 813 ms returned sat
[2020-05-26 09:02:08] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 17 ms returned sat
[2020-05-26 09:02:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:09] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-05-26 09:02:09] [INFO ] Deduced a trap composed of 44 places in 90 ms
[2020-05-26 09:02:09] [INFO ] Deduced a trap composed of 27 places in 193 ms
[2020-05-26 09:02:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2020-05-26 09:02:09] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 24 ms.
[2020-05-26 09:02:10] [INFO ] Added : 261 causal constraints over 53 iterations in 1091 ms. Result :sat
[2020-05-26 09:02:10] [INFO ] Deduced a trap composed of 47 places in 32 ms
[2020-05-26 09:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-05-26 09:02:10] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:02:10] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-26 09:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:10] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-05-26 09:02:10] [INFO ] Deduced a trap composed of 69 places in 51 ms
[2020-05-26 09:02:11] [INFO ] Deduced a trap composed of 41 places in 47 ms
[2020-05-26 09:02:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2020-05-26 09:02:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 463 ms returned sat
[2020-05-26 09:02:11] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:11] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-05-26 09:02:11] [INFO ] Deduced a trap composed of 69 places in 44 ms
[2020-05-26 09:02:11] [INFO ] Deduced a trap composed of 41 places in 40 ms
[2020-05-26 09:02:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2020-05-26 09:02:11] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 18 ms.
[2020-05-26 09:02:12] [INFO ] Added : 262 causal constraints over 53 iterations in 1041 ms. Result :sat
[2020-05-26 09:02:12] [INFO ] Deduced a trap composed of 41 places in 26 ms
[2020-05-26 09:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-05-26 09:02:12] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:02:12] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-05-26 09:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned unsat
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2020-05-26 09:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 43 ms returned unsat
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-26 09:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:02:13] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-05-26 09:02:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:02:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 28 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-05-26 09:02:13] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-26 09:02:13] [INFO ] Flatten gal took : 76 ms
FORMULA SmartHome-PT-10-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:02:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-26 09:02:13] [INFO ] Flatten gal took : 28 ms
[2020-05-26 09:02:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-10-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:02:13] [INFO ] Applying decomposition
[2020-05-26 09:02:14] [INFO ] Flatten gal took : 12 ms
[2020-05-26 09:02:14] [INFO ] Input system was already deterministic with 263 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 263 rows 233 cols
[2020-05-26 09:02:14] [INFO ] Computed 12 place invariants in 4 ms
inv : p0 + p1 + p9 + p10 + p11 + p12 + p93 + p94 + p95 + p96 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 = 1
inv : p0 + p1 + p9 + p10 + p155 + p156 + p157 + p158 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p197 + p198 + p199 + p200 + p201 + p202 = 1
inv : p0 + p1 + p9 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p229 + p230 + p231 + p232 + p233 = 1
inv : p0 + p234 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p269 + p270 + p271 + p272 = 1
inv : p0 + p1 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 = 1
inv : p0 + p234 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p255 + p256 + p257 + p269 + p270 + p271 + p272 = 1
inv : p0 + p234 + p235 + p236 + p237 + p238 = 1
inv : p0 + p234 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p252 + p253 + p254 + p269 + p270 + p271 + p272 = 1
inv : p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 - p269 - p270 - p271 - p272 = 0
inv : p0 + p1 + p9 + p10 + p11 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p150 + p151 + p152 + p153 + p154 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 = 1
inv : p0 + p1 + p9 + p10 + p11 + p12 + p13 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p88 + p89 + p90 + p91 + p92 = 1
Total of 12 invariants.
[2020-05-26 09:02:14] [INFO ] Computed 12 place invariants in 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7697808596434889723.txt, -o, /tmp/graph7697808596434889723.bin, -w, /tmp/graph7697808596434889723.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/graph7697808596434889723.bin, -l, -1, -v, -w, /tmp/graph7697808596434889723.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:02:14] [INFO ] Decomposing Gal with order
[2020-05-26 09:02:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-26 09:02:14] [INFO ] Removed a total of 43 redundant transitions.
[2020-05-26 09:02:14] [INFO ] Flatten gal took : 150 ms
[2020-05-26 09:02:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 24 ms.
[2020-05-26 09:02:14] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-26 09:02:14] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !((X(!(F(("((i6.i1.u81.p267==0)||(i1.i0.u4.p37==1))")U("((i5.u74.p238==0)||(i8.i1.u76.p242==1))"))))))
Formula 0 simplified : !X!F("((i6.i1.u81.p267==0)||(i1.i0.u4.p37==1))" U "((i5.u74.p238==0)||(i8.i1.u76.p242==1))")
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 3 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 12 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-26 09:02:14] [INFO ] Proved 233 variables to be positive in 546 ms
[2020-05-26 09:02:14] [INFO ] Computing symmetric may disable matrix : 263 transitions.
[2020-05-26 09:02:14] [INFO ] Computation of disable matrix completed :0/263 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:14] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:14] [INFO ] Computing symmetric may enable matrix : 263 transitions.
[2020-05-26 09:02:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:15] [INFO ] Computing symmetric co enabling matrix : 263 transitions.
Reverse transition relation is NOT exact ! Due to transitions t5, t22, t114, i2.t222, i2.i0.t227, i2.i0.u13.t223, i2.i0.u13.t224, i2.i0.u13.t270, i2.i0.u82.t1, i2.i0.u82.t2, i4.t211, i4.t186, i4.i1.u24.t187, i4.i1.u24.t215, i4.i1.u75.t13, i5.u1.t273, i5.u1.t274, i5.u1.t275, i5.u1.t276, i5.u1.t277, i5.u1.t278, i5.u74.t14, i5.u74.t15, i5.u74.t16, i6.t150, i6.i1.t154, i6.i1.u33.t151, i6.i1.u33.t179, i7.i0.t139, i7.i0.t141, i7.i0.u37.t115, i7.i0.u37.t143, i8.t59, i8.i1.t64, i8.i1.u60.t60, i8.i1.u60.t107, i11.i0.t47, i11.i0.t49, i11.i0.u70.t23, i11.i0.u70.t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/217/40/257
Computing Next relation with stutter on 60 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
99 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.01871,56668,1,0,84512,3531,3533,139389,560,13732,237275
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-10-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(F((G("((i7.i0.u37.p127==0)||(i4.i0.u17.p70==1))"))&&("(i2.i0.u82.p243==1)"))))))
Formula 1 simplified : !FGF("(i2.i0.u82.p243==1)" & G"((i7.i0.u37.p127==0)||(i4.i0.u17.p70==1))")
Computing Next relation with stutter on 60 deadlock states
48 unique states visited
48 strongly connected components in search stack
49 transitions explored
48 items max in DFS search stack
17 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.1841,63708,1,0,97690,3602,3616,166978,563,14059,263036
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-10-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(F(!(G("((i5.u74.p236==0)||(i4.i1.u75.p247==1))")))))))
Formula 2 simplified : !G!F!G"((i5.u74.p236==0)||(i4.i1.u75.p247==1))"
Computing Next relation with stutter on 60 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.99203,101988,1,0,190368,3618,3659,262706,565,14160,423653
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-10-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(!(X(X(!(X("((i7.i1.u43.p142==0)||(i0.i0.u2.p11==1))"))))))))
Formula 3 simplified : !F!XX!X"((i7.i1.u43.p142==0)||(i0.i0.u2.p11==1))"
Computing Next relation with stutter on 60 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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,1.99652,102284,1,0,190388,3618,3684,262713,565,14160,423800
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA SmartHome-PT-10-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(F(!(X(G(F("((i10.i1.u49.p172==0)||(i9.i0.u54.p184==1))"))))))))
Formula 4 simplified : !XF!XGF"((i10.i1.u49.p172==0)||(i9.i0.u54.p184==1))"
Computing Next relation with stutter on 60 deadlock states
[2020-05-26 09:02:17] [INFO ] Computation of co-enabling matrix(19/263) took 2601 ms. Total solver calls (SAT/UNSAT): 1017(42/975)
[2020-05-26 09:02:21] [INFO ] Computation of co-enabling matrix(55/263) took 6187 ms. Total solver calls (SAT/UNSAT): 2016(60/1956)
[2020-05-26 09:02:24] [INFO ] Computation of co-enabling matrix(62/263) took 9535 ms. Total solver calls (SAT/UNSAT): 2289(68/2221)
[2020-05-26 09:02:27] [INFO ] Computation of co-enabling matrix(100/263) took 12536 ms. Total solver calls (SAT/UNSAT): 3296(90/3206)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1170 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,13.6967,393988,1,0,804757,3870,3708,1.11103e+06,565,16131,875183
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-10-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(X(X(F(F(F("(i12.u77.p272==1)")))))))&&(X("((i11.i0.u64.p212==0)||(i9.i1.u57.p189==1))"))))
Formula 5 simplified : !(FXXF"(i12.u77.p272==1)" & X"((i11.i0.u64.p212==0)||(i9.i1.u57.p189==1))")
Computing Next relation with stutter on 60 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 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,13.7058,394500,1,0,805515,3870,3741,1.11184e+06,567,16133,877237
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-10-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:02:30] [INFO ] Computation of co-enabling matrix(235/263) took 15539 ms. Total solver calls (SAT/UNSAT): 6285(182/6103)
[2020-05-26 09:02:31] [INFO ] Computation of Finished co-enabling matrix. took 15983 ms. Total solver calls (SAT/UNSAT): 6435(240/6195)
[2020-05-26 09:02:31] [INFO ] Computing Do-Not-Accords matrix : 263 transitions.
[2020-05-26 09:02:31] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 8(0/8)
[2020-05-26 09:02:31] [INFO ] Built C files in 17276ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590483751794

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

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

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