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-159033476601018.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-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K May 14 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 20:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K 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.4K May 13 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:34 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 54K 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-020A-00
FORMULA_NAME ShieldRVt-PT-020A-01
FORMULA_NAME ShieldRVt-PT-020A-02
FORMULA_NAME ShieldRVt-PT-020A-03
FORMULA_NAME ShieldRVt-PT-020A-04
FORMULA_NAME ShieldRVt-PT-020A-05
FORMULA_NAME ShieldRVt-PT-020A-06
FORMULA_NAME ShieldRVt-PT-020A-07
FORMULA_NAME ShieldRVt-PT-020A-08
FORMULA_NAME ShieldRVt-PT-020A-09
FORMULA_NAME ShieldRVt-PT-020A-10
FORMULA_NAME ShieldRVt-PT-020A-11
FORMULA_NAME ShieldRVt-PT-020A-12
FORMULA_NAME ShieldRVt-PT-020A-13
FORMULA_NAME ShieldRVt-PT-020A-14
FORMULA_NAME ShieldRVt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1590631476370

[2020-05-28 02:04:37] [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-28 02:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 02:04:38] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-05-28 02:04:38] [INFO ] Transformed 163 places.
[2020-05-28 02:04:38] [INFO ] Transformed 163 transitions.
[2020-05-28 02:04:38] [INFO ] Found NUPN structural information;
[2020-05-28 02:04:38] [INFO ] Parsed PT model containing 163 places and 163 transitions in 89 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 272 ms. (steps per millisecond=367 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 162 rows 163 cols
[2020-05-28 02:04:38] [INFO ] Computed 81 place invariants in 6 ms
[2020-05-28 02:04:38] [INFO ] [Real]Absence check using 81 positive place invariants in 38 ms returned sat
[2020-05-28 02:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:38] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-05-28 02:04:38] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 14 ms.
[2020-05-28 02:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2020-05-28 02:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:38] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2020-05-28 02:04:38] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2020-05-28 02:04:39] [INFO ] Added : 160 causal constraints over 33 iterations in 445 ms. Result :sat
[2020-05-28 02:04:39] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2020-05-28 02:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:39] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-28 02:04:39] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2020-05-28 02:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:04:39] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2020-05-28 02:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:04:39] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2020-05-28 02:04:39] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2020-05-28 02:04:40] [INFO ] Added : 159 causal constraints over 32 iterations in 370 ms. Result :sat
[2020-05-28 02:04:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-28 02:04:40] [INFO ] Flatten gal took : 61 ms
FORMULA ShieldRVt-PT-020A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 02:04:40] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 02:04:40] [INFO ] Applying decomposition
[2020-05-28 02:04:40] [INFO ] Flatten gal took : 19 ms
[2020-05-28 02:04:40] [INFO ] Input system was already deterministic with 162 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/graph14467387744377982961.txt, -o, /tmp/graph14467387744377982961.bin, -w, /tmp/graph14467387744377982961.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/graph14467387744377982961.bin, -l, -1, -v, -w, /tmp/graph14467387744377982961.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 02:04:40] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 162 rows 163 cols
[2020-05-28 02:04:40] [INFO ] Computed 81 place invariants in 3 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p153 + p154 = 1
Total of 81 invariants.
[2020-05-28 02:04:40] [INFO ] Computed 81 place invariants in 6 ms
[2020-05-28 02:04:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:04:40] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-28 02:04:40] [INFO ] Flatten gal took : 74 ms
[2020-05-28 02:04:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2020-05-28 02:04:40] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 31 ms
[2020-05-28 02:04:40] [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 14 LTL properties
Checking formula 0 : !(((X((X("(((i9.i0.u59.p120==1)&&(i9.i0.u60.p122==1))&&(i9.i1.u63.p127==1))"))U(G("(((i9.i0.u59.p120==1)&&(i9.i0.u60.p122==1))&&(i9.i1.u63.p127==1))"))))||((F(X("(i2.i0.u10.p21==1)")))&&(G("(i10.i1.u69.p139==1)")))))
Formula 0 simplified : !(X(X"(((i9.i0.u59.p120==1)&&(i9.i0.u60.p122==1))&&(i9.i1.u63.p127==1))" U G"(((i9.i0.u59.p120==1)&&(i9.i0.u60.p122==1))&&(i9.i1.u63.p127==1))") | (FX"(i2.i0.u10.p21==1)" & G"(i10.i1.u69.p139==1)"))
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
3 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.10955,19740,1,0,1927,66,811,2992,65,110,4756
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!(X(F(X(F("((i9.i1.u62.p126==1)&&(i9.i1.u64.p129==1))"))))))&&(F("(i10.i0.u68.p137==1)"))))
Formula 1 simplified : !(!XFXF"((i9.i1.u62.p126==1)&&(i9.i1.u64.p129==1))" & F"(i10.i0.u68.p137==1)")
5 unique states visited
5 strongly connected components in search stack
6 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,0.112771,20168,1,0,2095,66,843,3403,65,110,5124
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(F((G("(i5.i1.u40.p81==1)"))&&("(i10.i0.u65.p131==1)")))))
Formula 2 simplified : !GF("(i10.i0.u65.p131==1)" & G"(i5.i1.u40.p81==1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,0.123179,20168,1,0,3338,66,892,6435,65,110,6892
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(!(G(F(G(F("(((i5.i1.u39.p80==1)&&(i5.i1.u40.p82==1))&&(i6.u43.p87==1))")))))))))
Formula 3 simplified : X!GFGF"(((i5.i1.u39.p80==1)&&(i5.i1.u40.p82==1))&&(i6.u43.p87==1))"
4 unique states visited
4 strongly connected components in search stack
5 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,0.126074,20328,1,0,3444,66,929,6593,65,110,7115
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X((G(F("(i4.i0.u25.p51==1)")))||((((G(F((X("((i5.i1.u38.p78==1)&&(i5.i1.u40.p81==1))"))&&(G("(((i3.i0.u17.p35==1)&&(i3.i1.u21.p44==1))&&(i3.i1.u24.p50==1))")))))&&("(i3.i0.u17.p35==1)"))&&("(i3.i1.u21.p44==1)"))&&("(i3.i1.u24.p50==1)"))))))
Formula 4 simplified : !XX(GF"(i4.i0.u25.p51==1)" | ("(i3.i0.u17.p35==1)" & "(i3.i1.u21.p44==1)" & "(i3.i1.u24.p50==1)" & GF(X"((i5.i1.u38.p78==1)&&(i5.i1.u40.p81==1))" & G"(((i3.i0.u17.p35==1)&&(i3.i1.u21.p44==1))&&(i3.i1.u24.p50==1))")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2 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.151263,21852,1,0,6782,66,992,13414,66,110,11184
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F((!(X(F("((i8.u54.p110!=1)||(i8.u56.p113!=1))"))))U(X("(((i2.i1.u13.p28==1)&&(i2.i1.u14.p29==1))&&(i2.i1.u15.p32==1))"))))&&(!(G(X(F("(((i4.i1.u29.p59==1)&&(i5.i0.u33.p68==1))&&(i5.i0.u36.p74==1))")))))))
Formula 5 simplified : !(F(!XF"((i8.u54.p110!=1)||(i8.u56.p113!=1))" U X"(((i2.i1.u13.p28==1)&&(i2.i1.u14.p29==1))&&(i2.i1.u15.p32==1))") & !GXF"(((i4.i1.u29.p59==1)&&(i5.i0.u33.p68==1))&&(i5.i0.u36.p74==1))")
[2020-05-28 02:04:41] [INFO ] Proved 163 variables to be positive in 440 ms
[2020-05-28 02:04:41] [INFO ] Computing symmetric may disable matrix : 162 transitions.
[2020-05-28 02:04:41] [INFO ] Computation of disable matrix completed :0/162 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:04:41] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:04:41] [INFO ] Computing symmetric may enable matrix : 162 transitions.
[2020-05-28 02:04:41] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
78 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.927955,51684,1,0,57384,66,1039,207551,66,110,40173
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G(X((G("(((i9.i0.u57.p116==1)&&(i9.i0.u58.p117==1))&&(i9.i0.u59.p120==1))"))U("((i6.u42.p86==1)&&(i6.u44.p89==1))"))))))
Formula 6 simplified : GX(G"(((i9.i0.u57.p116==1)&&(i9.i0.u58.p117==1))&&(i9.i0.u59.p120==1))" U "((i6.u42.p86==1)&&(i6.u44.p89==1))")
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,0.929093,52212,1,0,57384,66,1068,207551,66,110,40193
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-020A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(X(("(((i2.i1.u13.p28==1)&&(i2.i1.u14.p29==1))&&(i2.i1.u15.p32==1))")U(((((F("((i3.i0.u18.p38==1)&&(i3.i0.u20.p41==1))"))&&("(i3.i0.u18.p38==1)"))&&("(i3.i0.u20.p41==1)"))||("(i11.i0.u75.p151==1)"))||("(i11.i0.u74.p149!=1)"))))))
Formula 7 simplified : X("(((i2.i1.u13.p28==1)&&(i2.i1.u14.p29==1))&&(i2.i1.u15.p32==1))" U ("(i11.i0.u74.p149!=1)" | "(i11.i0.u75.p151==1)" | ("(i3.i0.u18.p38==1)" & "(i3.i0.u20.p41==1)" & F"((i3.i0.u18.p38==1)&&(i3.i0.u20.p41==1))")))
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,0.932445,52212,1,0,57384,66,1192,207551,66,110,40304
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(("(i5.i0.u34.p69!=1)")U("(((i2.i1.u13.p27==1)&&(i3.i0.u17.p36==1))&&(i3.i0.u20.p42==1))"))))
Formula 8 simplified : !F("(i5.i0.u34.p69!=1)" U "(((i2.i1.u13.p27==1)&&(i3.i0.u17.p36==1))&&(i3.i0.u20.p42==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
34 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.26471,60660,1,0,76658,66,1230,249173,66,110,49208
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F("(((i3.i0.u17.p35==1)&&(i3.i1.u21.p44==1))&&(i3.i1.u24.p50==1))"))&&(F((F("(i2.i1.u16.p33==1)"))&&("(i4.i1.u30.p61!=1)")))))
Formula 9 simplified : !(F"(((i3.i0.u17.p35==1)&&(i3.i1.u21.p44==1))&&(i3.i1.u24.p50==1))" & F("(i4.i1.u30.p61!=1)" & F"(i2.i1.u16.p33==1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 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.32232,63300,1,0,82197,66,1307,262238,66,110,55001
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldRVt-PT-020A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(("(((i10.i0.u65.p132==1)&&(i10.i0.u66.p133==1))&&(i10.i0.u67.p136==1))")U(G("(i5.i0.u33.p67==1)")))))
Formula 10 simplified : !F("(((i10.i0.u65.p132==1)&&(i10.i0.u66.p133==1))&&(i10.i0.u67.p136==1))" U G"(i5.i0.u33.p67==1)")
[2020-05-28 02:04:43] [INFO ] Computing symmetric co enabling matrix : 162 transitions.
[2020-05-28 02:04:44] [INFO ] Computation of co-enabling matrix(30/162) took 733 ms. Total solver calls (SAT/UNSAT): 243(30/213)
[2020-05-28 02:04:47] [INFO ] Computation of co-enabling matrix(160/162) took 3742 ms. Total solver calls (SAT/UNSAT): 579(139/440)
[2020-05-28 02:04:47] [INFO ] Computation of Finished co-enabling matrix. took 3762 ms. Total solver calls (SAT/UNSAT): 579(139/440)
[2020-05-28 02:04:47] [INFO ] Computing Do-Not-Accords matrix : 162 transitions.
[2020-05-28 02:04:47] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:04:47] [INFO ] Built C files in 6763ms 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 1978 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 65 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(((LTLAP28==true))U([]((LTLAP29==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, -p, --pins-guards, --when, --ltl, <>(((LTLAP28==true))U([]((LTLAP29==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, -p, --pins-guards, --when, --ltl, <>(((LTLAP28==true))U([]((LTLAP29==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)
Detected timeout of ITS tools.
[2020-05-28 02:24:41] [INFO ] Applying decomposition
[2020-05-28 02:24:41] [INFO ] Flatten gal took : 22 ms
[2020-05-28 02:24:41] [INFO ] Decomposing Gal with order
[2020-05-28 02:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:24:41] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-28 02:24:41] [INFO ] Flatten gal took : 48 ms
[2020-05-28 02:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-28 02:24:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-28 02:24:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/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 4 LTL properties
Checking formula 0 : !((F(("(((u66.p132==1)&&(u67.p133==1))&&(u68.p136==1))")U(G("(u34.p67==1)")))))
Formula 0 simplified : !F("(((u66.p132==1)&&(u67.p133==1))&&(u68.p136==1))" U G"(u34.p67==1)")
built 82 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-28 02:44:41] [INFO ] Flatten gal took : 20 ms
[2020-05-28 02:44:41] [INFO ] Input system was already deterministic with 162 transitions.
[2020-05-28 02:44:41] [INFO ] Transformed 163 places.
[2020-05-28 02:44:41] [INFO ] Transformed 162 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-28 02:44:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-28 02:44:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((p132==1)&&(p133==1))&&(p136==1))")U(G("(p67==1)")))))
Formula 0 simplified : !F("(((p132==1)&&(p133==1))&&(p136==1))" U G"(p67==1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldRVt-PT-020A"
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 ShieldRVt-PT-020A, 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-159033476601018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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