fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476500994
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldRVt-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15737.140 3600000.00 3657410.00 1671.00 FTFFF????????FF? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.7K May 14 02:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.0K May 13 14:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 14:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:30 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 60K 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-005B-00
FORMULA_NAME ShieldRVt-PT-005B-01
FORMULA_NAME ShieldRVt-PT-005B-02
FORMULA_NAME ShieldRVt-PT-005B-03
FORMULA_NAME ShieldRVt-PT-005B-04
FORMULA_NAME ShieldRVt-PT-005B-05
FORMULA_NAME ShieldRVt-PT-005B-06
FORMULA_NAME ShieldRVt-PT-005B-07
FORMULA_NAME ShieldRVt-PT-005B-08
FORMULA_NAME ShieldRVt-PT-005B-09
FORMULA_NAME ShieldRVt-PT-005B-10
FORMULA_NAME ShieldRVt-PT-005B-11
FORMULA_NAME ShieldRVt-PT-005B-12
FORMULA_NAME ShieldRVt-PT-005B-13
FORMULA_NAME ShieldRVt-PT-005B-14
FORMULA_NAME ShieldRVt-PT-005B-15

=== Now, execution of the tool begins

BK_START 1590630589736

[2020-05-28 01:49:51] [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 01:49:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 01:49:51] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-05-28 01:49:51] [INFO ] Transformed 253 places.
[2020-05-28 01:49:51] [INFO ] Transformed 253 transitions.
[2020-05-28 01:49:51] [INFO ] Found NUPN structural information;
[2020-05-28 01:49:51] [INFO ] Parsed PT model containing 253 places and 253 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1 resets, run finished after 219 ms. (steps per millisecond=456 ) properties seen :[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, 0, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 253 rows 253 cols
[2020-05-28 01:49:51] [INFO ] Computed 21 place invariants in 9 ms
[2020-05-28 01:49:51] [INFO ] [Real]Absence check using 21 positive place invariants in 32 ms returned sat
[2020-05-28 01:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:52] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2020-05-28 01:49:52] [INFO ] Deduced a trap composed of 21 places in 106 ms
[2020-05-28 01:49:52] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-05-28 01:49:52] [INFO ] Deduced a trap composed of 36 places in 43 ms
[2020-05-28 01:49:52] [INFO ] Deduced a trap composed of 27 places in 36 ms
[2020-05-28 01:49:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 313 ms
[2020-05-28 01:49:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:49:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 124 ms returned sat
[2020-05-28 01:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:52] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-05-28 01:49:52] [INFO ] Deduced a trap composed of 23 places in 52 ms
[2020-05-28 01:49:52] [INFO ] Deduced a trap composed of 35 places in 43 ms
[2020-05-28 01:49:53] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-05-28 01:49:53] [INFO ] Deduced a trap composed of 26 places in 32 ms
[2020-05-28 01:49:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2020-05-28 01:49:53] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 14 ms.
[2020-05-28 01:49:53] [INFO ] Added : 247 causal constraints over 50 iterations in 714 ms. Result :sat
[2020-05-28 01:49:53] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2020-05-28 01:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:54] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 26 places in 57 ms
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 24 places in 48 ms
[2020-05-28 01:49:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 277 ms
[2020-05-28 01:49:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:49:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 142 ms returned sat
[2020-05-28 01:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:54] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 16 places in 83 ms
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 25 places in 76 ms
[2020-05-28 01:49:54] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-05-28 01:49:55] [INFO ] Deduced a trap composed of 30 places in 81 ms
[2020-05-28 01:49:55] [INFO ] Deduced a trap composed of 26 places in 64 ms
[2020-05-28 01:49:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 440 ms
[2020-05-28 01:49:55] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 13 ms.
[2020-05-28 01:49:55] [INFO ] Added : 236 causal constraints over 48 iterations in 637 ms. Result :sat
[2020-05-28 01:49:55] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2020-05-28 01:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:55] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 15 places in 71 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 34 places in 65 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 35 places in 74 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 26 places in 51 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 24 places in 38 ms
[2020-05-28 01:49:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 446 ms
[2020-05-28 01:49:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:49:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 107 ms returned sat
[2020-05-28 01:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:56] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 32 places in 68 ms
[2020-05-28 01:49:56] [INFO ] Deduced a trap composed of 26 places in 66 ms
[2020-05-28 01:49:57] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-05-28 01:49:57] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-05-28 01:49:57] [INFO ] Deduced a trap composed of 31 places in 37 ms
[2020-05-28 01:49:57] [INFO ] Deduced a trap composed of 34 places in 48 ms
[2020-05-28 01:49:57] [INFO ] Deduced a trap composed of 26 places in 39 ms
[2020-05-28 01:49:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 539 ms
[2020-05-28 01:49:57] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 15 ms.
[2020-05-28 01:49:57] [INFO ] Added : 234 causal constraints over 48 iterations in 728 ms. Result :sat
[2020-05-28 01:49:58] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2020-05-28 01:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:58] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 27 places in 42 ms
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 25 places in 35 ms
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 33 places in 49 ms
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 22 places in 36 ms
[2020-05-28 01:49:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 204 ms
[2020-05-28 01:49:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 01:49:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 119 ms returned sat
[2020-05-28 01:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 01:49:58] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 25 places in 42 ms
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2020-05-28 01:49:58] [INFO ] Deduced a trap composed of 22 places in 30 ms
[2020-05-28 01:49:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2020-05-28 01:49:58] [INFO ] Computed and/alt/rep : 252/373/252 causal constraints in 13 ms.
[2020-05-28 01:49:59] [INFO ] Added : 235 causal constraints over 47 iterations in 635 ms. Result :unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-28 01:49:59] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-28 01:49:59] [INFO ] Flatten gal took : 45 ms
FORMULA ShieldRVt-PT-005B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 01:49:59] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 01:49:59] [INFO ] Applying decomposition
[2020-05-28 01:49:59] [INFO ] Flatten gal took : 29 ms
[2020-05-28 01:49:59] [INFO ] Input system was already deterministic with 253 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 253 rows 253 cols
[2020-05-28 01:49:59] [INFO ] Computed 21 place invariants in 3 ms
inv : p0 + p1 + p155 + p156 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 = 1
inv : p0 + p1 + p2 + p3 + p57 + p58 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 = 1
inv : p0 + p1 + p2 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 = 1
inv : p0 + p204 + p205 + p206 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 = 1
inv : p0 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 = 1
inv : p0 + p1 + p2 + p106 + p107 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 = 1
inv : p0 + p204 + p205 + p206 + p207 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 = 1
inv : p0 + p1 + p2 + p3 + p4 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 = 1
inv : p0 + p1 + p155 + p156 + p157 + p158 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 = 1
inv : p0 + p1 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 = 1
inv : p0 + p1 + p2 + p3 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 = 1
inv : p0 + p1 + p2 + p106 + p107 + p108 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 = 1
inv : p0 + p1 + p2 + p106 + p107 + p108 + p109 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 = 1
inv : p0 + p1 + p2 + p3 + p4 + p8 + p9 + p10 + p11 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 = 1
inv : p0 + p204 + p205 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 = 1
inv : p0 + p1 + p2 + p3 + p4 + p8 + p9 + p10 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 = 1
inv : p0 + p1 + p155 + p156 + p157 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 = 1
inv : p0 + p1 + p2 + p3 + p57 + p58 + p59 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 = 1
inv : p0 + p1 + p2 + p3 + p57 + p58 + p59 + p60 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p1 + p2 + p3 + p4 + p8 + p9 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 = 1
Total of 21 invariants.
[2020-05-28 01:49:59] [INFO ] Computed 21 place invariants in 4 ms
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/graph11605797841821470843.txt, -o, /tmp/graph11605797841821470843.bin, -w, /tmp/graph11605797841821470843.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/graph11605797841821470843.bin, -l, -1, -v, -w, /tmp/graph11605797841821470843.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 01:49:59] [INFO ] Decomposing Gal with order
[2020-05-28 01:50:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 01:50:00] [INFO ] Removed a total of 30 redundant transitions.
[2020-05-28 01:50:00] [INFO ] Flatten gal took : 45 ms
[2020-05-28 01:50:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-28 01:50:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2020-05-28 01:50:00] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((G(X(X(G((X((G("(i2.u13.p40==1)"))||("(i13.u66.p162==1)")))&&("((i13.u66.p162==1)||(i2.u13.p40==1))")))))))
Formula 0 simplified : !GXXG("((i13.u66.p162==1)||(i2.u13.p40==1))" & X("(i13.u66.p162==1)" | G"(i2.u13.p40==1)"))
built 36 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 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 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 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 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-28 01:50:00] [INFO ] Proved 253 variables to be positive in 314 ms
[2020-05-28 01:50:00] [INFO ] Computing symmetric may disable matrix : 253 transitions.
[2020-05-28 01:50:00] [INFO ] Computation of disable matrix completed :0/253 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:50:00] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:50:00] [INFO ] Computing symmetric may enable matrix : 253 transitions.
[2020-05-28 01:50:00] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:50:01] [INFO ] Computing symmetric co enabling matrix : 253 transitions.
[2020-05-28 01:50:03] [INFO ] Computation of co-enabling matrix(127/253) took 2076 ms. Total solver calls (SAT/UNSAT): 1929(11/1918)
[2020-05-28 01:50:05] [INFO ] Computation of Finished co-enabling matrix. took 4006 ms. Total solver calls (SAT/UNSAT): 3143(35/3108)
[2020-05-28 01:50:05] [INFO ] Computing Do-Not-Accords matrix : 253 transitions.
[2020-05-28 01:50:05] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 01:50:05] [INFO ] Built C files in 5430ms 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]
Reverse transition relation is NOT exact ! Due to transitions i0.t228, i0.t221, i0.u7.t222, i0.u7.t229, i0.u8.t226, i1.i1.t212, i1.i1.u12.t216, i1.i1.u12.t218, i2.t207, i2.t200, i2.u15.t201, i2.u15.t208, i2.u16.t205, i3.t195, i3.t188, i3.u18.t189, i3.u18.t196, i3.u21.t193, i4.t182, i4.t175, i4.u28.t176, i4.u28.t183, i4.u29.t180, i5.t166, i5.u31.t170, i5.u31.t172, i6.t161, i6.t154, i6.u33.t155, i6.u33.t162, i6.u36.t159, i7.t149, i7.t142, i7.u38.t143, i7.u38.t150, i7.u40.t147, i8.i0.u2.t230, i9.t103, i9.t96, i9.u60.t97, i9.u60.t104, i9.u61.t101, i10.t136, i10.t129, i10.u48.t130, i10.u48.t137, i10.u49.t134, i11.i1.t120, i11.i1.u51.t124, i11.i1.u51.t126, i12.t115, i12.t108, i12.u54.t113, i12.u56.t109, i12.u56.t116, i13.t90, i13.t83, i13.u65.t84, i13.u65.t91, i13.u66.t88, i14.t74, i14.u71.t78, i14.u71.t80, i15.t69, i15.t62, i15.u74.t63, i15.u74.t70, i15.u75.t67, i16.t57, i16.t50, i16.u80.t51, i16.u80.t58, i16.u81.t55, i17.t23, i17.t16, i17.u93.t21, i17.u95.t17, i17.u95.t24, i18.t42, i18.t37, i18.u86.t38, i18.u86.t45, i18.u87.t44, i19.i1.t28, i19.i1.u90.t32, i19.i1.u90.t34, i20.t11, i20.t4, i20.u98.t5, i20.u98.t12, i20.u99.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/91/253
Computing Next relation with stutter on 2025 deadlock states
Compilation finished in 2263 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 72 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X(X([](( X(( []((LTLAP0==true))) || ( (LTLAP1==true)) ) ) && ( (LTLAP2==true) ))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X(X([](( X(( []((LTLAP0==true))) || ( (LTLAP1==true)) ) ) && ( (LTLAP2==true) ))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, [](X(X([](( X(( []((LTLAP0==true))) || ( (LTLAP1==true)) ) ) && ( (LTLAP2==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)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
885 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.89186,170628,1,0,314695,306,2921,509693,182,818,611524
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-005B-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G((X(F(G((G("(i14.u71.p172==1)"))&&("((((i0.u6.p16==1)&&(i4.u29.p70==1))&&(i7.u40.p104==1))||(i7.u39.p97==1))")))))&&(F("(((i0.u6.p16==1)&&(i4.u29.p70==1))&&(i7.u40.p104==1))"))))))
Formula 1 simplified : G(XFG("((((i0.u6.p16==1)&&(i4.u29.p70==1))&&(i7.u40.p104==1))||(i7.u39.p97==1))" & G"(i14.u71.p172==1)") & F"(((i0.u6.p16==1)&&(i4.u29.p70==1))&&(i7.u40.p104==1))")
Computing Next relation with stutter on 2025 deadlock states
83 unique states visited
83 strongly connected components in search stack
84 transitions explored
83 items max in DFS search stack
891 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,17.8134,398632,1,0,752522,336,2990,1.18776e+06,183,1048,1243242
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-005B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X(G((F("(i4.u28.p62==1)"))U((!(X(("(i4.u28.p62==1)")U("(i0.u7.p19==1)"))))&&(G("(i11.i1.u52.p130==1)")))))))))
Formula 2 simplified : !FGXG(F"(i4.u28.p62==1)" U (!X("(i4.u28.p62==1)" U "(i0.u7.p19==1)") & G"(i11.i1.u52.p130==1)"))
Computing Next relation with stutter on 2025 deadlock states
463 unique states visited
463 strongly connected components in search stack
464 transitions explored
463 items max in DFS search stack
35627 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,374.085,5685660,1,0,6.56994e+06,353,3086,2.81504e+07,185,1198,8878221
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-005B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("(i17.u96.p241==1)")U(X(G(F(("(i1.i1.u10.p33==1)")U(G("(i17.u92.p236==1)"))))))))
Formula 3 simplified : !("(i17.u96.p241==1)" U XGF("(i1.i1.u10.p33==1)" U G"(i17.u92.p236==1)"))
Computing Next relation with stutter on 2025 deadlock states
Detected timeout of ITS tools.
[2020-05-28 02:10:02] [INFO ] Applying decomposition
[2020-05-28 02:10:02] [INFO ] Flatten gal took : 11 ms
[2020-05-28 02:10:02] [INFO ] Decomposing Gal with order
[2020-05-28 02:10:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:10:02] [INFO ] Flatten gal took : 34 ms
[2020-05-28 02:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-28 02:10:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-28 02:10:02] [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 9 LTL properties
Checking formula 0 : !((("(i1.i0.u39.p241==1)")U(X(G(F(("(i0.i0.i0.i0.i1.i0.i0.u10.p33==1)")U(G("(i1.i0.u39.p236==1)"))))))))
Formula 0 simplified : !("(i1.i0.u39.p241==1)" U XGF("(i0.i0.i0.i0.i1.i0.i0.u10.p33==1)" U G"(i1.i0.u39.p236==1)"))
built 2 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.i0.u5.t230, i0.i0.i0.i0.i1.u12.t188, i0.i0.i0.i0.i1.u12.t189, i0.i0.i0.i0.i1.u12.t193, i0.i0.i0.i0.i1.u12.t195, i0.i0.i0.i0.i1.u12.t196, i0.i0.i0.i0.i1.i0.u11.t200, i0.i0.i0.i0.i1.i0.u11.t201, i0.i0.i0.i0.i1.i0.u11.t205, i0.i0.i0.i0.i1.i0.u11.t207, i0.i0.i0.i0.i1.i0.u11.t208, i0.i0.i0.i0.i1.i0.i0.u9.t221, i0.i0.i0.i0.i1.i0.i0.u9.t222, i0.i0.i0.i0.i1.i0.i0.u9.t226, i0.i0.i0.i0.i1.i0.i0.u9.t228, i0.i0.i0.i0.i1.i0.i0.u9.t229, i0.i0.i0.i0.i1.i0.i0.u10.t212, i0.i0.i0.i0.i1.i0.i0.u10.t216, i0.i0.i0.i0.i1.i0.i0.u10.t218, i0.i0.i0.i1.u19.t142, i0.i0.i0.i1.u19.t143, i0.i0.i0.i1.u19.t147, i0.i0.i0.i1.u19.t149, i0.i0.i0.i1.u19.t150, i0.i0.i0.i1.i0.u18.t154, i0.i0.i0.i1.i0.u18.t155, i0.i0.i0.i1.i0.u18.t159, i0.i0.i0.i1.i0.u18.t161, i0.i0.i0.i1.i0.u18.t162, i0.i0.i0.i1.i0.i0.u16.t175, i0.i0.i0.i1.i0.i0.u16.t176, i0.i0.i0.i1.i0.i0.u16.t180, i0.i0.i0.i1.i0.i0.u16.t182, i0.i0.i0.i1.i0.i0.u16.t183, i0.i0.i0.i1.i0.i0.u17.t166, i0.i0.i0.i1.i0.i0.u17.t170, i0.i0.i0.i1.i0.i0.u17.t172, i0.i0.i1.u26.t96, i0.i0.i1.u26.t97, i0.i0.i1.u26.t101, i0.i0.i1.u26.t103, i0.i0.i1.u26.t104, i0.i0.i1.i0.u25.t108, i0.i0.i1.i0.u25.t109, i0.i0.i1.i0.u25.t113, i0.i0.i1.i0.u25.t115, i0.i0.i1.i0.u25.t116, i0.i0.i1.i0.i0.u23.t129, i0.i0.i1.i0.i0.u23.t130, i0.i0.i1.i0.i0.u23.t134, i0.i0.i1.i0.i0.u23.t136, i0.i0.i1.i0.i0.u23.t137, i0.i0.i1.i0.i0.u24.t120, i0.i0.i1.i0.i0.u24.t124, i0.i0.i1.i0.i0.u24.t126, i0.i1.u33.t50, i0.i1.u33.t51, i0.i1.u33.t55, i0.i1.u33.t57, i0.i1.u33.t58, i0.i1.i0.u32.t62, i0.i1.i0.u32.t63, i0.i1.i0.u32.t67, i0.i1.i0.u32.t69, i0.i1.i0.u32.t70, i0.i1.i0.i0.u30.t83, i0.i1.i0.i0.u30.t84, i0.i1.i0.i0.u30.t88, i0.i1.i0.i0.u30.t90, i0.i1.i0.i0.u30.t91, i0.i1.i0.i0.u31.t74, i0.i1.i0.i0.u31.t78, i0.i1.i0.i0.u31.t80, i1.u40.t4, i1.u40.t5, i1.u40.t9, i1.u40.t11, i1.u40.t12, i1.i0.u39.t16, i1.i0.u39.t17, i1.i0.u39.t21, i1.i0.u39.t23, i1.i0.u39.t24, i1.i0.i0.u37.t37, i1.i0.i0.u37.t38, i1.i0.i0.u37.t42, i1.i0.i0.u37.t44, i1.i0.i0.u37.t45, i1.i0.i0.u38.t28, i1.i0.i0.u38.t32, i1.i0.i0.u38.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/91/253
Computing Next relation with stutter on 2025 deadlock states
Detected timeout of ITS tools.
[2020-05-28 02:30:04] [INFO ] Flatten gal took : 20 ms
[2020-05-28 02:30:04] [INFO ] Input system was already deterministic with 253 transitions.
[2020-05-28 02:30:04] [INFO ] Transformed 253 places.
[2020-05-28 02:30:04] [INFO ] Transformed 253 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:30:04] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-28 02:30:04] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 14 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 9 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("(p241==1)")U(X(G(F(("(p33==1)")U(G("(p236==1)"))))))))
Formula 0 simplified : !("(p241==1)" U XGF("(p33==1)" U G"(p236==1)"))
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t9, t11, t12, t16, t17, t21, t23, t24, t28, t32, t34, t37, t38, t42, t44, t45, t50, t51, t55, t57, t58, t62, t63, t67, t69, t70, t74, t78, t80, t83, t84, t88, t90, t91, t96, t97, t101, t103, t104, t108, t109, t113, t115, t116, t120, t124, t126, t129, t130, t134, t136, t137, t142, t143, t147, t149, t150, t154, t155, t159, t161, t162, t166, t170, t172, t175, t176, t180, t182, t183, t188, t189, t193, t195, t196, t200, t201, t205, t207, t208, t212, t216, t218, t221, t222, t226, t228, t229, t230, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/162/91/253
Computing Next relation with stutter on 2025 deadlock states

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-005B"
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-005B, 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-159033476500994"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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