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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.7K May 14 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 20:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 13 20:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:27 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 24K 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 ShieldRVt-PT-002B-00
FORMULA_NAME ShieldRVt-PT-002B-01
FORMULA_NAME ShieldRVt-PT-002B-02
FORMULA_NAME ShieldRVt-PT-002B-03
FORMULA_NAME ShieldRVt-PT-002B-04
FORMULA_NAME ShieldRVt-PT-002B-05
FORMULA_NAME ShieldRVt-PT-002B-06
FORMULA_NAME ShieldRVt-PT-002B-07
FORMULA_NAME ShieldRVt-PT-002B-08
FORMULA_NAME ShieldRVt-PT-002B-09
FORMULA_NAME ShieldRVt-PT-002B-10
FORMULA_NAME ShieldRVt-PT-002B-11
FORMULA_NAME ShieldRVt-PT-002B-12
FORMULA_NAME ShieldRVt-PT-002B-13
FORMULA_NAME ShieldRVt-PT-002B-14
FORMULA_NAME ShieldRVt-PT-002B-15

=== Now, execution of the tool begins

BK_START 1590630286089

[2020-05-28 01:44:47] [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-28 01:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:44:47] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-28 01:44:47] [INFO ] Transformed 103 places.
[2020-05-28 01:44:47] [INFO ] Transformed 103 transitions.
[2020-05-28 01:44:47] [INFO ] Found NUPN structural information;
[2020-05-28 01:44:47] [INFO ] Parsed PT model containing 103 places and 103 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 92 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 47 resets, run finished after 192 ms. (steps per millisecond=520 ) 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, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 103 rows 103 cols
[2020-05-28 01:44:48] [INFO ] Computed 9 place invariants in 6 ms
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2020-05-28 01:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-05-28 01:44:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned unsat
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using 9 positive place invariants in 46 ms returned sat
[2020-05-28 01:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-28 01:44:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned unsat
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2020-05-28 01:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-05-28 01:44:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 33 ms returned unsat
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-05-28 01:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:48] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2020-05-28 01:44:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned unsat
[2020-05-28 01:44:49] [INFO ] [Real]Absence check using 9 positive place invariants in 61 ms returned sat
[2020-05-28 01:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:49] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-05-28 01:44:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned unsat
[2020-05-28 01:44:49] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-05-28 01:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:44:49] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-05-28 01:44:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:44:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 32 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2020-05-28 01:44:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-28 01:44:49] [INFO ] Flatten gal took : 53 ms
FORMULA ShieldRVt-PT-002B-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:44:49] [INFO ] Flatten gal took : 22 ms
[2020-05-28 01:44:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-002B-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:44:49] [INFO ] Applying decomposition
[2020-05-28 01:44:49] [INFO ] Flatten gal took : 7 ms
[2020-05-28 01:44:49] [INFO ] Input system was already deterministic with 103 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/graph1457955851786594750.txt, -o, /tmp/graph1457955851786594750.bin, -w, /tmp/graph1457955851786594750.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 103 rows 103 cols
[2020-05-28 01:44:49] [INFO ] Computed 9 place invariants in 3 ms
inv : p0 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 = 1
inv : p0 + p54 + p55 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 = 1
inv : p0 + p54 + p55 + p56 + p57 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 = 1
inv : p0 + p54 + p55 + p56 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 = 1
inv : p0 + p1 + p2 + p3 + p4 = 1
inv : p0 + p1 + p5 + p6 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 = 1
inv : p0 + p1 + p5 + p6 + p7 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 = 1
Total of 9 invariants.
[2020-05-28 01:44:49] [INFO ] Computed 9 place invariants in 4 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1457955851786594750.bin, -l, -1, -v, -w, /tmp/graph1457955851786594750.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:44:49] [INFO ] Decomposing Gal with order
[2020-05-28 01:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:44:49] [INFO ] Removed a total of 12 redundant transitions.
[2020-05-28 01:44:49] [INFO ] Flatten gal took : 70 ms
[2020-05-28 01:44:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2020-05-28 01:44:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-28 01:44:50] [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 11 LTL properties
Checking formula 0 : !((X(((G(X("((i7.u34.p83==0)||(i5.u27.p68==1))")))||("(i6.u30.p71==0)"))||("(i3.u16.p40==1)"))))
Formula 0 simplified : !X("(i3.u16.p40==1)" | "(i6.u30.p71==0)" | GX"((i7.u34.p83==0)||(i5.u27.p68==1))")
built 14 ordering constraints for composite.
built 6 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 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-28 01:44:50] [INFO ] Proved 103 variables to be positive in 380 ms
[2020-05-28 01:44:50] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2020-05-28 01:44:50] [INFO ] Computation of disable matrix completed :0/103 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:44:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:44:50] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2020-05-28 01:44:50] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u1.t92, i1.t90, i1.t83, i1.u7.t84, i1.u7.t91, i1.u8.t88, i2.t74, i2.u11.t78, i2.u11.t80, i3.t69, i3.t62, i3.u13.t63, i3.u13.t70, i3.u16.t67, i4.t57, i4.t50, i4.u17.t51, i4.u17.t58, i4.u18.t55, i5.t42, i5.t37, i5.u24.t38, i5.u24.t45, i5.u25.t44, i6.t28, i6.u30.t32, i6.u30.t34, i7.t23, i7.t16, i7.u33.t17, i7.u33.t24, i7.u34.t21, i8.t11, i8.t4, i8.u37.t9, i8.u39.t5, i8.u39.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/37/103
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
14 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,0.167963,22600,1,0,12201,248,1155,21016,168,474,28194
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002B-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F("((i5.u25.p67!=0)&&(i8.u39.p100!=1))")))
Formula 1 simplified : !F"((i5.u25.p67!=0)&&(i8.u39.p100!=1))"
Computing Next relation with stutter on 8 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,0.234694,25556,1,0,19706,275,1370,29071,178,586,43722
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G(X("((i3.u13.p32==0)||(i5.u25.p60==1))")))U(((X(G("(i0.i2.u22.p54==1)")))||("(i6.u30.p71==0)"))||("(i7.u35.p90==1)")))))
Formula 2 simplified : !G(GX"((i3.u13.p32==0)||(i5.u25.p60==1))" U ("(i6.u30.p71==0)" | "(i7.u35.p90==1)" | XG"(i0.i2.u22.p54==1)"))
Computing Next relation with stutter on 8 deadlock states
36 unique states visited
36 strongly connected components in search stack
37 transitions explored
36 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,0.46913,36140,1,0,38373,314,1534,59958,183,819,78488
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("(i8.u39.p99!=1)")U(G(("((i2.u11.p27==0)||(i2.u10.p25==1))")U("((i1.u5.p13==0)||(i7.u33.p81==1))")))))
Formula 3 simplified : !("(i8.u39.p99!=1)" U G("((i2.u11.p27==0)||(i2.u10.p25==1))" U "((i1.u5.p13==0)||(i7.u33.p81==1))"))
Computing Next relation with stutter on 8 deadlock states
25 unique states visited
25 strongly connected components in search stack
25 transitions explored
25 items max in DFS search stack
47 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,0.94165,56548,1,0,83916,337,1643,114067,184,1092,154579
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((((X("((i3.u13.p38==0)||(i7.u33.p81==1))"))&&("(i3.u12.p31!=0)"))&&("(i4.u21.p43!=1)"))U((G("((i3.u12.p31==0)||(i4.u21.p43==1))"))&&("((i7.u35.p80==0)||(i4.u17.p51==1))"))))
Formula 4 simplified : !(("(i3.u12.p31!=0)" & "(i4.u21.p43!=1)" & X"((i3.u13.p38==0)||(i7.u33.p81==1))") U ("((i7.u35.p80==0)||(i4.u17.p51==1))" & G"((i3.u12.p31==0)||(i4.u21.p43==1))"))
Computing Next relation with stutter on 8 deadlock states
[2020-05-28 01:44:51] [INFO ] Computing symmetric co enabling matrix : 103 transitions.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
29 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.23136,67944,1,0,110660,338,1725,141716,184,1102,197195
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X(("((i2.u11.p28!=0)&&(i8.u40.p102!=1))")&&(((G("((i2.u11.p28==0)||(i8.u40.p102==1))"))||("(i5.u27.p58==0)"))||("(i5.u27.p58==1)")))))))
Formula 5 simplified : !XGX("((i2.u11.p28!=0)&&(i8.u40.p102!=1))" & ("(i5.u27.p58==0)" | "(i5.u27.p58==1)" | G"((i2.u11.p28==0)||(i8.u40.p102==1))"))
Computing Next relation with stutter on 8 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.23542,68200,1,0,110730,338,1803,141779,191,1102,197549
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(X(X(X(!(F("((i5.u24.p66==0)||(i0.i0.u1.p2==1))")))))))))
Formula 6 simplified : GXXX!F"((i5.u24.p66==0)||(i0.i0.u1.p2==1))"
Computing Next relation with stutter on 8 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.23616,68200,1,0,110730,338,1828,141779,192,1102,197583
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-002B-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(F(("(i2.u11.p23==1)")||(G("(i2.u11.p23==1)")))))&&(X("((i1.u6.p11==0)||(i7.u34.p83==1))"))))
Formula 7 simplified : !(XF("(i2.u11.p23==1)" | G"(i2.u11.p23==1)") & X"((i1.u6.p11==0)||(i7.u34.p83==1))")
Computing Next relation with stutter on 8 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.29347,70576,1,0,116726,338,1872,148039,192,1102,208097
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F("((i7.u33.p81!=0)&&(i2.u10.p24!=1))"))U(!(F(((X(G(X("((i7.u34.p89==0)||(i4.u18.p46==1))"))))&&(X("((i7.u34.p89==0)||(i4.u18.p46==1))")))&&("((i7.u34.p89==0)||(i4.u18.p46==1))"))))))
Formula 8 simplified : !(F"((i7.u33.p81!=0)&&(i2.u10.p24!=1))" U !F("((i7.u34.p89==0)||(i4.u18.p46==1))" & X"((i7.u34.p89==0)||(i4.u18.p46==1))" & XGX"((i7.u34.p89==0)||(i4.u18.p46==1))"))
Computing Next relation with stutter on 8 deadlock states
35 unique states visited
35 strongly connected components in search stack
36 transitions explored
35 items max in DFS search stack
131 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,2.61135,112548,1,0,204693,347,1903,255798,193,1143,313959
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(X(G(!("((i3.u15.p37==0)||(i2.u10.p24==1))"))))))
Formula 9 simplified : !XXG!"((i3.u15.p37==0)||(i2.u10.p24==1))"
Computing Next relation with stutter on 8 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,2.61246,112812,1,0,204693,347,1920,255798,193,1143,313986
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("((i7.u35.p80!=0)&&(i0.i0.u1.p2!=1))")))
Formula 10 simplified : !F"((i7.u35.p80!=0)&&(i0.i0.u1.p2!=1))"
Computing Next relation with stutter on 8 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
32 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,2.94367,120996,1,0,223480,347,1947,277991,193,1143,350497
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldRVt-PT-002B-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-28 01:44:53] [INFO ] Computation of Finished co-enabling matrix. took 1990 ms. Total solver calls (SAT/UNSAT): 1109(14/1095)
[2020-05-28 01:44:53] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2020-05-28 01:44:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:44:53] [INFO ] Built C files in 3504ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590630294424

--------------------
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="ShieldRVt-PT-002B"
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 ShieldRVt-PT-002B, 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-159033476500945"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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