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.r210-tajo-159033475400242.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 ShieldIIPt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475400242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 4.0K May 14 00:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 00:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 34K May 12 20:42 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 ShieldIIPt-PT-002B-00
FORMULA_NAME ShieldIIPt-PT-002B-01
FORMULA_NAME ShieldIIPt-PT-002B-02
FORMULA_NAME ShieldIIPt-PT-002B-03
FORMULA_NAME ShieldIIPt-PT-002B-04
FORMULA_NAME ShieldIIPt-PT-002B-05
FORMULA_NAME ShieldIIPt-PT-002B-06
FORMULA_NAME ShieldIIPt-PT-002B-07
FORMULA_NAME ShieldIIPt-PT-002B-08
FORMULA_NAME ShieldIIPt-PT-002B-09
FORMULA_NAME ShieldIIPt-PT-002B-10
FORMULA_NAME ShieldIIPt-PT-002B-11
FORMULA_NAME ShieldIIPt-PT-002B-12
FORMULA_NAME ShieldIIPt-PT-002B-13
FORMULA_NAME ShieldIIPt-PT-002B-14
FORMULA_NAME ShieldIIPt-PT-002B-15

=== Now, execution of the tool begins

BK_START 1590578716307

[2020-05-27 11:25:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 11:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 11:25:17] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-05-27 11:25:17] [INFO ] Transformed 143 places.
[2020-05-27 11:25:17] [INFO ] Transformed 133 transitions.
[2020-05-27 11:25:17] [INFO ] Found NUPN structural information;
[2020-05-27 11:25:17] [INFO ] Parsed PT model containing 143 places and 133 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 161 ms. (steps per millisecond=621 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 133 rows 143 cols
[2020-05-27 11:25:18] [INFO ] Computed 19 place invariants in 7 ms
[2020-05-27 11:25:18] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned unsat
[2020-05-27 11:25:18] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2020-05-27 11:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 11:25:18] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 18 places in 60 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 17 places in 39 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 18 places in 31 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 12 places in 24 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 18 places in 21 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 19 places in 21 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 28 places in 19 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 22 places in 12 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 22 places in 12 ms
[2020-05-27 11:25:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 310 ms
[2020-05-27 11:25:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 11:25:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2020-05-27 11:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 11:25:18] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 17 places in 31 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 12 places in 25 ms
[2020-05-27 11:25:18] [INFO ] Deduced a trap composed of 31 places in 21 ms
[2020-05-27 11:25:19] [INFO ] Deduced a trap composed of 19 places in 17 ms
[2020-05-27 11:25:19] [INFO ] Deduced a trap composed of 22 places in 15 ms
[2020-05-27 11:25:19] [INFO ] Deduced a trap composed of 18 places in 16 ms
[2020-05-27 11:25:19] [INFO ] Deduced a trap composed of 29 places in 13 ms
[2020-05-27 11:25:19] [INFO ] Deduced a trap composed of 22 places in 14 ms
[2020-05-27 11:25:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 292 ms
[2020-05-27 11:25:19] [INFO ] Computed and/alt/rep : 132/199/132 causal constraints in 7 ms.
[2020-05-27 11:25:19] [INFO ] Added : 122 causal constraints over 25 iterations in 234 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 11:25:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 11:25:19] [INFO ] Flatten gal took : 42 ms
FORMULA ShieldIIPt-PT-002B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 11:25:19] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 11:25:19] [INFO ] Applying decomposition
[2020-05-27 11:25:19] [INFO ] Flatten gal took : 10 ms
[2020-05-27 11:25:19] [INFO ] Input system was already deterministic with 133 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/graph2344615464417373310.txt, -o, /tmp/graph2344615464417373310.bin, -w, /tmp/graph2344615464417373310.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/graph2344615464417373310.bin, -l, -1, -v, -w, /tmp/graph2344615464417373310.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 11:25:19] [INFO ] Decomposing Gal with order
[2020-05-27 11:25:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 11:25:19] [INFO ] Removed a total of 12 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 133 rows 143 cols
[2020-05-27 11:25:19] [INFO ] Computed 19 place invariants in 9 ms
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 + p95 + p96 + p97 = 1
inv : p0 + p1 + p5 + p6 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p1 + p2 + p3 + p4 = 1
inv : p0 + p74 + p75 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p23 + p24 + p25 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 = 1
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p85 + p86 + p87 + p90 + p91 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 = 1
inv : p0 + p1 + p5 + p6 + p7 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 = 1
inv : p0 + p74 + p75 + p76 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p16 + p17 + p18 + p21 + p22 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p26 + p27 + p28 = 1
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p92 + p93 + p94 = 1
inv : p0 + p74 + p75 + p76 + p77 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 = 1
inv : p0 + p74 + p75 + p76 + p77 + p78 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 = 1
inv : p0 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p85 + p86 + p87 + p88 + p89 = 1
Total of 19 invariants.
[2020-05-27 11:25:19] [INFO ] Computed 19 place invariants in 10 ms
[2020-05-27 11:25:19] [INFO ] Flatten gal took : 51 ms
[2020-05-27 11:25:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 11:25:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 11:25:19] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((X(((G("((i10.u43.p116==1)||(i12.u52.p135==1))"))||("(i12.u52.p135==1)"))U("((i10.u43.p116==1)&&(i7.i1.u31.p80!=1))"))))
Formula 0 simplified : !X(("(i12.u52.p135==1)" | G"((i10.u43.p116==1)||(i12.u52.p135==1))") U "((i10.u43.p116==1)&&(i7.i1.u31.p80!=1))")
built 27 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-27 11:25:19] [INFO ] Proved 143 variables to be positive in 154 ms
[2020-05-27 11:25:19] [INFO ] Computing symmetric may disable matrix : 133 transitions.
[2020-05-27 11:25:19] [INFO ] Computation of disable matrix completed :0/133 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:25:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:25:19] [INFO ] Computing symmetric may enable matrix : 133 transitions.
[2020-05-27 11:25:19] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t49, t108, i1.t106, i1.i0.u1.t112, i1.i0.u8.t107, i1.i1.t104, i1.i1.u5.t111, i1.i1.u9.t105, i2.u6.t110, i3.t102, i3.t95, i3.u12.t96, i3.u12.t103, i3.u13.t100, i4.t85, i4.u17.t89, i4.u17.t91, i5.t80, i5.t73, i5.u21.t74, i5.u21.t81, i5.u22.t78, i6.t68, i6.t61, i6.u26.t62, i6.u26.t69, i6.u27.t66, i7.t53, i7.i0.u33.t55, i7.i1.t51, i7.i1.u32.t56, i7.i1.u35.t52, i8.u36.t50, i9.t45, i9.t40, i9.u38.t47, i9.u40.t41, i9.u40.t48, i10.t30, i10.u43.t34, i10.u43.t36, i11.t25, i11.t18, i11.u47.t19, i11.u47.t26, i11.u48.t23, i12.t13, i12.t6, i12.u51.t7, i12.u51.t14, i12.u52.t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/82/51/133
Computing Next relation with stutter on 22 deadlock states
[2020-05-27 11:25:20] [INFO ] Computing symmetric co enabling matrix : 133 transitions.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
153 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,1.56702,55540,1,0,70553,330,1813,183905,219,820,129352
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(G((X(!(G("((i7.i1.u32.p84==1)&&(i10.u43.p117==1))"))))U((F("(i12.u49.p137!=1)"))&&(X(G("(i11.u44.p131==1)")))))))))
Formula 1 simplified : !X!G(X!G"((i7.i1.u32.p84==1)&&(i10.u43.p117==1))" U (F"(i12.u49.p137!=1)" & XG"(i11.u44.p131==1)"))
Computing Next relation with stutter on 22 deadlock states
120 unique states visited
0 strongly connected components in search stack
274 transitions explored
43 items max in DFS search stack
23 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,1.80241,62444,1,0,81086,337,1907,200983,223,870,154855
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002B-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(((X(G((F("(i9.u39.p101==1)"))&&("(i10.u41.p119==1)"))))&&("(i10.u41.p119==1)"))&&("(i5.u22.p54!=1)")))))
Formula 2 simplified : !FX("(i5.u22.p54!=1)" & "(i10.u41.p119==1)" & XG("(i10.u41.p119==1)" & F"(i9.u39.p101==1)"))
Computing Next relation with stutter on 22 deadlock states
[2020-05-27 11:25:22] [INFO ] Computation of co-enabling matrix(89/133) took 2227 ms. Total solver calls (SAT/UNSAT): 1256(7/1249)
[2020-05-27 11:25:23] [INFO ] Computation of Finished co-enabling matrix. took 3274 ms. Total solver calls (SAT/UNSAT): 1460(14/1446)
[2020-05-27 11:25:23] [INFO ] Computing Do-Not-Accords matrix : 133 transitions.
[2020-05-27 11:25:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 11:25:24] [INFO ] Built C files in 4379ms 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 1528 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 64 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(( ( X([](( <>((LTLAP6==true)) ) && ( (LTLAP7==true) ))) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==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([](( <>((LTLAP6==true)) ) && ( (LTLAP7==true) ))) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==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([](( <>((LTLAP6==true)) ) && ( (LTLAP7==true) ))) ) && ( (LTLAP7==true) ) ) && ( (LTLAP8==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)
40 unique states visited
40 strongly connected components in search stack
40 transitions explored
40 items max in DFS search stack
654 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,8.33841,199956,1,0,296495,349,1962,698635,223,913,465921
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((!(("(i6.u24.p68==1)")U("((i3.u10.p33==1)&&(i7.i1.u35.p92==1))")))&&("(i11.u44.p120==1)")))))
Formula 3 simplified : !XF("(i11.u44.p120==1)" & !("(i6.u24.p68==1)" U "((i3.u10.p33==1)&&(i7.i1.u35.p92==1))"))
Computing Next relation with stutter on 22 deadlock states
27 unique states visited
0 strongly connected components in search stack
26 transitions explored
27 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,8.34788,200452,1,0,297005,349,2013,699292,223,914,469731
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-002B-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G(((!(G("((i1.i1.u4.p11!=1)&&(i5.u19.p53!=1))")))||("(i1.i1.u4.p11!=1)"))U(G(X(X("(i5.u19.p53==1)"))))))))
Formula 4 simplified : !XG(("(i1.i1.u4.p11!=1)" | !G"((i1.i1.u4.p11!=1)&&(i5.u19.p53!=1))") U GXX"(i5.u19.p53==1)")
Computing Next relation with stutter on 22 deadlock states
235 unique states visited
235 strongly connected components in search stack
236 transitions explored
235 items max in DFS search stack
2869 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,37.0404,553008,1,0,741072,399,2056,2.03889e+06,227,1294,930877
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X("((i3.u10.p33==1)&&(i7.i1.u35.p92==1))"))))
Formula 5 simplified : !GX"((i3.u10.p33==1)&&(i7.i1.u35.p92==1))"
Computing Next relation with stutter on 22 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,37.0425,553272,1,0,741072,399,2073,2.03889e+06,227,1294,930891
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(F((X("((i7.i0.u33.p89==1)&&(i7.i0.u33.p91==1))"))&&(X("(i4.u17.p43==1)")))))))
Formula 6 simplified : !FXF(X"((i7.i0.u33.p89==1)&&(i7.i0.u33.p91==1))" & X"(i4.u17.p43==1)")
Computing Next relation with stutter on 22 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
366 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,40.7118,661248,1,0,911768,414,2143,2.43005e+06,232,1475,1168551
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("((i11.u46.p125==1)&&(i2.u7.p18!=1))")))
Formula 7 simplified : !F"((i11.u46.p125==1)&&(i2.u7.p18!=1))"
Computing Next relation with stutter on 22 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 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,40.7754,664680,1,0,919763,414,2189,2.43893e+06,232,1475,1181787
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(!(X((X(G("((i5.u18.p61!=1)||(i11.u48.p123!=1))")))U(X(F("(i4.u17.p47==1)"))))))))
Formula 8 simplified : !F!X(XG"((i5.u18.p61!=1)||(i11.u48.p123!=1))" U XF"(i4.u17.p47==1)")
Computing Next relation with stutter on 22 deadlock states
45 unique states visited
44 strongly connected components in search stack
47 transitions explored
45 items max in DFS search stack
305 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,43.8258,771860,1,0,1.12176e+06,417,2263,2.72081e+06,233,1515,1476827
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(("((i12.u52.p135==1)||(i6.u23.p73==1))")U((G(F("(i11.u44.p130!=1)")))&&(("(i0.u3.p7==1)")U("(i11.u44.p130==1)")))))))
Formula 9 simplified : !GX("((i12.u52.p135==1)||(i6.u23.p73==1))" U (GF"(i11.u44.p130!=1)" & ("(i0.u3.p7==1)" U "(i11.u44.p130==1)")))
Computing Next relation with stutter on 22 deadlock states
295 unique states visited
295 strongly connected components in search stack
296 transitions explored
295 items max in DFS search stack
4826 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,92.0838,1254348,1,0,1.809e+06,419,2314,4.77394e+06,233,1517,2121967
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X("(i9.u39.p103==1)")))
Formula 10 simplified : !X"(i9.u39.p103==1)"
Computing Next relation with stutter on 22 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,92.0854,1254348,1,0,1.809e+06,419,2317,4.77394e+06,233,1517,2121973
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(i10.u41.p118==1)")))
Formula 11 simplified : !F"(i10.u41.p118==1)"
Computing Next relation with stutter on 22 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,92.0886,1254612,1,0,1.80914e+06,419,2331,4.77416e+06,233,1517,2122567
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-002B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590578824372

--------------------
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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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 r210-tajo-159033475400242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-002B.tgz
mv ShieldIIPt-PT-002B 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 ;