fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r066-tajo-158922814600657
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DiscoveryGPU-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.450 2207930.00 2298608.00 705.80 FFFFFFFTFFTFFFTF normal

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-158922814600657.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600657
=====================================================================

--------------------
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 1590130451296

[2020-05-22 06:54:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 06:54:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:54:13] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-05-22 06:54:13] [INFO ] Transformed 296 places.
[2020-05-22 06:54:13] [INFO ] Transformed 314 transitions.
[2020-05-22 06:54:13] [INFO ] Found NUPN structural information;
[2020-05-22 06:54:13] [INFO ] Parsed PT model containing 296 places and 314 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2270 steps, including 7 resets, run visited all 29 properties in 30 ms. (steps per millisecond=75 )
[2020-05-22 06:54:14] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 06:54:14] [INFO ] Flatten gal took : 80 ms
FORMULA DiscoveryGPU-PT-10b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10b-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:54:14] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:54:14] [INFO ] Applying decomposition
[2020-05-22 06:54:14] [INFO ] Flatten gal took : 83 ms
[2020-05-22 06:54:14] [INFO ] Input system was already deterministic with 314 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/graph2347704441412946941.txt, -o, /tmp/graph2347704441412946941.bin, -w, /tmp/graph2347704441412946941.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/graph2347704441412946941.bin, -l, -1, -v, -w, /tmp/graph2347704441412946941.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:54:14] [INFO ] Decomposing Gal with order
[2020-05-22 06:54:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:54:14] [INFO ] Removed a total of 85 redundant transitions.
[2020-05-22 06:54:14] [INFO ] Flatten gal took : 84 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:14] [INFO ] Computed 12 place invariants in 12 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:14] [INFO ] Computed 12 place invariants in 13 ms
[2020-05-22 06:54:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2020-05-22 06:54:14] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-22 06:54:14] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((X(X(X(!(("((i8.i0.u29.p77==0)||(i26.u104.p288==1))")U(F("((i8.i0.u29.p77==0)||(i26.u104.p288==1))"))))))))
Formula 0 simplified : !XXX!("((i8.i0.u29.p77==0)||(i26.u104.p288==1))" U F"((i8.i0.u29.p77==0)||(i26.u104.p288==1))")
built 70 ordering constraints for composite.
built 6 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 5 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 8 ordering constraints for composite.
built 4 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 5 ordering constraints for composite.
built 3 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 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 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 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 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 6 ordering constraints for composite.
built 5 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 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 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 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.
[2020-05-22 06:54:15] [INFO ] Proved 296 variables to be positive in 405 ms
[2020-05-22 06:54:15] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2020-05-22 06:54:15] [INFO ] Computation of disable matrix completed :0/314 took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:15] [INFO ] Computation of Complete disable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:15] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2020-05-22 06:54:15] [INFO ] Computation of Complete enable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:16] [INFO ] Computing symmetric co enabling matrix : 314 transitions.
[2020-05-22 06:54:18] [INFO ] Computation of co-enabling matrix(72/314) took 2402 ms. Total solver calls (SAT/UNSAT): 3149(12/3137)
[2020-05-22 06:54:21] [INFO ] Computation of co-enabling matrix(166/314) took 5406 ms. Total solver calls (SAT/UNSAT): 5436(32/5404)
[2020-05-22 06:54:24] [INFO ] Computation of co-enabling matrix(236/314) took 8447 ms. Total solver calls (SAT/UNSAT): 7051(605/6446)
[2020-05-22 06:54:26] [INFO ] Computation of Finished co-enabling matrix. took 10648 ms. Total solver calls (SAT/UNSAT): 8771(2065/6706)
[2020-05-22 06:54:26] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2020-05-22 06:54:26] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:54:26] [INFO ] Built C files in 12282ms 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 3276 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 60 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(X(X(!( ((LTLAP0==true))U(<>((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(X(!( ((LTLAP0==true))U(<>((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(X(!( ((LTLAP0==true))U(<>((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)
Reverse transition relation is NOT exact ! Due to transitions i2.u8.t197, i2.u8.t199, i3.i0.u6.t193, i3.i0.u6.t201, i4.u5.t187, i4.u5.t203, i5.i0.u16.t175, i5.i0.u16.t183, i5.i1.u18.t179, i5.i1.u18.t181, i6.i1.u15.t169, i6.i1.u15.t185, i7.u26.t160, i7.u26.t162, i8.i0.u29.t156, i8.i0.u29.t164, i9.u33.t150, i9.u33.t166, i10.i0.u35.t137, i10.i0.u35.t145, i10.i1.u37.t141, i10.i1.u37.t143, i11.i0.u34.t131, i11.i0.u34.t147, i12.i0.u46.t122, i12.i0.u46.t124, i12.i1.u49.t118, i12.i1.u49.t126, i13.i0.u44.t112, i13.i0.u44.t128, i14.i0.u56.t103, i14.i0.u56.t105, i14.i1.u54.t99, i14.i1.u54.t107, i15.i1.u62.t93, i15.i1.u62.t109, i16.i0.u64.t80, i16.i0.u64.t88, i17.u66.t84, i17.u66.t86, i18.u72.t74, i18.u72.t90, i19.i0.u76.t61, i19.i0.u76.t69, i19.i1.u78.t65, i19.i1.u78.t67, i20.i0.u75.t55, i20.i0.u75.t71, i21.u87.t46, i21.u87.t48, i22.i0.u85.t42, i22.i0.u85.t50, i23.u84.t36, i23.u84.t52, i24.i0.u97.t27, i24.i0.u97.t29, i24.i1.u95.t23, i24.i1.u95.t31, i25.i0.u94.t17, i25.i0.u94.t33, i26.t9, i26.u105.t11, i26.u105.t12, i26.u105.t14, i27.t3, i27.u106.t4, i27.u106.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
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
4528 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,45.3285,1113628,1,0,2.40425e+06,428,3253,3.1639e+06,239,1920,6983553
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 : !((G(X((F((G("((i22.i1.u90.p241==0)||(i16.i0.u68.p183==1))"))&&("(i27.u106.p294==1)")))&&(G("((i23.u84.p250==0)||(i25.i0.u102.p275==1))"))))))
Formula 1 simplified : !GX(F("(i27.u106.p294==1)" & G"((i22.i1.u90.p241==0)||(i16.i0.u68.p183==1))") & G"((i23.u84.p250==0)||(i25.i0.u102.p275==1))")
Computing Next relation with stutter on 1024 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
3790 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,83.2273,2085128,1,0,4.28236e+06,460,3283,5.86798e+06,242,2153,9690122
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F((!(F(X((!(X("((i24.i1.u95.p255==0)||(i16.i0.u64.p184==1))")))&&("((i12.i0.u45.p122==0)||(i16.i1.u70.p191==1))")))))&&(F("((i25.i1.u100.p268==0)||(i10.i1.u36.p96==1))"))))))
Formula 2 simplified : F(!FX("((i12.i0.u45.p122==0)||(i16.i1.u70.p191==1))" & !X"((i24.i1.u95.p255==0)||(i16.i0.u64.p184==1))") & F"((i25.i1.u100.p268==0)||(i10.i1.u36.p96==1))")
Computing Next relation with stutter on 1024 deadlock states
144 unique states visited
144 strongly connected components in search stack
145 transitions explored
144 items max in DFS search stack
12972 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,212.947,4879236,1,0,9.33844e+06,486,3366,1.49201e+07,242,2514,20595897
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(!(F("((i19.i0.u76.p201==0)||(i16.i0.u64.p174==1))"))))))
Formula 3 simplified : !GF!F"((i19.i0.u76.p201==0)||(i16.i0.u64.p174==1))"
Computing Next relation with stutter on 1024 deadlock states
Detected timeout of ITS tools.
[2020-05-22 07:14:15] [INFO ] Applying decomposition
[2020-05-22 07:14:15] [INFO ] Flatten gal took : 25 ms
[2020-05-22 07:14:15] [INFO ] Decomposing Gal with order
[2020-05-22 07:14:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:14:15] [INFO ] Removed a total of 85 redundant transitions.
[2020-05-22 07:14:15] [INFO ] Flatten gal took : 17 ms
[2020-05-22 07:14:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 565 labels/synchronizations in 23 ms.
[2020-05-22 07:14:15] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-22 07:14:15] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !((G(F(!(F("((i0.i0.i0.u17.p201==0)||(i0.i0.i0.i0.u16.p174==1))"))))))
Formula 0 simplified : !GF!F"((i0.i0.i0.u17.p201==0)||(i0.i0.i0.i0.u16.p174==1))"
built 2 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u19.t17, i0.u19.t23, i0.u19.t27, i0.u19.t29, i0.u19.t31, i0.u19.t33, i0.i0.u18.t36, i0.i0.u18.t42, i0.i0.u18.t46, i0.i0.u18.t48, i0.i0.u18.t50, i0.i0.u18.t52, i0.i0.i0.u17.t55, i0.i0.i0.u17.t61, i0.i0.i0.u17.t65, i0.i0.i0.u17.t67, i0.i0.i0.u17.t69, i0.i0.i0.u17.t71, i0.i0.i0.i0.u16.t74, i0.i0.i0.i0.u16.t80, i0.i0.i0.i0.u16.t84, i0.i0.i0.i0.u16.t86, i0.i0.i0.i0.u16.t88, i0.i0.i0.i0.u16.t90, i0.i0.i0.i0.i0.u15.t93, i0.i0.i0.i0.i0.u15.t99, i0.i0.i0.i0.i0.u15.t103, i0.i0.i0.i0.i0.u15.t105, i0.i0.i0.i0.i0.u15.t107, i0.i0.i0.i0.i0.u15.t109, i0.i0.i0.i0.i0.i0.u14.t112, i0.i0.i0.i0.i0.i0.u14.t118, i0.i0.i0.i0.i0.i0.u14.t122, i0.i0.i0.i0.i0.i0.u14.t124, i0.i0.i0.i0.i0.i0.u14.t126, i0.i0.i0.i0.i0.i0.u14.t128, i0.i0.i0.i0.i0.i0.i0.u13.t131, i0.i0.i0.i0.i0.i0.i0.u13.t137, i0.i0.i0.i0.i0.i0.i0.u13.t141, i0.i0.i0.i0.i0.i0.i0.u13.t143, i0.i0.i0.i0.i0.i0.i0.u13.t145, i0.i0.i0.i0.i0.i0.i0.u13.t147, i0.i0.i0.i0.i0.i0.i0.i0.u12.t150, i0.i0.i0.i0.i0.i0.i0.i0.u12.t156, i0.i0.i0.i0.i0.i0.i0.i0.u12.t160, i0.i0.i0.i0.i0.i0.i0.i0.u12.t162, i0.i0.i0.i0.i0.i0.i0.i0.u12.t164, i0.i0.i0.i0.i0.i0.i0.i0.u12.t166, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t187, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t193, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t197, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t199, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t201, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t203, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t169, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t175, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t179, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t181, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t183, i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t185, i1.u21.t9, i1.u21.t11, i1.u21.t12, i1.u21.t14, i1.u22.t3, i1.u22.t4, i1.u22.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/167/67/234
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
24389 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,243.905,2203816,1,0,2.99437e+06,353065,564,9.53658e+06,409,2.40514e+06,413715
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((F(G("((i0.i0.i0.i0.i0.i0.i0.u13.p96==0)||(i0.i0.i0.i0.u16.p191==1))")))U(F(!(G(F("((i0.i0.i0.i0.i0.i0.i0.u13.p96==0)||(i0.i0.i0.i0.u16.p191==1))")))))))))
Formula 1 simplified : !FG(FG"((i0.i0.i0.i0.i0.i0.i0.u13.p96==0)||(i0.i0.i0.i0.u16.p191==1))" U F!GF"((i0.i0.i0.i0.i0.i0.i0.u13.p96==0)||(i0.i0.i0.i0.u16.p191==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
54521 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,789.123,2971452,1,0,3.81565e+06,422213,568,1.33133e+07,409,2.77084e+06,707825
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G((X((X(X("(((i0.i0.i0.i0.i0.i0.i0.u13.p94==0)||(i1.u22.p293==1))&&((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1)))")))&&("((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1))")))&&(F("((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1))"))))&&(X("((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1))"))))
Formula 2 simplified : !(G(X("((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1))" & XX"(((i0.i0.i0.i0.i0.i0.i0.u13.p94==0)||(i1.u22.p293==1))&&((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1)))") & F"((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==1))") & X"((i0.i0.i0.u17.p211==0)||(i0.i0.i0.u17.p217==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
15270 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,941.823,3273652,1,0,4.30716e+06,425148,730,1.45725e+07,472,3.05617e+06,583379
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((i0.i0.u18.p236==0)||(i0.i0.i0.i0.i0.u15.p145==1))")U("((i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p46==0)||(i0.i0.u18.p251==1))"))&&(X(F("(((i0.i0.i0.i0.u16.p193==0)||(i0.i0.i0.u17.p211==1))||((i0.i0.u18.p236!=0)&&(i0.i0.i0.i0.i0.u15.p145!=1)))")))))
Formula 3 simplified : !(("((i0.i0.u18.p236==0)||(i0.i0.i0.i0.i0.u15.p145==1))" U "((i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p46==0)||(i0.i0.u18.p251==1))") & XF"(((i0.i0.i0.i0.u16.p193==0)||(i0.i0.i0.u17.p211==1))||((i0.i0.u18.p236!=0)&&(i0.i0.i0.i0.i0.u15.p145!=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
10 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,941.924,3273776,1,0,4.30716e+06,425148,947,1.45725e+07,537,3.05617e+06,589094
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10b-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(X(F((!(F(G(F("((i0.i0.i0.i0.i0.i0.i0.i0.u12.p67==0)||(i0.u19.p265==1))")))))&&(!(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p37==0)||(i0.i0.i0.i0.i0.u15.p148==1))"))))))))
Formula 4 simplified : XF(!FGF"((i0.i0.i0.i0.i0.i0.i0.i0.u12.p67==0)||(i0.u19.p265==1))" & !F"((i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p37==0)||(i0.i0.i0.i0.i0.u15.p148==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
2655 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,968.471,3273908,1,0,4.30716e+06,425148,1000,1.45725e+07,539,3.22011e+06,1253507
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((("((i0.i0.i0.i0.i0.i0.i0.i0.u12.p72==0)||(i0.i0.i0.i0.u16.p177==1))")U("(i0.i0.i0.i0.i0.i0.i0.i0.u12.p69==1)"))&&(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p42==1)")))U((!(G(X(G("((i0.i0.i0.i0.i0.i0.i0.i0.u12.p72==0)||(i0.i0.i0.i0.u16.p177==1))")))))||(F("(i0.i0.i0.i0.i0.i0.u24.p6==1)")))))
Formula 5 simplified : !((("((i0.i0.i0.i0.i0.i0.i0.i0.u12.p72==0)||(i0.i0.i0.i0.u16.p177==1))" U "(i0.i0.i0.i0.i0.i0.i0.i0.u12.p69==1)") & F"(i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p42==1)") U (!GXG"((i0.i0.i0.i0.i0.i0.i0.i0.u12.p72==0)||(i0.i0.i0.i0.u16.p177==1))" | F"(i0.i0.i0.i0.i0.i0.u24.p6==1)"))
Computing Next relation with stutter on 1024 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
638 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,974.856,3274012,1,0,4.30716e+06,425148,1067,1.45725e+07,543,3.5662e+06,1311266
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-10b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590132659226

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-10b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-10b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814600657"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;