Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475400258.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475400258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.1K May 14 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 50K 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 ShieldIIPt-PT-003B-00
FORMULA_NAME ShieldIIPt-PT-003B-01
FORMULA_NAME ShieldIIPt-PT-003B-02
FORMULA_NAME ShieldIIPt-PT-003B-03
FORMULA_NAME ShieldIIPt-PT-003B-04
FORMULA_NAME ShieldIIPt-PT-003B-05
FORMULA_NAME ShieldIIPt-PT-003B-06
FORMULA_NAME ShieldIIPt-PT-003B-07
FORMULA_NAME ShieldIIPt-PT-003B-08
FORMULA_NAME ShieldIIPt-PT-003B-09
FORMULA_NAME ShieldIIPt-PT-003B-10
FORMULA_NAME ShieldIIPt-PT-003B-11
FORMULA_NAME ShieldIIPt-PT-003B-12
FORMULA_NAME ShieldIIPt-PT-003B-13
FORMULA_NAME ShieldIIPt-PT-003B-14
FORMULA_NAME ShieldIIPt-PT-003B-15

=== Now, execution of the tool begins

BK_START 1590579201106

[2020-05-27 11:33:22] [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-27 11:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:33:22] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-05-27 11:33:22] [INFO ] Transformed 213 places.
[2020-05-27 11:33:22] [INFO ] Transformed 198 transitions.
[2020-05-27 11:33:22] [INFO ] Found NUPN structural information;
[2020-05-27 11:33:22] [INFO ] Parsed PT model containing 213 places and 198 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=574 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 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]
// Phase 1: matrix 198 rows 213 cols
[2020-05-27 11:33:22] [INFO ] Computed 28 place invariants in 8 ms
[2020-05-27 11:33:23] [INFO ] [Real]Absence check using 28 positive place invariants in 31 ms returned sat
[2020-05-27 11:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:33:23] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 21 places in 82 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 19 places in 34 ms
[2020-05-27 11:33:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2020-05-27 11:33:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:33:23] [INFO ] [Nat]Absence check using 28 positive place invariants in 24 ms returned sat
[2020-05-27 11:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 11:33:23] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 21 places in 63 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 13 places in 45 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 36 places in 34 ms
[2020-05-27 11:33:23] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-05-27 11:33:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 264 ms
[2020-05-27 11:33:23] [INFO ] Computed and/alt/rep : 197/297/197 causal constraints in 10 ms.
[2020-05-27 11:33:24] [INFO ] Added : 178 causal constraints over 36 iterations in 439 ms. Result :sat
[2020-05-27 11:33:24] [INFO ] Flatten gal took : 41 ms
[2020-05-27 11:33:24] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 11:33:24] [INFO ] Applying decomposition
[2020-05-27 11:33:24] [INFO ] Flatten gal took : 20 ms
[2020-05-27 11:33:24] [INFO ] Input system was already deterministic with 198 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/graph3117063001519908716.txt, -o, /tmp/graph3117063001519908716.bin, -w, /tmp/graph3117063001519908716.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/graph3117063001519908716.bin, -l, -1, -v, -w, /tmp/graph3117063001519908716.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 198 rows 213 cols
[2020-05-27 11:33:24] [INFO ] Computed 28 place invariants in 4 ms
inv : p0 + p1 + p2 + p6 + p7 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p86 + p87 + p88 + p91 + p92 = 1
inv : p0 + p144 + p145 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p155 + p156 + p157 + p158 + p159 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 = 1
inv : p0 + p1 + p75 + p76 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 = 1
inv : p0 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p155 + p156 + p157 + p160 + p161 = 1
inv : p0 + p144 + p145 + p146 + p147 + p148 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 = 1
inv : p0 + p144 + p145 + p146 + p147 + p148 + p149 + p165 + p166 + p167 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p17 + p18 + p19 + p22 + p23 = 1
inv : p0 + p144 + p145 + p146 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p79 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p144 + p145 + p146 + p147 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p93 + p94 + p95 = 1
inv : p0 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p162 + p163 + p164 = 1
inv : p0 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p24 + p25 + p26 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p11 + p27 + p28 + p29 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p86 + p87 + p88 + p89 + p90 = 1
inv : p0 + p1 + p75 + p76 + p77 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 = 1
inv : p0 + p1 + p75 + p76 + p77 + p78 + p79 + p80 + p96 + p97 + p98 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 = 1
Total of 28 invariants.
[2020-05-27 11:33:24] [INFO ] Computed 28 place invariants in 7 ms
[2020-05-27 11:33:24] [INFO ] Decomposing Gal with order
[2020-05-27 11:33:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 11:33:24] [INFO ] Removed a total of 18 redundant transitions.
[2020-05-27 11:33:24] [INFO ] Flatten gal took : 36 ms
[2020-05-27 11:33:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 11:33:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-27 11:33:24] [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 16 LTL properties
Checking formula 0 : !(((X(G("((i11.i0.u58.p159==1)&&(i11.i0.u58.p161==1))")))U("(i14.u77.p208==1)")))
Formula 0 simplified : !(XG"((i11.i0.u58.p159==1)&&(i11.i0.u58.p161==1))" U "(i14.u77.p208==1)")
built 30 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-27 11:33:25] [INFO ] Proved 213 variables to be positive in 251 ms
[2020-05-27 11:33:25] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2020-05-27 11:33:25] [INFO ] Computation of disable matrix completed :0/198 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:33:25] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:33:25] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2020-05-27 11:33:25] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:33:26] [INFO ] Computing symmetric co enabling matrix : 198 transitions.
Reverse transition relation is NOT exact ! Due to transitions t54, t109, t164, i0.i1.t50, i0.i1.t52, i0.i1.u57.t57, i0.i1.u60.t53, i0.i1.u61.t51, i1.t162, i1.i0.u1.t168, i1.i0.u8.t163, i1.i2.t160, i1.i2.u5.t167, i1.i2.u9.t161, i2.t158, i2.t151, i2.u10.t156, i2.u13.t152, i2.u13.t159, i3.i0.u6.t166, i3.i1.t141, i3.i1.u17.t145, i3.i1.u17.t147, i4.t136, i4.t129, i4.u20.t130, i4.u20.t137, i4.u21.t134, i5.t124, i5.t117, i5.u25.t118, i5.u25.t125, i5.u26.t122, i6.i1.t105, i6.i1.t107, i6.i1.u31.t112, i6.i1.u34.t108, i6.i1.u35.t106, i7.i0.u32.t111, i7.i1.t86, i7.i1.u42.t90, i7.i1.u42.t92, i8.t103, i8.t96, i8.u37.t101, i8.u40.t97, i8.u40.t104, i9.t81, i9.t74, i9.u44.t79, i9.u47.t75, i9.u47.t82, i10.t69, i10.t62, i10.u52.t63, i10.u52.t70, i10.u53.t67, i11.i0.u58.t56, i11.i1.t31, i11.i1.u68.t35, i11.i1.u68.t37, i12.t48, i12.t41, i12.u63.t46, i12.u66.t42, i12.u66.t49, i13.t26, i13.t19, i13.u70.t24, i13.u73.t20, i13.u73.t27, i14.t14, i14.t7, i14.u78.t8, i14.u78.t15, i14.u79.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/122/76/198
Computing Next relation with stutter on 416 deadlock states
[2020-05-27 11:33:28] [INFO ] Computation of co-enabling matrix(94/198) took 1845 ms. Total solver calls (SAT/UNSAT): 1447(7/1440)
[2020-05-27 11:33:29] [INFO ] Computation of Finished co-enabling matrix. took 3682 ms. Total solver calls (SAT/UNSAT): 2286(21/2265)
[2020-05-27 11:33:29] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2020-05-27 11:33:29] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:33:29] [INFO ] Built C files in 5285ms 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 2258 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (X([]((LTLAP0==true))))U((LTLAP1==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([]((LTLAP0==true))))U((LTLAP1==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([]((LTLAP0==true))))U((LTLAP1==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)
159 unique states visited
159 strongly connected components in search stack
159 transitions explored
159 items max in DFS search stack
1070 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,10.7287,174000,1,0,327185,432,2552,558538,233,1534,442970
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!((X("((i7.i0.u32.p90==1)&&(i7.i0.u32.p92==1))"))U("((((i8.u37.p102==1)||(i12.u64.p173==1))&&(i7.i0.u32.p90==1))&&(i7.i0.u32.p92==1))")))&&(!(G("(i12.u64.p173!=1)")))))
Formula 1 simplified : !(!(X"((i7.i0.u32.p90==1)&&(i7.i0.u32.p92==1))" U "((((i8.u37.p102==1)||(i12.u64.p173==1))&&(i7.i0.u32.p90==1))&&(i7.i0.u32.p92==1))") & !G"(i12.u64.p173!=1)")
Computing Next relation with stutter on 416 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
154 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,12.2663,212012,1,0,394750,458,2623,681162,234,1619,556380
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((G((X(G(F(("(i7.i1.u42.p116==1)")U("(((i1.i0.u8.p26==1)&&(i2.u10.p39==1))&&(i5.u26.p73==1))")))))||("(i9.u48.p132==1)")))&&("(i7.i1.u42.p116!=1)"))))
Formula 2 simplified : !F("(i7.i1.u42.p116!=1)" & G("(i9.u48.p132==1)" | XGF("(i7.i1.u42.p116==1)" U "(((i1.i0.u8.p26==1)&&(i2.u10.p39==1))&&(i5.u26.p73==1))")))
Computing Next relation with stutter on 416 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
55 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,12.8435,223748,1,0,421652,458,2791,705057,234,1621,601628
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((X(("(i12.u66.p175==1)")U("((i6.i1.u30.p80==1)&&(i0.i1.u61.p166==1))")))U(F(X("(i10.u52.p141==1)"))))))
Formula 3 simplified : !G(X("(i12.u66.p175==1)" U "((i6.i1.u30.p80==1)&&(i0.i1.u61.p166==1))") U FX"(i10.u52.p141==1)")
Computing Next relation with stutter on 416 deadlock states
64 unique states visited
64 strongly connected components in search stack
65 transitions explored
64 items max in DFS search stack
25856 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,271.404,2202572,1,0,3.21177e+06,466,1417,5.74256e+06,117,1782,1167549
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(!(F(G(((X("(i8.u40.p100==1)"))U("(i12.u66.p176==1)"))&&(G("(i13.u71.p195==1)"))))))))
Formula 4 simplified : !X!FG((X"(i8.u40.p100==1)" U "(i12.u66.p176==1)") & G"(i13.u71.p195==1)")
Computing Next relation with stutter on 416 deadlock states
399 unique states visited
399 strongly connected components in search stack
400 transitions explored
399 items max in DFS search stack
18596 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,457.356,2545056,1,0,4.11061e+06,532,1651,7.66054e+06,127,2177,3769578
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(G(F((!(F(X("(i13.u74.p190==1)"))))||(!(G(F("(i13.u74.p190==1)"))))))))))
Formula 5 simplified : !GXGF(!FX"(i13.u74.p190==1)" | !GF"(i13.u74.p190==1)")
Computing Next relation with stutter on 416 deadlock states
21257 unique states visited
0 strongly connected components in search stack
23674 transitions explored
63 items max in DFS search stack
5245 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,509.807,2542684,1,0,4.11065e+06,532,1447,7.66057e+06,118,2177,3162402
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-003B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X("(i10.u51.p139==1)")))||(F((G("(i11.i0.u59.p157==1)"))&&(F("(i11.i0.u59.p157==1)"))))))
Formula 6 simplified : !(!X"(i10.u51.p139==1)" | F(G"(i11.i0.u59.p157==1)" & F"(i11.i0.u59.p157==1)"))
Computing Next relation with stutter on 416 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
14 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,509.957,2542684,1,0,4.11065e+06,532,1591,7.66057e+06,125,2177,3179266
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-003B-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X((X("(i3.i1.u17.p47!=1)"))||(F((X(X(F("(((i6.i1.u35.p98==1)&&(i9.u44.p130==1))&&(i10.u53.p142==1))"))))&&("(i6.i1.u34.p94==1)")))))))
Formula 7 simplified : X(X"(i3.i1.u17.p47!=1)" | F("(i6.i1.u34.p94==1)" & XXF"(((i6.i1.u35.p98==1)&&(i9.u44.p130==1))&&(i10.u53.p142==1))"))
Computing Next relation with stutter on 416 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
58 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,510.543,2542684,1,0,4.11065e+06,532,1631,7.66057e+06,125,2177,3307825
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((!(("(i9.u46.p123==1)")U("(i4.u22.p63==1)")))&&("(i8.u37.p102!=1)"))))
Formula 8 simplified : !X("(i8.u37.p102!=1)" & !("(i9.u46.p123==1)" U "(i4.u22.p63==1)"))
Computing Next relation with stutter on 416 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,510.544,2542684,1,0,4.11065e+06,532,1656,7.66057e+06,125,2177,3307881
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-003B-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(F(!(G((X("(i0.i0.u55.p147==1)"))||("(i3.i1.u17.p47==1)"))))))U(X((F("(i2.u12.p32==1)"))&&(F("((i6.i1.u31.p85==1)&&(i7.i1.u42.p118==1))"))))))
Formula 9 simplified : !(XF!G("(i3.i1.u17.p47==1)" | X"(i0.i0.u55.p147==1)") U X(F"(i2.u12.p32==1)" & F"((i6.i1.u31.p85==1)&&(i7.i1.u42.p118==1))"))
Computing Next relation with stutter on 416 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
426 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,514.811,2542812,1,0,4.11065e+06,532,1776,7.66057e+06,127,2177,3856377
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((G(("(i10.u52.p141==1)")U(!(F(!(X("(i12.u63.p171==1)")))))))U(X(F("(i6.i1.u30.p81==1)"))))))
Formula 10 simplified : !F(G("(i10.u52.p141==1)" U !F!X"(i12.u63.p171==1)") U XF"(i6.i1.u30.p81==1)")
Computing Next relation with stutter on 416 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
9 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,514.902,2542812,1,0,4.11065e+06,532,1794,7.66057e+06,127,2177,3879466
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(G("(i12.u65.p170==1)"))))
Formula 11 simplified : !XG"(i12.u65.p170==1)"
Computing Next relation with stutter on 416 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,514.905,2542812,1,0,4.11065e+06,532,1811,7.66057e+06,127,2177,3879629
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(G(X((X("(i3.i1.u17.p43==1)"))U(X("(i2.u13.p38==1)")))))))
Formula 12 simplified : GX(X"(i3.i1.u17.p43==1)" U X"(i2.u13.p38==1)")
Computing Next relation with stutter on 416 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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,514.906,2542812,1,0,4.11065e+06,532,1839,7.66057e+06,128,2177,3879684
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-003B-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!(G(!(X(X((X(G(X(("(i2.u13.p38==1)")U(F(X("(i2.u13.p38==1)")))))))&&("(i9.u46.p127==1)"))))))))
Formula 13 simplified : G!XX("(i9.u46.p127==1)" & XGX("(i2.u13.p38==1)" U FX"(i2.u13.p38==1)"))
Computing Next relation with stutter on 416 deadlock states
62 unique states visited
62 strongly connected components in search stack
62 transitions explored
62 items max in DFS search stack
225 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,517.159,2542812,1,0,4.11065e+06,532,1872,7.66057e+06,128,2177,4099655
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((G(X(G((((G(X(G("((i8.u38.p103==1)&&(i0.i1.u60.p162==1))"))))&&("(i8.u38.p103==1)"))&&("(i0.i1.u60.p162==1)"))&&("(i14.u77.p208==1)")))))||(F("((i1.i2.u5.p14==1)&&(i5.u24.p68==1))")))))
Formula 14 simplified : !X(GXG("(i0.i1.u60.p162==1)" & "(i8.u38.p103==1)" & "(i14.u77.p208==1)" & GXG"((i8.u38.p103==1)&&(i0.i1.u60.p162==1))") | F"((i1.i2.u5.p14==1)&&(i5.u24.p68==1))")
Computing Next relation with stutter on 416 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
209 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,519.244,2542944,1,0,4.11065e+06,532,1952,7.66057e+06,128,2177,4482625
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X(F((!(X("((i7.i0.u32.p86!=1)||(i7.i1.u41.p114!=1))")))&&("((i7.i0.u32.p86!=1)||(i7.i1.u41.p114!=1))"))))&&(F("(i5.u27.p64==1)"))))
Formula 15 simplified : !(XF("((i7.i0.u32.p86!=1)||(i7.i1.u41.p114!=1))" & !X"((i7.i0.u32.p86!=1)||(i7.i1.u41.p114!=1))") & F"(i5.u27.p64==1)")
Computing Next relation with stutter on 416 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
36 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,519.604,2542944,1,0,4.11065e+06,532,2029,7.66057e+06,128,2177,4551452
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590579733021

--------------------
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="ShieldIIPt-PT-003B"
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 ShieldIIPt-PT-003B, 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 r210-tajo-159033475400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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