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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.4K Mar 31 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 23:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 29 23:32 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.0K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 07:37 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 68K 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-09b-00
FORMULA_NAME DiscoveryGPU-PT-09b-01
FORMULA_NAME DiscoveryGPU-PT-09b-02
FORMULA_NAME DiscoveryGPU-PT-09b-03
FORMULA_NAME DiscoveryGPU-PT-09b-04
FORMULA_NAME DiscoveryGPU-PT-09b-05
FORMULA_NAME DiscoveryGPU-PT-09b-06
FORMULA_NAME DiscoveryGPU-PT-09b-07
FORMULA_NAME DiscoveryGPU-PT-09b-08
FORMULA_NAME DiscoveryGPU-PT-09b-09
FORMULA_NAME DiscoveryGPU-PT-09b-10
FORMULA_NAME DiscoveryGPU-PT-09b-11
FORMULA_NAME DiscoveryGPU-PT-09b-12
FORMULA_NAME DiscoveryGPU-PT-09b-13
FORMULA_NAME DiscoveryGPU-PT-09b-14
FORMULA_NAME DiscoveryGPU-PT-09b-15

=== Now, execution of the tool begins

BK_START 1590130117492

[2020-05-22 06:48:39] [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:48:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:48:39] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-05-22 06:48:39] [INFO ] Transformed 268 places.
[2020-05-22 06:48:39] [INFO ] Transformed 284 transitions.
[2020-05-22 06:48:39] [INFO ] Found NUPN structural information;
[2020-05-22 06:48:39] [INFO ] Parsed PT model containing 268 places and 284 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 342 resets, run finished after 206 ms. (steps per millisecond=485 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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]
// Phase 1: matrix 284 rows 268 cols
[2020-05-22 06:48:39] [INFO ] Computed 11 place invariants in 11 ms
[2020-05-22 06:48:39] [INFO ] [Real]Absence check using 11 positive place invariants in 37 ms returned sat
[2020-05-22 06:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:48:39] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-05-22 06:48:40] [INFO ] Deduced a trap composed of 18 places in 162 ms
[2020-05-22 06:48:40] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2020-05-22 06:48:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2020-05-22 06:48:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:48:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 391 ms returned sat
[2020-05-22 06:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 06:48:40] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-05-22 06:48:41] [INFO ] Deduced a trap composed of 18 places in 118 ms
[2020-05-22 06:48:41] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2020-05-22 06:48:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2020-05-22 06:48:41] [INFO ] Computed and/alt/rep : 283/683/283 causal constraints in 19 ms.
[2020-05-22 06:48:42] [INFO ] Added : 234 causal constraints over 47 iterations in 1115 ms. Result :sat
[2020-05-22 06:48:42] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 06:48:42] [INFO ] Flatten gal took : 66 ms
FORMULA DiscoveryGPU-PT-09b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:48:42] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:48:42] [INFO ] Applying decomposition
[2020-05-22 06:48:42] [INFO ] Flatten gal took : 16 ms
[2020-05-22 06:48:42] [INFO ] Input system was already deterministic with 284 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/graph9812730893627521191.txt, -o, /tmp/graph9812730893627521191.bin, -w, /tmp/graph9812730893627521191.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/graph9812730893627521191.bin, -l, -1, -v, -w, /tmp/graph9812730893627521191.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 284 rows 268 cols
[2020-05-22 06:48:42] [INFO ] Decomposing Gal with order
[2020-05-22 06:48:42] [INFO ] Computed 11 place invariants in 3 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p63 + 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 = 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 = 1
inv : p0 + p1 + p2 + p3 + p4 + p144 + 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 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + 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 + p62 = 1
inv : p0 + p252 + p262 + p263 + p264 + p265 + p266 + p267 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p90 + 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 = 1
inv : p0 + p1 + p2 + p3 + 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 + p196 + p197 = 1
inv : p0 + p1 + p2 + p198 + 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 = 1
inv : p0 + p1 + p225 + 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 = 1
inv : p0 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 = 1
Total of 11 invariants.
[2020-05-22 06:48:42] [INFO ] Computed 11 place invariants in 9 ms
[2020-05-22 06:48:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:48:42] [INFO ] Removed a total of 76 redundant transitions.
[2020-05-22 06:48:42] [INFO ] Flatten gal took : 98 ms
[2020-05-22 06:48:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-22 06:48:43] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-22 06:48:43] [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 13 LTL properties
Checking formula 0 : !(((F("(i0.u14.p36==1)"))&&(G("((i26.u93.p245!=1)||(u95.p259!=1))"))))
Formula 0 simplified : !(F"(i0.u14.p36==1)" & G"((i26.u93.p245!=1)||(u95.p259!=1))")
built 75 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 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 10 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 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 4 ordering constraints for composite.
built 6 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 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 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 5 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 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.
[2020-05-22 06:48:43] [INFO ] Proved 268 variables to be positive in 394 ms
[2020-05-22 06:48:43] [INFO ] Computing symmetric may disable matrix : 284 transitions.
[2020-05-22 06:48:43] [INFO ] Computation of disable matrix completed :0/284 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:48:43] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:48:43] [INFO ] Computing symmetric may enable matrix : 284 transitions.
[2020-05-22 06:48:43] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:48:44] [INFO ] Computing symmetric co enabling matrix : 284 transitions.
[2020-05-22 06:48:46] [INFO ] Computation of co-enabling matrix(52/284) took 1638 ms. Total solver calls (SAT/UNSAT): 2190(8/2182)
Reverse transition relation is NOT exact ! Due to transitions t9, u95.t11, u95.t12, u95.t14, i1.t180, i1.u6.t178, i2.i0.u4.t174, i2.i0.u4.t182, i3.u12.t168, i3.u12.t184, i4.u18.t160, i4.u18.t162, i5.i0.u16.t156, i5.i0.u16.t164, i6.u15.t150, i6.u15.t166, i7.u24.t131, i7.u24.t147, i8.u26.t141, i8.u26.t143, i9.i0.u29.t137, i9.i0.u29.t145, i10.i0.u34.t118, i10.i0.u34.t126, i11.u36.t122, i11.u36.t124, i12.u42.t112, i12.u42.t128, i13.u44.t93, i13.u44.t109, i14.u47.t103, i14.u47.t105, i15.i0.u45.t99, i15.i0.u45.t107, i16.i0.u56.t80, i16.i0.u56.t88, i17.u58.t84, i17.u58.t86, i18.u55.t74, i18.u55.t90, i19.i0.u64.t61, i19.i0.u64.t69, i20.u66.t65, i20.u66.t67, i21.u72.t55, i21.u72.t71, i22.u74.t36, i22.u74.t52, i23.u76.t46, i23.u76.t48, i24.i0.u79.t42, i24.i0.u79.t50, i26.u85.t17, i26.u85.t33, i27.u87.t27, i27.u87.t29, i28.i0.u90.t23, i28.i0.u90.t31, i30.t3, i30.u96.t4, i30.u96.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/223/61/284
Computing Next relation with stutter on 512 deadlock states
[2020-05-22 06:48:49] [INFO ] Computation of co-enabling matrix(143/284) took 4652 ms. Total solver calls (SAT/UNSAT): 4635(28/4607)
[2020-05-22 06:48:52] [INFO ] Computation of co-enabling matrix(223/284) took 7693 ms. Total solver calls (SAT/UNSAT): 6606(876/5730)
[2020-05-22 06:48:54] [INFO ] Computation of Finished co-enabling matrix. took 9896 ms. Total solver calls (SAT/UNSAT): 7560(1656/5904)
[2020-05-22 06:48:54] [INFO ] Computing Do-Not-Accords matrix : 284 transitions.
[2020-05-22 06:48:54] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:48:54] [INFO ] Built C files in 11947ms 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 2627 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ( <>((LTLAP0==true)) ) && ( []((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, -p, --pins-guards, --when, --ltl, ( <>((LTLAP0==true)) ) && ( []((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, -p, --pins-guards, --when, --ltl, ( <>((LTLAP0==true)) ) && ( []((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)
47 unique states visited
47 strongly connected components in search stack
48 transitions explored
47 items max in DFS search stack
1815 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,18.1875,596852,1,0,1.30994e+06,410,2964,1.70335e+06,243,2660,2708041
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(F(X(((G(F("(i11.u37.p99==1)")))&&("(i15.i0.u49.p127==1)"))&&("(i30.u96.p266==1)")))))||(X(F(G("((i0.u14.p62==1)&&(u95.p259==1))"))))))
Formula 1 simplified : !(XFX("(i15.i0.u49.p127==1)" & "(i30.u96.p266==1)" & GF"(i11.u37.p99==1)") | XFG"((i0.u14.p62==1)&&(u95.p259==1))")
Computing Next relation with stutter on 512 deadlock states
52 unique states visited
52 strongly connected components in search stack
52 transitions explored
52 items max in DFS search stack
363 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,21.823,722556,1,0,1.59001e+06,411,3150,2.04018e+06,248,2691,3247144
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(((X(!(G("(i15.i0.u45.p119==1)"))))U(F(X("(i18.u55.p167==1)"))))||(G("(i18.u55.p167!=1)")))))
Formula 2 simplified : !G((X!G"(i15.i0.u45.p119==1)" U FX"(i18.u55.p167==1)") | G"(i18.u55.p167!=1)")
Computing Next relation with stutter on 512 deadlock states
55 unique states visited
55 strongly connected components in search stack
56 transitions explored
55 items max in DFS search stack
358 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,25.4073,809504,1,0,1.76831e+06,412,3190,2.28328e+06,248,2694,3603315
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(G(("((i11.u37.p98==1)&&(i30.u96.p266==1))")U(((F(X("((i4.u19.p44!=1)||(i30.u96.p266!=1))")))&&("(i4.u19.p44==1)"))&&("(i30.u96.p266==1)")))))))
Formula 3 simplified : !GFG("((i11.u37.p98==1)&&(i30.u96.p266==1))" U ("(i4.u19.p44==1)" & "(i30.u96.p266==1)" & FX"((i4.u19.p44!=1)||(i30.u96.p266!=1))"))
Computing Next relation with stutter on 512 deadlock states
53 unique states visited
53 strongly connected components in search stack
53 transitions explored
53 items max in DFS search stack
66 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,26.0731,825668,1,0,1.80212e+06,416,3303,2.32493e+06,248,2706,3676485
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(G("(i28.i0.u89.p236==1)")))))
Formula 4 simplified : !FXG"(i28.i0.u89.p236==1)"
Computing Next relation with stutter on 512 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5106 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,77.1221,2101008,1,0,4.26047e+06,416,3324,6.01556e+06,248,2742,6784138
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((F("(i2.i1.u10.p27==1)"))U((!(F("(i2.i1.u10.p27==1)")))||("(i0.u14.p36==1)")))))
Formula 5 simplified : !X(F"(i2.i1.u10.p27==1)" U ("(i0.u14.p36==1)" | !F"(i2.i1.u10.p27==1)"))
Computing Next relation with stutter on 512 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
333 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,80.4549,2170164,1,0,4.41681e+06,416,3466,6.2471e+06,248,2742,7192182
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09b-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(!(F(((F((F("(i9.i0.u29.p75==1)"))||("((i3.u11.p30==1)&&(i30.u96.p266==1))")))U(X("(i9.i0.u29.p75==1)")))U("((i9.i0.u29.p75==1)&&(i15.i0.u45.p129==1))"))))))
Formula 6 simplified : !G!F((F("((i3.u11.p30==1)&&(i30.u96.p266==1))" | F"(i9.i0.u29.p75==1)") U X"(i9.i0.u29.p75==1)") U "((i9.i0.u29.p75==1)&&(i15.i0.u45.p129==1))")
Computing Next relation with stutter on 512 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3111 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,111.566,2290176,1,0,4.662e+06,416,1509,6.64129e+06,141,2753,36539
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!((F("(((i14.u47.p123==1)&&(u95.p259==1))||(i15.i0.u45.p129==1))"))U("((((i14.u47.p123==1)&&(u95.p259==1))&&(i5.i1.u22.p55==1))||((i14.u47.p123==1)&&(u95.p259==1)))"))))
Formula 7 simplified : F"(((i14.u47.p123==1)&&(u95.p259==1))||(i15.i0.u45.p129==1))" U "((((i14.u47.p123==1)&&(u95.p259==1))&&(i5.i1.u22.p55==1))||((i14.u47.p123==1)&&(u95.p259==1)))"
Computing Next relation with stutter on 512 deadlock states
102 unique states visited
102 strongly connected components in search stack
104 transitions explored
102 items max in DFS search stack
956 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,121.131,2290176,1,0,4.662e+06,416,1882,6.64129e+06,150,2753,2133343
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(i2.i0.u4.p11==1)")))
Formula 8 simplified : !F"(i2.i0.u4.p11==1)"
Computing Next relation with stutter on 512 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
218 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,123.314,2290176,1,0,4.662e+06,416,2016,6.64129e+06,152,2753,2642873
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(!(G("(i1.u6.p16==1)"))))))
Formula 9 simplified : X!G"(i1.u6.p16==1)"
Computing Next relation with stutter on 512 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
96 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,124.275,2290176,1,0,4.662e+06,416,2034,6.64129e+06,153,2753,2852987
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((G("(i30.u97.p267==1)"))U(F("(i30.u97.p267==1)")))||(G(F(!(G(!(G("((i25.i0.u54.p170==1)&&(u95.p259==1))")))))))))
Formula 10 simplified : !((G"(i30.u97.p267==1)" U F"(i30.u97.p267==1)") | GF!G!G"((i25.i0.u54.p170==1)&&(u95.p259==1))")
Computing Next relation with stutter on 512 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
234 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,126.621,2290176,1,0,4.662e+06,416,2075,6.64129e+06,153,2753,3090566
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((G("(i28.i0.u90.p237==1)"))||(X(((F("(i25.i0.u1.p4==1)"))&&("(i6.u15.p59==1)"))||("(i25.i0.u1.p4==1)"))))))
Formula 11 simplified : !X(G"(i28.i0.u90.p237==1)" | X("(i25.i0.u1.p4==1)" | ("(i6.u15.p59==1)" & F"(i25.i0.u1.p4==1)")))
Computing Next relation with stutter on 512 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,126.626,2290176,1,0,4.662e+06,416,2097,6.64129e+06,154,2753,3091250
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("((i1.u7.p17==1)&&(i30.u96.p266==1))")U(F((F("((i9.i1.u30.p78==1)&&(u95.p259==1))"))||("(i0.u14.p36==1)")))))
Formula 12 simplified : !("((i1.u7.p17==1)&&(i30.u96.p266==1))" U F("(i0.u14.p36==1)" | F"((i9.i1.u30.p78==1)&&(u95.p259==1))"))
Computing Next relation with stutter on 512 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
271 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,129.341,2290176,1,0,4.662e+06,416,2193,6.64129e+06,154,2753,3791794
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590130259890

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

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