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.r066-tajo-158922814600658.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 DiscoveryGPU-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600658
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 31 07:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 07:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 23:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 27 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 27 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 75K Mar 24 05:37 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 DiscoveryGPU-PT-10b-00
FORMULA_NAME DiscoveryGPU-PT-10b-01
FORMULA_NAME DiscoveryGPU-PT-10b-02
FORMULA_NAME DiscoveryGPU-PT-10b-03
FORMULA_NAME DiscoveryGPU-PT-10b-04
FORMULA_NAME DiscoveryGPU-PT-10b-05
FORMULA_NAME DiscoveryGPU-PT-10b-06
FORMULA_NAME DiscoveryGPU-PT-10b-07
FORMULA_NAME DiscoveryGPU-PT-10b-08
FORMULA_NAME DiscoveryGPU-PT-10b-09
FORMULA_NAME DiscoveryGPU-PT-10b-10
FORMULA_NAME DiscoveryGPU-PT-10b-11
FORMULA_NAME DiscoveryGPU-PT-10b-12
FORMULA_NAME DiscoveryGPU-PT-10b-13
FORMULA_NAME DiscoveryGPU-PT-10b-14
FORMULA_NAME DiscoveryGPU-PT-10b-15

=== Now, execution of the tool begins

BK_START 1590130455343

[2020-05-22 06:54:17] [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-22 06:54:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:54:17] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2020-05-22 06:54:17] [INFO ] Transformed 296 places.
[2020-05-22 06:54:17] [INFO ] Transformed 314 transitions.
[2020-05-22 06:54:17] [INFO ] Found NUPN structural information;
[2020-05-22 06:54:17] [INFO ] Parsed PT model containing 296 places and 314 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 3460 steps, including 10 resets, run visited all 35 properties in 19 ms. (steps per millisecond=182 )
[2020-05-22 06:54:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 06:54:17] [INFO ] Flatten gal took : 54 ms
FORMULA DiscoveryGPU-PT-10b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:54:17] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:54:17] [INFO ] Applying decomposition
[2020-05-22 06:54:17] [INFO ] Flatten gal took : 21 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/graph13974232733077163476.txt, -o, /tmp/graph13974232733077163476.bin, -w, /tmp/graph13974232733077163476.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/graph13974232733077163476.bin, -l, -1, -v, -w, /tmp/graph13974232733077163476.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:54:17] [INFO ] Input system was already deterministic with 314 transitions.
[2020-05-22 06:54:17] [INFO ] Decomposing Gal with order
[2020-05-22 06:54:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:54:17] [INFO ] Removed a total of 85 redundant transitions.
[2020-05-22 06:54:17] [INFO ] Flatten gal took : 106 ms
[2020-05-22 06:54:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 314 rows 296 cols
[2020-05-22 06:54:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-22 06:54:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
[2020-05-22 06:54:17] [INFO ] Computed 12 place invariants in 13 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + 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 = 1
inv : p0 + p1 + p2 + p3 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 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 + p62 + p63 = 1
inv : p0 + p280 + p290 + p291 + p292 + p293 + p294 + p295 = 1
inv : p0 + p1 + p2 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 = 1
inv : p0 + p1 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 = 1
inv : p0 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 = 1
inv : p0 + p1 + p2 + p3 + p4 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 = 1
Total of 12 invariants.
[2020-05-22 06:54:17] [INFO ] Computed 12 place invariants in 18 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 15 LTL properties
Checking formula 0 : !((!((X(G(X(F(G(F("((i19.u77.p205==1)&&(u105.p287==1))")))))))U(X(F("((i19.u77.p205==1)&&(u105.p287==1))"))))))
Formula 0 simplified : XGXFGF"((i19.u77.p205==1)&&(u105.p287==1))" U XF"((i19.u77.p205==1)&&(u105.p287==1))"
built 71 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 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 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 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 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 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 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-22 06:54:18] [INFO ] Proved 296 variables to be positive in 384 ms
[2020-05-22 06:54:18] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2020-05-22 06:54:18] [INFO ] Computation of disable matrix completed :0/314 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:18] [INFO ] Computation of Complete disable matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:18] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2020-05-22 06:54:18] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:19] [INFO ] Computing symmetric co enabling matrix : 314 transitions.
[2020-05-22 06:54:21] [INFO ] Computation of co-enabling matrix(48/314) took 1637 ms. Total solver calls (SAT/UNSAT): 2302(8/2294)
[2020-05-22 06:54:24] [INFO ] Computation of co-enabling matrix(152/314) took 4648 ms. Total solver calls (SAT/UNSAT): 5191(29/5162)
Reverse transition relation is NOT exact ! Due to transitions t9, u105.t11, u105.t12, u105.t14, i1.i0.u4.t193, i1.i0.u4.t201, i1.i1.u6.t197, i1.i1.u6.t199, i2.i1.u12.t187, i2.i1.u12.t203, i3.i0.u16.t179, i3.i0.u16.t181, i3.i1.u19.t175, i3.i1.u19.t183, i4.i0.u14.t169, i4.i0.u14.t185, i5.i0.u25.t156, i5.i0.u25.t164, i5.i1.u27.t160, i5.i1.u27.t162, i6.i1.u24.t150, i6.i1.u24.t166, i7.u36.t141, i7.u36.t143, i8.i0.u34.t137, i8.i0.u34.t145, i9.u42.t131, i9.u42.t147, i10.u46.t122, i10.u46.t124, i11.i0.u49.t118, i11.i0.u49.t126, i12.u44.t112, i12.u44.t128, i13.i0.u55.t103, i13.i0.u55.t105, i13.i1.u58.t99, i13.i1.u58.t107, i14.i1.u62.t93, i14.i1.u62.t109, i15.u67.t84, i15.u67.t86, i16.i0.u65.t80, i16.i0.u65.t88, i17.u73.t74, i17.u73.t90, i18.u74.t55, i18.u74.t71, i19.u77.t65, i19.u77.t67, i20.i0.u75.t61, i20.i0.u75.t69, i21.i0.u86.t46, i21.i0.u86.t48, i21.i1.u89.t42, i21.i1.u89.t50, i22.i1.u93.t36, i22.i1.u93.t52, i24.i0.u97.t27, i24.i0.u97.t29, i24.i1.u95.t23, i24.i1.u95.t31, i25.i1.u103.t17, i25.i1.u103.t33, i27.t3, i27.u107.t4, i27.u107.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/247/67/314
Computing Next relation with stutter on 1024 deadlock states
[2020-05-22 06:54:27] [INFO ] Computation of co-enabling matrix(238/314) took 7671 ms. Total solver calls (SAT/UNSAT): 7166(707/6459)
[2020-05-22 06:54:29] [INFO ] Computation of Finished co-enabling matrix. took 9984 ms. Total solver calls (SAT/UNSAT): 8771(2065/6706)
[2020-05-22 06:54:29] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2020-05-22 06:54:29] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:29] [INFO ] Built C files in 12161ms 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 3719 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 75 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( (X([](X(<>([](<>((LTLAP0==true))))))))U(X(<>((LTLAP0==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(<>([](<>((LTLAP0==true))))))))U(X(<>((LTLAP0==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(<>([](<>((LTLAP0==true))))))))U(X(<>((LTLAP0==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)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2356 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,23.6112,683212,1,0,1.43166e+06,430,3270,1.98388e+06,237,2304,3254483
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(("(i11.i1.u51.p137==1)")U(((X(X("(i11.i1.u51.p137==1)")))&&((G("(i1.i0.u4.p22==1)"))U("(i23.i0.u1.p3==1)")))&&(F("((i18.u82.p219==1)&&(u105.p287==1))")))))))
Formula 1 simplified : !X!("(i11.i1.u51.p137==1)" U (XX"(i11.i1.u51.p137==1)" & (G"(i1.i0.u4.p22==1)" U "(i23.i0.u1.p3==1)") & F"((i18.u82.p219==1)&&(u105.p287==1))"))
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,23.6546,685788,1,0,1.43166e+06,430,3334,1.98388e+06,241,2304,3254589
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10b-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F(!(F((G(!(F((G(X(F("(i3.i1.u19.p39==1)"))))U("(i0.i1.u3.p9==1)")))))&&("(i3.i1.u19.p39==1)")))))))
Formula 2 simplified : !GF!F("(i3.i1.u19.p39==1)" & G!F(GXF"(i3.i1.u19.p39==1)" U "(i0.i1.u3.p9==1)"))
Computing Next relation with stutter on 1024 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
2996 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,53.6199,1600284,1,0,3.10742e+06,436,3476,5.59329e+06,242,2823,5766414
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G((F(!(X((X("(i15.u67.p179==1)"))||("((i11.i0.u48.p128==1)&&(i27.u107.p294==1))")))))||(F("(i21.i1.u89.p240==1)")))))))
Formula 3 simplified : !XFG(F!X("((i11.i0.u48.p128==1)&&(i27.u107.p294==1))" | X"(i15.u67.p179==1)") | F"(i21.i1.u89.p240==1)")
Computing Next relation with stutter on 1024 deadlock states
132 unique states visited
132 strongly connected components in search stack
133 transitions explored
132 items max in DFS search stack
19514 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,248.763,6525920,1,0,1.39481e+07,459,3606,1.77978e+07,243,3084,22045566
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F((!(G("(i4.i0.u22.p59==1)")))U((G("(i18.u74.p200==1)"))||("(i4.i0.u22.p59!=1)"))))))
Formula 4 simplified : !GF(!G"(i4.i0.u22.p59==1)" U ("(i4.i0.u22.p59!=1)" | G"(i18.u74.p200==1)"))
Computing Next relation with stutter on 1024 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
7812 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,326.877,6532276,1,0,1.39843e+07,459,1125,1.78568e+07,115,3084,281461
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F(G(("((i19.u77.p205!=1)||(u105.p287!=1))")U(G("(i15.u66.p177==1)")))))&&("(i15.u66.p177==1)"))))
Formula 5 simplified : !X("(i15.u66.p177==1)" & FG("((i19.u77.p205!=1)||(u105.p287!=1))" U G"(i15.u66.p177==1)"))
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
506 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,331.947,6532276,1,0,1.39843e+07,459,1931,1.78568e+07,151,3084,1175291
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((X(X((G("(i3.i0.u15.p42==1)"))&&("((i6.i0.u31.p83==1)||(i3.i0.u15.p42==1))"))))&&(X(F("(i4.i0.u14.p60==1)"))))))
Formula 6 simplified : !X(XX("((i6.i0.u31.p83==1)||(i3.i0.u15.p42==1))" & G"(i3.i0.u15.p42==1)") & XF"(i4.i0.u14.p60==1)")
Computing Next relation with stutter on 1024 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,331.953,6532276,1,0,1.39843e+07,459,1946,1.78568e+07,151,3084,1176347
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X((!(X(F(X((X(G("(i4.i0.u22.p59==1)")))U("(i21.i0.u87.p235==1)"))))))&&(G("(i4.i0.u14.p60==1)"))))))
Formula 7 simplified : !GX(!XFX(XG"(i4.i0.u22.p59==1)" U "(i21.i0.u87.p235==1)") & G"(i4.i0.u14.p60==1)")
Computing Next relation with stutter on 1024 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,331.955,6532276,1,0,1.39843e+07,459,1950,1.78568e+07,151,3084,1176411
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G("(i5.i0.u25.p76==1)"))))
Formula 8 simplified : !XG"(i5.i0.u25.p76==1)"
Computing Next relation with stutter on 1024 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,331.956,6532276,1,0,1.39843e+07,459,1966,1.78568e+07,151,3084,1176467
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(("(i5.i0.u25.p78!=1)")U("(i14.i1.u62.p168==1)")))U(F("(i14.i1.u62.p168==1)"))))
Formula 9 simplified : !(G("(i5.i0.u25.p78!=1)" U "(i14.i1.u62.p168==1)") U F"(i14.i1.u62.p168==1)")
Computing Next relation with stutter on 1024 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
128 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,333.242,6532276,1,0,1.39843e+07,459,2043,1.78568e+07,151,3084,1434133
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((F(X(F("(i1.i0.u4.p24==1)"))))||(F("((i5.i0.u29.p74==1)&&(i27.u107.p294==1))")))))
Formula 10 simplified : !X(FXF"(i1.i0.u4.p24==1)" | F"((i5.i0.u29.p74==1)&&(i27.u107.p294==1))")
Computing Next relation with stutter on 1024 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
516 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,338.397,6532276,1,0,1.39843e+07,459,2178,1.78568e+07,152,3084,2310907
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F((!(G(X(F("(i8.i0.u34.p103==1)")))))&&("(i22.i1.u93.p249==1)"))))
Formula 11 simplified : !F("(i22.i1.u93.p249==1)" & !GXF"(i8.i0.u34.p103==1)")
Computing Next relation with stutter on 1024 deadlock states
60 unique states visited
60 strongly connected components in search stack
60 transitions explored
60 items max in DFS search stack
601 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,344.411,6532276,1,0,1.39843e+07,459,2279,1.78568e+07,152,3084,3127956
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(((!(G("(i1.i0.u4.p12!=1)")))&&("(i1.i0.u4.p12!=1)"))||(((!(G("(i16.i1.u71.p191==1)")))&&(!(F("(i7.u36.p98==1)"))))&&("(i4.i0.u22.p59!=1)")))))
Formula 12 simplified : !G(("(i1.i0.u4.p12!=1)" & !G"(i1.i0.u4.p12!=1)") | ("(i4.i0.u22.p59!=1)" & !G"(i16.i1.u71.p191==1)" & !F"(i7.u36.p98==1)"))
Computing Next relation with stutter on 1024 deadlock states
60 unique states visited
60 strongly connected components in search stack
61 transitions explored
60 items max in DFS search stack
2929 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,373.712,6532276,1,0,1.39843e+07,459,2438,1.78568e+07,153,3084,7176111
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((!(F("(((i7.u37.p99==1)&&(i27.u107.p294==1))||(i20.i0.u75.p211==1))")))U((("((i0.i1.u43.p91==1)||(i4.i0.u22.p59==1))")U(X(X("((i7.u37.p99==1)&&(i27.u107.p294==1))"))))||("(i4.i0.u22.p59==1)"))))
Formula 13 simplified : !(!F"(((i7.u37.p99==1)&&(i27.u107.p294==1))||(i20.i0.u75.p211==1))" U ("(i4.i0.u22.p59==1)" | ("((i0.i1.u43.p91==1)||(i4.i0.u22.p59==1))" U XX"((i7.u37.p99==1)&&(i27.u107.p294==1))")))
Computing Next relation with stutter on 1024 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
860 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,382.32,6532276,1,0,1.39843e+07,459,2536,1.78568e+07,153,3084,8550544
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F("(i23.i1.u0.p280==1)")))
Formula 14 simplified : !F"(i23.i1.u0.p280==1)"
Computing Next relation with stutter on 1024 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,382.323,6532276,1,0,1.39843e+07,459,2572,1.78568e+07,153,3084,8550675
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10b-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590130858963

--------------------
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="DiscoveryGPU-PT-10b"
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 DiscoveryGPU-PT-10b, 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 r066-tajo-158922814600658"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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