fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r081-smll-158922977700265
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.570 987871.00 1032796.00 1881.80 TFFFFTTFFFTFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r081-smll-158922977700265.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FlexibleBarrier-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977700265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.4K Apr 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 06:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 20:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 20:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 3 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 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 69K 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 FlexibleBarrier-PT-04b-00
FORMULA_NAME FlexibleBarrier-PT-04b-01
FORMULA_NAME FlexibleBarrier-PT-04b-02
FORMULA_NAME FlexibleBarrier-PT-04b-03
FORMULA_NAME FlexibleBarrier-PT-04b-04
FORMULA_NAME FlexibleBarrier-PT-04b-05
FORMULA_NAME FlexibleBarrier-PT-04b-06
FORMULA_NAME FlexibleBarrier-PT-04b-07
FORMULA_NAME FlexibleBarrier-PT-04b-08
FORMULA_NAME FlexibleBarrier-PT-04b-09
FORMULA_NAME FlexibleBarrier-PT-04b-10
FORMULA_NAME FlexibleBarrier-PT-04b-11
FORMULA_NAME FlexibleBarrier-PT-04b-12
FORMULA_NAME FlexibleBarrier-PT-04b-13
FORMULA_NAME FlexibleBarrier-PT-04b-14
FORMULA_NAME FlexibleBarrier-PT-04b-15

=== Now, execution of the tool begins

BK_START 1589640637972

[2020-05-16 14:50:40] [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-16 14:50:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 14:50:40] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2020-05-16 14:50:40] [INFO ] Transformed 268 places.
[2020-05-16 14:50:40] [INFO ] Transformed 305 transitions.
[2020-05-16 14:50:40] [INFO ] Found NUPN structural information;
[2020-05-16 14:50:40] [INFO ] Parsed PT model containing 268 places and 305 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 6943 steps, including 167 resets, run visited all 24 properties in 92 ms. (steps per millisecond=75 )
[2020-05-16 14:50:41] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 14:50:41] [INFO ] Flatten gal took : 89 ms
FORMULA FlexibleBarrier-PT-04b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 14:50:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-16 14:50:41] [INFO ] Flatten gal took : 32 ms
[2020-05-16 14:50:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-04b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 14:50:41] [INFO ] Applying decomposition
[2020-05-16 14:50:41] [INFO ] Flatten gal took : 33 ms
[2020-05-16 14:50:41] [INFO ] Input system was already deterministic with 305 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/graph7689775919440599663.txt, -o, /tmp/graph7689775919440599663.bin, -w, /tmp/graph7689775919440599663.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/graph7689775919440599663.bin, -l, -1, -v, -w, /tmp/graph7689775919440599663.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 14:50:41] [INFO ] Decomposing Gal with order
[2020-05-16 14:50:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 14:50:41] [INFO ] Removed a total of 85 redundant transitions.
[2020-05-16 14:50:41] [INFO ] Flatten gal took : 90 ms
[2020-05-16 14:50:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-16 14:50:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 12 ms
[2020-05-16 14:50:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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 10 LTL properties
Checking formula 0 : !((!(X("((i10.i2.u60.p168==0)||(i6.u22.p59==1))"))))
Formula 0 simplified : X"((i10.i2.u60.p168==0)||(i6.u22.p59==1))"
built 40 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 19 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 17 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 19 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 35 ordering constraints for composite.
built 13 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 305 rows 268 cols
[2020-05-16 14:50:42] [INFO ] Computed 6 place invariants in 19 ms
inv : p0 + p203 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 = 1
inv : p0 + p1 + p2 + p3 + p56 + p57 + p58 + p59 + p60 + 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 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 = 1
inv : p0 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + 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 + p252 + p253 + p254 + p255 = 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 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 = 1
inv : p0 + p1 + p2 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + 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 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 = 1
inv : p0 + p1 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + 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 + p196 + p197 + p198 + p199 + p200 + p201 + p202 = 1
Total of 6 invariants.
[2020-05-16 14:50:42] [INFO ] Computed 6 place invariants in 21 ms
[2020-05-16 14:50:42] [INFO ] Proved 268 variables to be positive in 550 ms
[2020-05-16 14:50:42] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2020-05-16 14:50:42] [INFO ] Computation of disable matrix completed :0/305 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:50:42] [INFO ] Computation of Complete disable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:50:42] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2020-05-16 14:50:42] [INFO ] Computation of Complete enable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:50:43] [INFO ] Computing symmetric co enabling matrix : 305 transitions.
[2020-05-16 14:50:45] [INFO ] Computation of co-enabling matrix(30/305) took 2101 ms. Total solver calls (SAT/UNSAT): 1902(61/1841)
[2020-05-16 14:50:48] [INFO ] Computation of co-enabling matrix(87/305) took 5119 ms. Total solver calls (SAT/UNSAT): 4517(129/4388)
[2020-05-16 14:50:51] [INFO ] Computation of co-enabling matrix(146/305) took 8127 ms. Total solver calls (SAT/UNSAT): 6984(177/6807)
[2020-05-16 14:50:54] [INFO ] Computation of co-enabling matrix(205/305) took 11159 ms. Total solver calls (SAT/UNSAT): 9503(197/9306)
[2020-05-16 14:50:57] [INFO ] Computation of co-enabling matrix(263/305) took 14187 ms. Total solver calls (SAT/UNSAT): 11683(301/11382)
[2020-05-16 14:50:59] [INFO ] Computation of Finished co-enabling matrix. took 15925 ms. Total solver calls (SAT/UNSAT): 12215(343/11872)
[2020-05-16 14:50:59] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2020-05-16 14:50:59] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:50:59] [INFO ] Built C files in 18159ms 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 5146 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X((LTLAP0==true))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( X((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((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 t15, t42, t62, t113, t162, t210, u72.t60, u72.t63, u76.t40, u76.t43, i1.i0.t204, i1.i0.u8.t219, i1.i0.u11.t218, i1.i0.u11.t225, i1.i1.t212, i1.i2.u20.t231, i1.i2.u20.t233, i1.i2.u20.t235, i1.i2.u20.t237, i2.i0.t223, i2.i0.u9.t227, i2.i1.u13.t216, i2.i1.u13.t221, i3.t248, i3.t246, i3.t244, i3.t242, i3.t240, i3.t208, i4.i0.t156, i4.i0.u39.t171, i4.i1.t164, i4.i2.u38.t183, i4.i2.u38.t185, i4.i2.u38.t187, i4.i2.u38.t189, i5.t175, i5.i0.u27.t179, i5.i0.u30.t170, i5.i0.u30.t177, i5.i1.u29.t168, i5.i1.u29.t173, i5.i2.t4, i5.i2.t7, i5.i2.t10, i5.i2.u83.t8, i5.i2.u83.t11, i5.i2.u83.t12, i6.t200, i6.t198, i6.t196, i6.t194, i6.t192, i6.t160, i7.t151, i7.t149, i7.t147, i7.t145, i7.t143, i7.t111, i8.i0.t126, i8.i0.u48.t130, i8.i1.t124, i8.i1.u53.t119, i9.i0.t115, i9.i1.u46.t134, i9.i1.u46.t136, i9.i1.u46.t138, i9.i1.u46.t140, i9.i2.t107, i9.i2.u50.t122, i9.i2.u51.t121, i9.i2.u51.t128, i10.i0.t79, i10.i0.u59.t66, i10.i0.u63.t78, i10.i0.u63.t85, i10.i1.t72, i10.i2.u60.t91, i10.i2.u60.t93, i10.i2.u60.t95, i10.i2.u60.t97, i10.i2.u60.t99, i10.i2.u60.t101, i11.t76, i11.i0.t83, i11.i0.u62.t87, i11.i1.u65.t81, i14.t57, i14.t52, i14.t47, i14.t37, i14.t32, i14.t27, i14.t22, i14.t18, i14.u73.t55, i14.u73.t58, i14.u74.t50, i14.u74.t53, i14.u75.t45, i14.u75.t48, i14.u77.t35, i14.u77.t38, i14.u78.t30, i14.u78.t33, i14.u79.t25, i14.u79.t28, i14.u80.t20, i14.u80.t23, i14.u82.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/194/111/305
Computing Next relation with stutter on 97080 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4709 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,47.1449,729532,1,0,1.11052e+06,9243,4481,2.86541e+06,614,54832,4665441
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(X(G("((i6.u25.p64==0)||(i4.i1.u32.p94==1))"))))))
Formula 1 simplified : !XXXG"((i6.u25.p64==0)||(i4.i1.u32.p94==1))"
Computing Next relation with stutter on 97080 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
2729 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,74.4395,1259292,1,0,2.02743e+06,9781,4526,4.68762e+06,615,60394,6670243
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(X(F(!(F((F("((i10.i1.u61.p174==0)||(i1.i2.u17.p19==1))"))&&("((i10.i1.u61.p174==0)||(i1.i2.u17.p19==1))")))))))))
Formula 2 simplified : XXF!F("((i10.i1.u61.p174==0)||(i1.i2.u17.p19==1))" & F"((i10.i1.u61.p174==0)||(i1.i2.u17.p19==1))")
Computing Next relation with stutter on 97080 deadlock states
21 unique states visited
21 strongly connected components in search stack
22 transitions explored
21 items max in DFS search stack
482 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,79.267,1351728,1,0,2.18206e+06,9928,4586,4.99919e+06,616,61380,7050592
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G("(i5.i2.u83.p258==1)"))))
Formula 3 simplified : !FG"(i5.i2.u83.p258==1)"
Computing Next relation with stutter on 97080 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
34228 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,421.554,2808096,1,0,5.47794e+06,10217,1495,7.75668e+06,252,63066,3429709
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((F(G("((i8.i0.u48.p131==0)||(i5.i1.u28.p81==1))")))U("((i7.u40.p111==0)||(i6.u25.p64==1))"))))
Formula 4 simplified : !X(FG"((i8.i0.u48.p131==0)||(i5.i1.u28.p81==1))" U "((i7.u40.p111==0)||(i6.u25.p64==1))")
Computing Next relation with stutter on 97080 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
230 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,423.857,2808452,1,0,5.47794e+06,10217,1766,7.75668e+06,284,63066,3725567
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-04b-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(X("((i3.u6.p13==0)||(i2.i1.u13.p30==1))")))&&((X(G("((u72.p206==0)||(i9.i2.u50.p158==1))")))U("((i3.u6.p13==0)||(i2.i1.u13.p30==1))"))))
Formula 5 simplified : !(!X"((i3.u6.p13==0)||(i2.i1.u13.p30==1))" & (XG"((u72.p206==0)||(i9.i2.u50.p158==1))" U "((i3.u6.p13==0)||(i2.i1.u13.p30==1))"))
Computing Next relation with stutter on 97080 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
877 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,432.621,2808848,1,0,5.47794e+06,10217,2578,7.75668e+06,369,63066,4792614
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(X((X("((i9.i0.u55.p150==0)||(i11.i0.u62.p175==1))"))||(F("((i10.i2.u60.p168==0)||(i2.i0.u9.p25==1))")))))))
Formula 6 simplified : !FXX(X"((i9.i0.u55.p150==0)||(i11.i0.u62.p175==1))" | F"((i10.i2.u60.p168==0)||(i2.i0.u9.p25==1))")
Computing Next relation with stutter on 97080 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,432.622,2808848,1,0,5.47794e+06,10217,2588,7.75668e+06,370,63066,4792653
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-04b-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(X("(((((i14.u80.p248!=0)&&(i10.i2.u70.p198!=1))&&(i1.i2.u17.p5!=0))&&(i1.i1.u14.p42!=1))||(((i4.i0.u39.p106!=0)&&(i3.u7.p14!=1))&&((i1.i2.u17.p5==0)||(i1.i1.u14.p42==1))))"))))
Formula 7 simplified : !XX"(((((i14.u80.p248!=0)&&(i10.i2.u70.p198!=1))&&(i1.i2.u17.p5!=0))&&(i1.i1.u14.p42!=1))||(((i4.i0.u39.p106!=0)&&(i3.u7.p14!=1))&&((i1.i2.u17.p5==0)||(i1.i1.u14.p42==1))))"
Computing Next relation with stutter on 97080 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,432.707,2808848,1,0,5.47794e+06,10217,2639,7.75668e+06,377,63066,4795928
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G((((F(G("((i1.i1.u15.p44==0)||(i4.i2.u38.p74==1))")))||(G("((i3.u4.p9==0)||(i5.i0.u30.p85==1))")))||("(i6.u25.p65==0)"))||("(i14.u77.p230==1)"))))
Formula 8 simplified : !G("(i6.u25.p65==0)" | "(i14.u77.p230==1)" | FG"((i1.i1.u15.p44==0)||(i4.i2.u38.p74==1))" | G"((i3.u4.p9==0)||(i5.i0.u30.p85==1))")
Computing Next relation with stutter on 97080 deadlock states
21 unique states visited
21 strongly connected components in search stack
22 transitions explored
21 items max in DFS search stack
48637 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,919.08,4246492,1,0,7.21049e+06,10217,1518,1.38107e+07,256,63066,4606934
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((!(G(X("((i3.u19.p50!=1)&&((i7.u40.p110==0)||(i3.u3.p6==1)))"))))&&("(i1.i2.u20.p20!=0)"))&&("(i4.i1.u32.p93!=1)"))))
Formula 9 simplified : !F("(i1.i2.u20.p20!=0)" & "(i4.i1.u32.p93!=1)" & !GX"((i3.u19.p50!=1)&&((i7.u40.p110==0)||(i3.u3.p6==1)))")
Computing Next relation with stutter on 97080 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4497 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,964.052,4246752,1,0,7.21049e+06,10217,2633,1.38107e+07,374,63066,10957564
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-04b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1589641625843

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r081-smll-158922977700265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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