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-159033476200785.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 ShieldRVs-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476200785
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.4K May 14 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 36K 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 ShieldRVs-PT-003B-00
FORMULA_NAME ShieldRVs-PT-003B-01
FORMULA_NAME ShieldRVs-PT-003B-02
FORMULA_NAME ShieldRVs-PT-003B-03
FORMULA_NAME ShieldRVs-PT-003B-04
FORMULA_NAME ShieldRVs-PT-003B-05
FORMULA_NAME ShieldRVs-PT-003B-06
FORMULA_NAME ShieldRVs-PT-003B-07
FORMULA_NAME ShieldRVs-PT-003B-08
FORMULA_NAME ShieldRVs-PT-003B-09
FORMULA_NAME ShieldRVs-PT-003B-10
FORMULA_NAME ShieldRVs-PT-003B-11
FORMULA_NAME ShieldRVs-PT-003B-12
FORMULA_NAME ShieldRVs-PT-003B-13
FORMULA_NAME ShieldRVs-PT-003B-14
FORMULA_NAME ShieldRVs-PT-003B-15

=== Now, execution of the tool begins

BK_START 1590618892614

[2020-05-27 22:34:54] [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-27 22:34:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 22:34:54] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-27 22:34:54] [INFO ] Transformed 123 places.
[2020-05-27 22:34:54] [INFO ] Transformed 138 transitions.
[2020-05-27 22:34:54] [INFO ] Found NUPN structural information;
[2020-05-27 22:34:54] [INFO ] Parsed PT model containing 123 places and 138 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 673 resets, run finished after 179 ms. (steps per millisecond=558 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 138 rows 123 cols
[2020-05-27 22:34:54] [INFO ] Computed 13 place invariants in 6 ms
[2020-05-27 22:34:54] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2020-05-27 22:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:54] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2020-05-27 22:34:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
[2020-05-27 22:34:54] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2020-05-27 22:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2020-05-27 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned unsat
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2020-05-27 22:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-05-27 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned unsat
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2020-05-27 22:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-05-27 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2020-05-27 22:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-05-27 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned unsat
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2020-05-27 22:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:55] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-27 22:34:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2020-05-27 22:34:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 22:34:55] [INFO ] Flatten gal took : 42 ms
FORMULA ShieldRVs-PT-003B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 22:34:55] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 22:34:55] [INFO ] Applying decomposition
[2020-05-27 22:34:55] [INFO ] Flatten gal took : 13 ms
[2020-05-27 22:34:55] [INFO ] Input system was already deterministic with 138 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/graph10529890268356919160.txt, -o, /tmp/graph10529890268356919160.bin, -w, /tmp/graph10529890268356919160.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/graph10529890268356919160.bin, -l, -1, -v, -w, /tmp/graph10529890268356919160.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 22:34:56] [INFO ] Decomposing Gal with order
[2020-05-27 22:34:56] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 138 rows 123 cols
[2020-05-27 22:34:56] [INFO ] Computed 13 place invariants in 3 ms
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p20 + p21 + p22 + p23 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 = 1
inv : p0 + p1 + p45 + p46 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 = 1
inv : p0 + p1 + p2 + p6 + p7 + p8 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 = 1
inv : p0 + p84 + p85 + p86 + p87 + p98 + p99 + p100 + p101 = 1
inv : p0 + p84 + p85 + p86 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 = 1
inv : p0 + p1 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p1 + p45 + p46 + p47 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 = 1
inv : p0 + p84 + p85 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 = 1
inv : p0 + p1 + p2 + p6 + p7 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 = 1
inv : p0 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 = 1
inv : p0 + p1 + p45 + p46 + p47 + p48 + p59 + p60 + p61 + p62 = 1
Total of 13 invariants.
[2020-05-27 22:34:56] [INFO ] Computed 13 place invariants in 5 ms
[2020-05-27 22:34:56] [INFO ] Removed a total of 99 redundant transitions.
[2020-05-27 22:34:56] [INFO ] Flatten gal took : 39 ms
[2020-05-27 22:34:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-27 22:34:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-27 22:34:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((((G("(i8.i0.u26.p87==1)"))&&("((i0.u25.p84==0)||(i4.u18.p62==1))"))U(X(("((i1.u4.p13==0)||(i1.u5.p10==1))")U("(i4.u15.p49!=1)")))))
Formula 0 simplified : !(("((i0.u25.p84==0)||(i4.u18.p62==1))" & G"(i8.i0.u26.p87==1)") U X("((i1.u4.p13==0)||(i1.u5.p10==1))" U "(i4.u15.p49!=1)"))
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
[2020-05-27 22:34:56] [INFO ] Proved 123 variables to be positive in 196 ms
[2020-05-27 22:34:56] [INFO ] Computing symmetric may disable matrix : 138 transitions.
[2020-05-27 22:34:56] [INFO ] Computation of disable matrix completed :0/138 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:34:56] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:34:56] [INFO ] Computing symmetric may enable matrix : 138 transitions.
[2020-05-27 22:34:56] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:34:57] [INFO ] Computing symmetric co enabling matrix : 138 transitions.
Reverse transition relation is NOT exact ! Due to transitions i1.u1.t96, i1.u4.t0, i1.u4.t1, i1.u4.t2, i1.u4.t3, i1.u5.t93, i1.u5.t95, i2.i0.u6.t90, i2.i0.u6.t91, i2.i1.t86, i2.i1.u8.t88, i2.i1.u9.t4, i2.i1.u9.t5, i2.i1.u9.t6, i2.i1.u9.t7, i3.t80, i3.u10.t8, i3.u10.t9, i3.u10.t10, i3.u10.t11, i3.u11.t83, i4.t73, i4.u16.t12, i4.u16.t13, i4.u16.t14, i4.u16.t15, i4.u17.t75, i4.u18.t70, i4.u18.t71, i5.t66, i5.u19.t68, i5.u20.t16, i5.u20.t17, i5.u20.t18, i5.u20.t19, i6.t60, i6.u22.t63, i6.u23.t20, i6.u23.t21, i6.u23.t22, i6.u23.t23, i7.t46, i7.u31.t28, i7.u31.t29, i7.u31.t30, i7.u31.t31, i7.u32.t48, i8.i0.u30.t50, i8.i0.u30.t51, i8.i1.t53, i8.i1.u28.t24, i8.i1.u28.t25, i8.i1.u28.t26, i8.i1.u28.t27, i8.i1.u29.t55, i9.t40, i9.u34.t32, i9.u34.t33, i9.u34.t34, i9.u34.t35, i9.u35.t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/61/138
Computing Next relation with stutter on 51 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
122 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.26007,51452,1,0,63608,624,1755,126725,269,2054,111157
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-003B-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(X((G("(i1.u5.p18==1)"))||(X("((i5.u19.p70==0)||(i6.u24.p73==1))")))))))
Formula 1 simplified : !GFX(G"(i1.u5.p18==1)" | X"((i5.u19.p70==0)||(i6.u24.p73==1))")
Computing Next relation with stutter on 51 deadlock states
[2020-05-27 22:34:59] [INFO ] Computation of co-enabling matrix(98/138) took 2028 ms. Total solver calls (SAT/UNSAT): 1862(38/1824)
[2020-05-27 22:35:00] [INFO ] Computation of Finished co-enabling matrix. took 2799 ms. Total solver calls (SAT/UNSAT): 2220(72/2148)
[2020-05-27 22:35:00] [INFO ] Computing Do-Not-Accords matrix : 138 transitions.
[2020-05-27 22:35:00] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 22:35:00] [INFO ] Built C files in 4177ms 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 1594 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](<>(X(( []((LTLAP4==true))) || ( X((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(( []((LTLAP4==true))) || ( X((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(( []((LTLAP4==true))) || ( X((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)
182 unique states visited
182 strongly connected components in search stack
183 transitions explored
182 items max in DFS search stack
1565 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,16.9114,346532,1,0,577066,743,2065,1.03494e+06,292,2662,693670
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G((G(X("((i7.u33.p111==0)||(i8.i1.u27.p88==1))")))U(F("((i2.i0.u6.p23==0)||(i3.u10.p36==1))"))))))
Formula 2 simplified : !XG(GX"((i7.u33.p111==0)||(i8.i1.u27.p88==1))" U F"((i2.i0.u6.p23==0)||(i3.u10.p36==1))")
Computing Next relation with stutter on 51 deadlock states
181 unique states visited
181 strongly connected components in search stack
182 transitions explored
181 items max in DFS search stack
1696 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,33.869,711240,1,0,1.23945e+06,758,2104,1.98262e+06,293,2714,1336210
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F((X(!(F("(i9.u34.p118==1)"))))&&(("((i1.u5.p17==0)||(i8.i1.u27.p88==1))")U(X("((i1.u5.p17==0)||(i8.i1.u27.p88==1))")))))))
Formula 3 simplified : !GF(X!F"(i9.u34.p118==1)" & ("((i1.u5.p17==0)||(i8.i1.u27.p88==1))" U X"((i1.u5.p17==0)||(i8.i1.u27.p88==1))"))
Computing Next relation with stutter on 51 deadlock states
343 unique states visited
343 strongly connected components in search stack
344 transitions explored
343 items max in DFS search stack
15584 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,189.713,2202760,1,0,3.20035e+06,770,1061,6.85159e+06,151,2821,1968816
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(X("((i2.i0.u6.p23==0)||(i6.u24.p73==1))")))U(G("((i7.u32.p110==0)||(i9.u34.p118==1))"))))
Formula 4 simplified : !(FX"((i2.i0.u6.p23==0)||(i6.u24.p73==1))" U G"((i7.u32.p110==0)||(i9.u34.p118==1))")
Computing Next relation with stutter on 51 deadlock states
142 unique states visited
142 strongly connected components in search stack
142 transitions explored
142 items max in DFS search stack
3609 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,225.811,2202760,1,0,3.20035e+06,770,1248,6.85159e+06,163,2821,3528233
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(!(X(F(X("(((i6.u23.p77!=0)&&(i8.i0.u30.p99!=1))&&((i9.u34.p119==0)||(i9.u34.p119==1)))"))))))))
Formula 5 simplified : !XG!XFX"(((i6.u23.p77!=0)&&(i8.i0.u30.p99!=1))&&((i9.u34.p119==0)||(i9.u34.p119==1)))"
Computing Next relation with stutter on 51 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
355 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,229.398,2202760,1,0,3.20035e+06,770,1292,6.85159e+06,168,2821,3761856
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("(i2.i1.u9.p29==1)")))
Formula 6 simplified : !X"(i2.i1.u9.p29==1)"
Computing Next relation with stutter on 51 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
248 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,231.878,2202760,1,0,3.20035e+06,770,1301,6.85159e+06,170,2821,3851422
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(X(!(X("((i6.u22.p74==0)||(i6.u23.p75==1))")))))))
Formula 7 simplified : !GXX!X"((i6.u22.p74==0)||(i6.u23.p75==1))"
Computing Next relation with stutter on 51 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,231.883,2202760,1,0,3.20035e+06,770,1323,6.85159e+06,171,2821,3851829
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(!(("(i6.u22.p82==1)")U(G(F("((i5.u21.p63==0)||(i8.i1.u28.p91==1))")))))))
Formula 8 simplified : !X!("(i6.u22.p82==1)" U GF"((i5.u21.p63==0)||(i8.i1.u28.p91==1))")
Computing Next relation with stutter on 51 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8814 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,320.022,2430820,1,0,3.5761e+06,770,749,7.94778e+06,121,2821,1320296
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVs-PT-003B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X("((i6.u23.p77==0)||(i0.u0.p0==1))"))||(G(((F("((i6.u23.p77==0)||(i0.u0.p0==1))"))&&("(i6.u23.p77!=0)"))&&("(i0.u0.p0!=1)")))))
Formula 9 simplified : !(X"((i6.u23.p77==0)||(i0.u0.p0==1))" | G("(i0.u0.p0!=1)" & "(i6.u23.p77!=0)" & F"((i6.u23.p77==0)||(i0.u0.p0==1))"))
Computing Next relation with stutter on 51 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
17 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,320.201,2431068,1,0,3.5761e+06,770,937,7.94778e+06,135,2821,1334817
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-003B-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X(((!(X("((i2.i1.u9.p29==0)||(i6.u22.p81==1))")))||("((i2.i1.u9.p29!=0)&&(i6.u22.p81!=1))"))U("(((i8.i0.u26.p87==0)||(i9.u34.p116==1))&&((i2.i1.u9.p30==0)||(i2.i1.u9.p30==1)))")))||(G("((i2.i0.u3.p8!=0)&&(i4.u17.p57!=1))"))))
Formula 10 simplified : !(X(("((i2.i1.u9.p29!=0)&&(i6.u22.p81!=1))" | !X"((i2.i1.u9.p29==0)||(i6.u22.p81==1))") U "(((i8.i0.u26.p87==0)||(i9.u34.p116==1))&&((i2.i1.u9.p30==0)||(i2.i1.u9.p30==1)))") | G"((i2.i0.u3.p8!=0)&&(i4.u17.p57!=1))")
Computing Next relation with stutter on 51 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,320.204,2431200,1,0,3.5761e+06,770,994,7.94778e+06,144,2821,1334874
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-003B-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("(i8.i0.u30.p98==1)")U(X("((i8.i0.u26.p87==0)||(i7.u33.p111==1))")))&&(F(("((i1.u5.p10==0)||(i6.u23.p77==1))")U(("((i4.u17.p56==0)||(i7.u31.p104==1))")U("((i1.u5.p19==0)||(i7.u32.p110==1))"))))))
Formula 11 simplified : !(("(i8.i0.u30.p98==1)" U X"((i8.i0.u26.p87==0)||(i7.u33.p111==1))") & F("((i1.u5.p10==0)||(i6.u23.p77==1))" U ("((i4.u17.p56==0)||(i7.u31.p104==1))" U "((i1.u5.p19==0)||(i7.u32.p110==1))")))
Computing Next relation with stutter on 51 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,320.205,2431200,1,0,3.5761e+06,770,1012,7.94778e+06,145,2821,1334915
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA ShieldRVs-PT-003B-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590619221021

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

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