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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.560 732660.00 770925.00 333.30 TFFFFFTFFFFFFFTF 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-158922814600610.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-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814600610
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.8K Mar 31 06:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 06:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 29 23:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 23:11 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.4K 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 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 07:35 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 54K 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-07b-00
FORMULA_NAME DiscoveryGPU-PT-07b-01
FORMULA_NAME DiscoveryGPU-PT-07b-02
FORMULA_NAME DiscoveryGPU-PT-07b-03
FORMULA_NAME DiscoveryGPU-PT-07b-04
FORMULA_NAME DiscoveryGPU-PT-07b-05
FORMULA_NAME DiscoveryGPU-PT-07b-06
FORMULA_NAME DiscoveryGPU-PT-07b-07
FORMULA_NAME DiscoveryGPU-PT-07b-08
FORMULA_NAME DiscoveryGPU-PT-07b-09
FORMULA_NAME DiscoveryGPU-PT-07b-10
FORMULA_NAME DiscoveryGPU-PT-07b-11
FORMULA_NAME DiscoveryGPU-PT-07b-12
FORMULA_NAME DiscoveryGPU-PT-07b-13
FORMULA_NAME DiscoveryGPU-PT-07b-14
FORMULA_NAME DiscoveryGPU-PT-07b-15

=== Now, execution of the tool begins

BK_START 1590129514871

[2020-05-22 06:38:36] [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:38:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:38:36] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-05-22 06:38:36] [INFO ] Transformed 212 places.
[2020-05-22 06:38:36] [INFO ] Transformed 224 transitions.
[2020-05-22 06:38:36] [INFO ] Found NUPN structural information;
[2020-05-22 06:38:36] [INFO ] Parsed PT model containing 212 places and 224 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 20521 steps, including 89 resets, run visited all 45 properties in 57 ms. (steps per millisecond=360 )
[2020-05-22 06:38:37] [INFO ] Flatten gal took : 44 ms
[2020-05-22 06:38:37] [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:38:37] [INFO ] Applying decomposition
[2020-05-22 06:38:37] [INFO ] Flatten gal took : 17 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/graph11482549867393713323.txt, -o, /tmp/graph11482549867393713323.bin, -w, /tmp/graph11482549867393713323.weights], workingDir=null]
[2020-05-22 06:38:37] [INFO ] Input system was already deterministic with 224 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph11482549867393713323.bin, -l, -1, -v, -w, /tmp/graph11482549867393713323.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:38:37] [INFO ] Decomposing Gal with order
[2020-05-22 06:38:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:38:37] [INFO ] Removed a total of 58 redundant transitions.
[2020-05-22 06:38:37] [INFO ] Flatten gal took : 46 ms
[2020-05-22 06:38:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-22 06:38:37] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
[2020-05-22 06:38:37] [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]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 224 rows 212 cols
[2020-05-22 06:38:37] [INFO ] Computed 9 place invariants in 10 ms
inv : p0 + p1 + p2 + p3 + p4 + p5 + p61 + p62 + 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 = 1
inv : p0 + p1 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 = 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 = 1
inv : p0 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 = 1
inv : p0 + p196 + p206 + p207 + p208 + p209 + p210 + p211 = 1
inv : p0 + p1 + p2 + p3 + p4 + p88 + p89 + 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 = 1
inv : p0 + p1 + p2 + p142 + p143 + 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 = 1
inv : p0 + p1 + p2 + p3 + p115 + p116 + 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 = 1
Total of 9 invariants.
[2020-05-22 06:38:37] [INFO ] Computed 9 place invariants in 12 ms

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(X(!(("((i16.i0.u45.p128==1)&&(i23.u74.p203==1))")U("(i14.u44.p138==1)"))))))
Formula 0 simplified : !XX!("((i16.i0.u45.p128==1)&&(i23.u74.p203==1))" U "(i14.u44.p138==1)")
built 58 ordering constraints for composite.
built 8 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 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.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 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 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 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:38:38] [INFO ] Proved 212 variables to be positive in 588 ms
[2020-05-22 06:38:38] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2020-05-22 06:38:38] [INFO ] Computation of disable matrix completed :0/224 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:38:38] [INFO ] Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:38:38] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2020-05-22 06:38:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:38:41] [INFO ] Computing symmetric co enabling matrix : 224 transitions.
[2020-05-22 06:38:41] [INFO ] Computation of co-enabling matrix(0/224) took 117 ms. Total solver calls (SAT/UNSAT): 223(0/223)
Reverse transition relation is NOT exact ! Due to transitions i2.u5.t140, i2.u5.t142, i3.i0.u8.t136, i3.i0.u8.t144, i4.u3.t130, i4.u3.t146, i5.u14.t122, i5.u14.t124, i6.i0.u17.t118, i6.i0.u17.t126, i7.u21.t112, i7.u21.t128, i8.i0.u23.t99, i8.i0.u23.t107, i9.u25.t103, i9.u25.t105, i10.u31.t93, i10.u31.t109, i11.u33.t74, i11.u33.t90, i12.u35.t84, i12.u35.t86, i13.i0.u38.t80, i13.i0.u38.t88, i14.u44.t55, i14.u44.t71, i15.t67, i15.u47.t65, i16.i0.u45.t61, i16.i0.u45.t69, i17.u57.t46, i17.u57.t48, i18.i0.u55.t42, i18.i0.u55.t50, i19.u54.t36, i19.u54.t52, i20.u66.t27, i20.u66.t29, i21.i0.u69.t23, i21.i0.u69.t31, i22.u64.t17, i22.u64.t33, i23.t9, i23.u74.t11, i23.u74.t12, i23.u74.t14, i24.t3, i24.u76.t4, i24.u76.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/175/49/224
[2020-05-22 06:38:44] [INFO ] Computation of co-enabling matrix(87/224) took 3139 ms. Total solver calls (SAT/UNSAT): 2798(16/2782)
Computing Next relation with stutter on 128 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
708 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,7.11096,177444,1,0,358980,366,1981,470537,225,1354,1270127
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07b-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X(!(X(X(((X(("((i6.i0.u16.p44==1)&&(i24.u76.p210==1))")U("(i22.u64.p192==1)")))||(G("(i8.i1.u29.p80!=1)")))||("(i3.i0.u7.p18==1)"))))))))
Formula 1 simplified : X!XX("(i3.i0.u7.p18==1)" | X("((i6.i0.u16.p44==1)&&(i24.u76.p210==1))" U "(i22.u64.p192==1)") | G"(i8.i1.u29.p80!=1)")
Computing Next relation with stutter on 128 deadlock states
[2020-05-22 06:38:47] [INFO ] Computation of co-enabling matrix(143/224) took 6146 ms. Total solver calls (SAT/UNSAT): 3997(28/3969)
[2020-05-22 06:38:50] [INFO ] Computation of co-enabling matrix(208/224) took 9165 ms. Total solver calls (SAT/UNSAT): 5354(973/4381)
[2020-05-22 06:38:50] [INFO ] Computation of Finished co-enabling matrix. took 9572 ms. Total solver calls (SAT/UNSAT): 5363(973/4390)
[2020-05-22 06:38:50] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2020-05-22 06:38:50] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:38:51] [INFO ] Built C files in 13759ms 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 2579 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 69 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X(!( X(X(( ( X(((LTLAP2==true))U((LTLAP3==true)))) || ( []((LTLAP4==true))) ) || ( (LTLAP5==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(( ( X(((LTLAP2==true))U((LTLAP3==true)))) || ( []((LTLAP4==true))) ) || ( (LTLAP5==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(( ( X(((LTLAP2==true))U((LTLAP3==true)))) || ( []((LTLAP4==true))) ) || ( (LTLAP5==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)
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
1267 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,19.7739,474328,1,0,990672,463,2526,1.31143e+06,244,2124,2491058
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(F((F(G(X("(i7.u21.p57==1)"))))||(X((G("(i12.u34.p93==1)"))&&("(i4.u3.p8==1)"))))))))
Formula 2 simplified : !F!F(FGX"(i7.u21.p57==1)" | X("(i4.u3.p8==1)" & G"(i12.u34.p93==1)"))
Computing Next relation with stutter on 128 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 items max in DFS search stack
710 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.8772,635616,1,0,1.32288e+06,464,2615,1.82198e+06,244,2137,3216069
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((!(G("(i23.u74.p200!=1)")))||("(i4.u3.p32!=1)"))U(!(F(G("((i4.u3.p32==1)||((i1.u12.p33==1)&&(i23.u74.p203==1)))"))))))
Formula 3 simplified : !(("(i4.u3.p32!=1)" | !G"(i23.u74.p200!=1)") U !FG"((i4.u3.p32==1)||((i1.u12.p33==1)&&(i23.u74.p203==1)))")
Computing Next relation with stutter on 128 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 items max in DFS search stack
2683 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.7565,1307388,1,0,2.66797e+06,475,2704,3.75901e+06,244,2339,5290842
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(X(((G((F("(i7.u21.p57==1)"))&&("(i19.u62.p164==1)")))||(X("(i7.u21.p57==1)")))&&("(i20.u65.p174==1)"))))||(X("(i12.u35.p91==1)"))))
Formula 4 simplified : !(FX("(i20.u65.p174==1)" & (G("(i19.u62.p164==1)" & F"(i7.u21.p57==1)") | X"(i7.u21.p57==1)")) | X"(i12.u35.p91==1)")
Computing Next relation with stutter on 128 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
329 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,57.0497,1415680,1,0,2.89265e+06,483,2799,4.08423e+06,245,2550,5687866
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((!(X(F("((i19.u62.p162==1)&&(i23.u74.p203==1))"))))&&(!(X(G(F("(i16.i1.u51.p134!=1)"))))))))
Formula 5 simplified : !F(!XF"((i19.u62.p162==1)&&(i23.u74.p203==1))" & !XGF"(i16.i1.u51.p134!=1)")
Computing Next relation with stutter on 128 deadlock states
22855 unique states visited
130 strongly connected components in search stack
31609 transitions explored
149 items max in DFS search stack
59421 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,651.267,3940176,1,0,6.82256e+06,531,1316,1.49411e+07,144,3107,17810771
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((F(G((X("(i6.i1.u19.p52!=1)"))||("((((i18.i0.u59.p152!=1)||(i24.u76.p210!=1))&&(i4.u11.p28==1))&&(i24.u76.p210==1))"))))||(X("((i4.u11.p28!=1)||(i24.u76.p210!=1))")))))
Formula 6 simplified : !F(FG("((((i18.i0.u59.p152!=1)||(i24.u76.p210!=1))&&(i4.u11.p28==1))&&(i24.u76.p210==1))" | X"(i6.i1.u19.p52!=1)") | X"((i4.u11.p28!=1)||(i24.u76.p210!=1))")
Computing Next relation with stutter on 128 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
89 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,652.22,3940176,1,0,6.88412e+06,531,1566,1.49411e+07,155,3107,17912604
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07b-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((((G("((i11.u41.p109==1)&&(i24.u76.p210==1))"))&&("(i4.u3.p30==1)"))&&("(i9.u25.p67==1)"))&&("(i23.u74.p203==1)"))))
Formula 7 simplified : !X("(i4.u3.p30==1)" & "(i9.u25.p67==1)" & "(i23.u74.p203==1)" & G"((i11.u41.p109==1)&&(i24.u76.p210==1))")
Computing Next relation with stutter on 128 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
286 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,655.078,3940176,1,0,7.06428e+06,531,1609,1.49411e+07,156,3107,18380224
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((!(G(F((F("((i12.u36.p96!=1)||(i24.u76.p210!=1))"))&&("(i6.i0.u17.p46==1)")))))&&(!(X(F("(i6.i0.u17.p46==1)")))))))
Formula 8 simplified : !G(!GF("(i6.i0.u17.p46==1)" & F"((i12.u36.p96!=1)||(i24.u76.p210!=1))") & !XF"(i6.i0.u17.p46==1)")
Computing Next relation with stutter on 128 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
591 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,660.986,4086668,1,0,7.42426e+06,531,1698,1.49411e+07,156,3107,19190638
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(X(G(("(i3.i0.u8.p19==1)")&&(((!(("((i4.u11.p28==1)&&(i24.u76.p210==1))")U(X("(i1.u32.p61==1)"))))||("(i4.u11.p28!=1)"))||("(i24.u76.p210!=1)"))))))))
Formula 9 simplified : !GXXG("(i3.i0.u8.p19==1)" & ("(i4.u11.p28!=1)" | "(i24.u76.p210!=1)" | !("((i4.u11.p28==1)&&(i24.u76.p210==1))" U X"(i1.u32.p61==1)")))
Computing Next relation with stutter on 128 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,661.003,4086928,1,0,7.42458e+06,531,1747,1.49411e+07,156,3107,19191888
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((F("(((i12.u35.p94==1)&&(i23.u74.p203==1))&&(i18.i1.u60.p158==1))"))||(F((G("(((i12.u35.p94==1)&&(i23.u74.p203==1))&&(i18.i1.u60.p158==1))"))&&(!(G("(i18.i1.u60.p158==1)"))))))))
Formula 10 simplified : !F(F"(((i12.u35.p94==1)&&(i23.u74.p203==1))&&(i18.i1.u60.p158==1))" | F(G"(((i12.u35.p94==1)&&(i23.u74.p203==1))&&(i18.i1.u60.p158==1))" & !G"(i18.i1.u60.p158==1)"))
Computing Next relation with stutter on 128 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4464 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,705.639,4496920,1,0,8.27558e+06,531,1149,1.49724e+07,134,3367,315644
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(((X(X("(i21.i1.u71.p187==1)")))||("(i23.u74.p200==1)"))U(X("((i2.u6.p16==1)&&(i23.u74.p200==1))")))))
Formula 11 simplified : !X(("(i23.u74.p200==1)" | XX"(i21.i1.u71.p187==1)") U X"((i2.u6.p16==1)&&(i23.u74.p200==1))")
Computing Next relation with stutter on 128 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1064 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,716.286,4496920,1,0,8.27558e+06,531,1604,1.49724e+07,153,3367,3205134
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(X(G("(i13.i0.u38.p90==1)"))))))
Formula 12 simplified : !GFXG"(i13.i0.u38.p90==1)"
Computing Next relation with stutter on 128 deadlock states
45 unique states visited
45 strongly connected components in search stack
46 transitions explored
45 items max in DFS search stack
45 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,716.74,4496920,1,0,8.27558e+06,531,1653,1.49724e+07,155,3367,3281532
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(!(G(X(X(X("(i9.u25.p64==1)")))))))))
Formula 13 simplified : !FG!GXXX"(i9.u25.p64==1)"
Computing Next relation with stutter on 128 deadlock states
47 unique states visited
47 strongly connected components in search stack
48 transitions explored
47 items max in DFS search stack
160 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,718.342,4496920,1,0,8.27558e+06,531,1716,1.49724e+07,155,3367,3509545
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((((F("(i6.i1.u19.p53==1)"))U(X(F(!(X(G(X("(i6.i0.u17.p36==1)"))))))))||(X(G("(i21.i0.u68.p180==1)")))))
Formula 14 simplified : !((F"(i6.i1.u19.p53==1)" U XF!XGX"(i6.i0.u17.p36==1)") | XG"(i21.i0.u68.p180==1)")
Computing Next relation with stutter on 128 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,718.343,4496920,1,0,8.27558e+06,531,1742,1.49724e+07,155,3367,3509603
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07b-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X((F(X("((i3.i0.u7.p17==1)&&(i24.u76.p210==1))")))U("((i3.i0.u7.p17==1)&&(i24.u76.p210==1))"))))
Formula 15 simplified : !X(FX"((i3.i0.u7.p17==1)&&(i24.u76.p210==1))" U "((i3.i0.u7.p17==1)&&(i24.u76.p210==1))")
Computing Next relation with stutter on 128 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
417 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,722.513,4496920,1,0,8.27558e+06,531,1846,1.49724e+07,155,3367,4665038
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-07b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590130247531

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

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