Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800530.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Parking-PT-416, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800530
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 4.0K Apr 11 23:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 11 23:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 22:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 22:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 07:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 07:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 12:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 107K Mar 24 05:37 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 Parking-PT-416-00
FORMULA_NAME Parking-PT-416-01
FORMULA_NAME Parking-PT-416-02
FORMULA_NAME Parking-PT-416-03
FORMULA_NAME Parking-PT-416-04
FORMULA_NAME Parking-PT-416-05
FORMULA_NAME Parking-PT-416-06
FORMULA_NAME Parking-PT-416-07
FORMULA_NAME Parking-PT-416-08
FORMULA_NAME Parking-PT-416-09
FORMULA_NAME Parking-PT-416-10
FORMULA_NAME Parking-PT-416-11
FORMULA_NAME Parking-PT-416-12
FORMULA_NAME Parking-PT-416-13
FORMULA_NAME Parking-PT-416-14
FORMULA_NAME Parking-PT-416-15

=== Now, execution of the tool begins

BK_START 1590000683557

[2020-05-20 18:51:26] [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-20 18:51:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:26] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2020-05-20 18:51:26] [INFO ] Transformed 305 places.
[2020-05-20 18:51:26] [INFO ] Transformed 433 transitions.
[2020-05-20 18:51:26] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:26] [INFO ] Parsed PT model containing 305 places and 433 transitions in 182 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1282 resets, run finished after 527 ms. (steps per millisecond=189 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 257 rows 305 cols
[2020-05-20 18:51:27] [INFO ] Computed 76 place invariants in 15 ms
[2020-05-20 18:51:27] [INFO ] [Real]Absence check using 72 positive place invariants in 63 ms returned sat
[2020-05-20 18:51:27] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 11 ms returned sat
[2020-05-20 18:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:27] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2020-05-20 18:51:28] [INFO ] State equation strengthened by 60 read => feed constraints.
[2020-05-20 18:51:28] [INFO ] [Real]Added 60 Read/Feed constraints in 15 ms returned sat
[2020-05-20 18:51:28] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 31 ms.
[2020-05-20 18:51:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:28] [INFO ] [Nat]Absence check using 72 positive place invariants in 40 ms returned sat
[2020-05-20 18:51:28] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 18:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:29] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2020-05-20 18:51:29] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2020-05-20 18:51:29] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 34 ms.
[2020-05-20 18:51:31] [INFO ] Added : 251 causal constraints over 51 iterations in 1938 ms. Result :sat
[2020-05-20 18:51:31] [INFO ] Deduced a trap composed of 36 places in 79 ms
[2020-05-20 18:51:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2020-05-20 18:51:31] [INFO ] [Real]Absence check using 72 positive place invariants in 110 ms returned sat
[2020-05-20 18:51:31] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 18:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:31] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-05-20 18:51:31] [INFO ] [Real]Added 60 Read/Feed constraints in 30 ms returned sat
[2020-05-20 18:51:31] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 40 ms.
[2020-05-20 18:51:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:31] [INFO ] [Nat]Absence check using 72 positive place invariants in 38 ms returned sat
[2020-05-20 18:51:31] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-20 18:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:32] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-05-20 18:51:32] [INFO ] [Nat]Added 60 Read/Feed constraints in 33 ms returned sat
[2020-05-20 18:51:32] [INFO ] Deduced a trap composed of 36 places in 51 ms
[2020-05-20 18:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2020-05-20 18:51:32] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 16 ms.
[2020-05-20 18:51:33] [INFO ] Added : 246 causal constraints over 50 iterations in 1444 ms. Result :sat
[2020-05-20 18:51:34] [INFO ] [Real]Absence check using 72 positive place invariants in 100 ms returned unsat
[2020-05-20 18:51:34] [INFO ] [Real]Absence check using 72 positive place invariants in 55 ms returned sat
[2020-05-20 18:51:34] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:34] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2020-05-20 18:51:34] [INFO ] [Real]Added 60 Read/Feed constraints in 14 ms returned sat
[2020-05-20 18:51:34] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 48 ms.
[2020-05-20 18:51:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:34] [INFO ] [Nat]Absence check using 72 positive place invariants in 41 ms returned sat
[2020-05-20 18:51:34] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:35] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2020-05-20 18:51:35] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:51:35] [INFO ] Deduced a trap composed of 36 places in 55 ms
[2020-05-20 18:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-05-20 18:51:35] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 18 ms.
[2020-05-20 18:51:36] [INFO ] Added : 237 causal constraints over 48 iterations in 1341 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-20 18:51:37] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-20 18:51:37] [INFO ] Flatten gal took : 132 ms
FORMULA Parking-PT-416-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:51:37] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:51:37] [INFO ] Applying decomposition
[2020-05-20 18:51:37] [INFO ] Flatten gal took : 68 ms
[2020-05-20 18:51:37] [INFO ] Input system was already deterministic with 257 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/graph17457669887504144848.txt, -o, /tmp/graph17457669887504144848.bin, -w, /tmp/graph17457669887504144848.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/graph17457669887504144848.bin, -l, -1, -v, -w, /tmp/graph17457669887504144848.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:51:37] [INFO ] Decomposing Gal with order
[2020-05-20 18:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:51:38] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-20 18:51:38] [INFO ] Flatten gal took : 129 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 257 rows 305 cols
[2020-05-20 18:51:38] [INFO ] Computed 76 place invariants in 5 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 = 1
inv : p0 + p95 + p96 = 1
inv : 5*p0 + p188 + p196 + p204 + p212 + p228 + p230 = 5
inv : p0 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 = 1
inv : p0 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 = 1
inv : -4*p0 + p181 + p182 + p183 + p184 + p185 + p186 + p187 - p196 - p204 - p212 - p228 - p230 = -4
inv : p0 + p241 + p242 = 1
inv : 5*p0 + p48 + p56 + p64 + p72 + p88 + p90 = 5
inv : p0 + p175 + p176 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 = 1
inv : p0 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 = 1
inv : -4*p0 + p111 + p112 + p113 + p114 + p115 + p116 + p117 - p126 - p134 - p142 - p158 - p160 = -4
inv : p0 + p89 + p90 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p171 + p172 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 = 1
inv : p0 + p165 + p166 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : -4*p0 + p251 + p252 + p253 + p254 + p255 + p256 + p257 - p266 - p274 - p282 - p298 - p300 = -4
inv : p0 + p7 + p8 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p173 + p174 = 1
inv : 5*p0 + p118 + p126 + p134 + p142 + p158 + p160 = 5
inv : p0 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p91 + p92 + p93 + p94 = 1
inv : p0 + p161 + p162 + p163 + p164 = 1
inv : p0 + p3 + p4 = 1
inv : 5*p0 + p258 + p266 + p274 + p282 + p298 + p300 = 5
inv : p0 + p23 + p24 = 1
inv : -4*p0 + p41 + p42 + p43 + p44 + p45 + p46 + p47 - p56 - p64 - p72 - p88 - p90 = -4
inv : p0 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 = 1
inv : p0 + p239 + p240 = 1
inv : p0 + p169 + p170 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p231 + p232 + p233 + p234 = 1
inv : p0 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p167 + p168 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 = 1
inv : p0 + p301 + p302 + p303 + p304 = 1
inv : p0 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 = 1
inv : p0 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p243 + p244 = 1
inv : p0 + p249 + p250 = 1
Total of 76 invariants.
[2020-05-20 18:51:38] [INFO ] Computed 76 place invariants in 6 ms
[2020-05-20 18:51:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2020-05-20 18:51:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-20 18:51:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 15 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 13 LTL properties
Checking formula 0 : !(((!(X(("(i13.i1.u69.p208==1)")U("((i3.i2.u24.p65==1)&&(i3.i2.u32.p90==1))"))))||(F("((i13.i0.u76.p196==1)&&(i13.i0.u76.p229==1))"))))
Formula 0 simplified : !(!X("(i13.i1.u69.p208==1)" U "((i3.i2.u24.p65==1)&&(i3.i2.u32.p90==1))") | F"((i13.i0.u76.p196==1)&&(i13.i0.u76.p229==1))")
built 32 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 18 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 21 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 21 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t345, t346, t373, t374, t402, t429, t430, i3.t431, i3.i1.u33.t178, i3.i1.u33.t180, i3.i2.t428, i6.t403, i6.t401, i6.i0.t400, i8.u55.t120, i8.u55.t122, i13.t375, i13.i0.t372, i13.i1.u77.t62, i13.i1.u77.t64, i17.t347, i17.i1.u99.t4, i17.i1.u99.t6, i17.i2.t344, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/233/24/257
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
55 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.687303,27004,1,0,25211,6916,3252,29044,860,13823,41728
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-416-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((F("((i8.u45.p129!=1)||(i8.u55.p164!=1))"))U(G(F((((G(X("((i17.i2.u98.p274==1)&&(i17.i2.u98.p299==1))")))&&("(i16.u78.p236==1)"))&&("(i16.u86.p253==1)"))&&("(i11.i1.u63.p180==1)")))))))
Formula 1 simplified : !F(F"((i8.u45.p129!=1)||(i8.u55.p164!=1))" U GF("(i11.i1.u63.p180==1)" & "(i16.u78.p236==1)" & "(i16.u86.p253==1)" & GX"((i17.i2.u98.p274==1)&&(i17.i2.u98.p299==1))"))
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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.921522,33720,1,0,33829,8165,3889,43284,902,19117,62097
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-416-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(F((!(F(G(F("((i9.i0.u3.p8==1)&&(i9.i0.u48.p144==1))")))))&&(!(F("(i11.i0.u0.p2==1)"))))))))
Formula 2 simplified : XF(!FGF"((i9.i0.u3.p8==1)&&(i9.i0.u48.p144==1))" & !F"(i11.i0.u0.p2==1)")
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.940431,34216,1,0,35674,8175,3949,46223,902,19204,64071
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-416-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X((F((G("(i1.u20.p44==1)"))&&("(i15.u87.p262==1)")))&&(G("(i9.i1.u5.p12==1)"))))))
Formula 3 simplified : !GX(F("(i15.u87.p262==1)" & G"(i1.u20.p44==1)") & G"(i9.i1.u5.p12==1)")
Computing Next relation with stutter on 130321 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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.97814,35628,1,0,39718,8212,3975,50197,904,19344,69473
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-416-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F(X(F(G((X(!(X(X("(i13.i1.u77.p234==1)")))))U("(i13.i1.u77.p234==1)"))))))))
Formula 4 simplified : !GFXFG(X!XX"(i13.i1.u77.p234==1)" U "(i13.i1.u77.p234==1)")
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 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,1.01428,36368,1,0,40912,8286,4002,52938,904,19956,70775
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-416-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(!(F("((i3.i1.u33.p53==1)&&(i3.i1.u33.p94==1))"))))))
Formula 5 simplified : !GF!F"((i3.i1.u33.p53==1)&&(i3.i1.u33.p94==1))"
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
129 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.30373,80984,1,0,163104,8604,4073,179863,907,23001,208619
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-416-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(X(!(("((i5.u34.p111==1)&&(i6.i0.u54.p160==1))")U(F("((i5.u34.p111==1)&&(i6.i0.u54.p160==1))"))))))))
Formula 6 simplified : !XXX!("((i5.u34.p111==1)&&(i6.i0.u54.p160==1))" U F"((i5.u34.p111==1)&&(i6.i0.u54.p160==1))")
Computing Next relation with stutter on 130321 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
31 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.61343,92072,1,0,191142,8614,4120,207010,908,23066,253730
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-416-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G((X((X(X("(i3.i1.u25.p68==1)")))&&("(i3.i1.u25.p68==1)")))&&(F("(i3.i1.u25.p68==1)"))))&&(X("(i3.i1.u25.p68==1)"))))
Formula 7 simplified : !(X"(i3.i1.u25.p68==1)" & G(X("(i3.i1.u25.p68==1)" & XX"(i3.i1.u25.p68==1)") & F"(i3.i1.u25.p68==1)"))
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.6175,92336,1,0,191176,8614,4131,207055,908,23066,253960
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-416-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(i13.i1.u67.p201==1)")))
Formula 8 simplified : !F"(i13.i1.u67.p201==1)"
Computing Next relation with stutter on 130321 deadlock states
[2020-05-20 18:51:41] [INFO ] Proved 305 variables to be positive in 2954 ms
[2020-05-20 18:51:41] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2020-05-20 18:51:41] [INFO ] Computation of disable matrix completed :0/257 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:51:41] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:51:41] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2020-05-20 18:51:41] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
19 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.80072,94448,1,0,196710,8673,4148,215018,908,23568,262347
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-416-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((("(i12.i2.u11.p24==1)")U("(i7.i0.u41.p110==1)"))&&(F("(i8.u47.p138==1)")))U((!(G(X(G("(i12.i2.u11.p24==1)")))))||(F("((i14.i1.u83.p245==1)&&(i17.i2.u98.p273==1))")))))
Formula 9 simplified : !((("(i12.i2.u11.p24==1)" U "(i7.i0.u41.p110==1)") & F"(i8.u47.p138==1)") U (!GXG"(i12.i2.u11.p24==1)" | F"((i14.i1.u83.p245==1)&&(i17.i2.u98.p273==1))"))
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
13 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.93121,98928,1,0,206985,8926,4187,234957,909,24913,273680
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-416-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G((F(G("(i13.i1.u67.p200==1)")))U(("((i4.i1.u19.p40!=1)||(i4.i1.u28.p80!=1))")U(!(G(F("(i13.i1.u67.p200==1)")))))))))
Formula 10 simplified : !FG(FG"(i13.i1.u67.p200==1)" U ("((i4.i1.u19.p40!=1)||(i4.i1.u28.p80!=1))" U !GF"(i13.i1.u67.p200==1)"))
Computing Next relation with stutter on 130321 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
61 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,3.54425,113172,1,0,242496,9032,4205,292401,909,25699,310079
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-416-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(F((!(F(X(((!(X("(i9.i0.u4.p10==1)")))&&("(i17.i1.u99.p256==1)"))&&("(i17.i1.u99.p303==1)")))))&&(F("((i1.u12.p25==1)&&(i1.u30.p84==1))"))))))
Formula 11 simplified : F(!FX("(i17.i1.u99.p256==1)" & "(i17.i1.u99.p303==1)" & !X"(i9.i0.u4.p10==1)") & F"((i1.u12.p25==1)&&(i1.u30.p84==1))")
Computing Next relation with stutter on 130321 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
8 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,3.6136,114492,1,0,246311,9046,4295,296380,916,25823,316484
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-416-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((((X(!(F("((i0.i0.u6.p14==1)&&(i0.i1.u70.p214==1))"))))U("(i8.u45.p131==1)"))&&(!(F("(i3.i1.u23.p60==1)")))))
Formula 12 simplified : !((X!F"((i0.i0.u6.p14==1)&&(i0.i1.u70.p214==1))" U "(i8.u45.p131==1)") & !F"(i3.i1.u23.p60==1)")
Computing Next relation with stutter on 130321 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
219 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,5.81114,184716,1,0,413342,9095,4408,540581,916,26449,507103
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-416-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-20 18:51:45] [INFO ] Computing symmetric co enabling matrix : 257 transitions.
[2020-05-20 18:51:45] [INFO ] Computation of co-enabling matrix(0/257) took 328 ms. Total solver calls (SAT/UNSAT): 256(0/256)
[2020-05-20 18:51:48] [INFO ] Computation of co-enabling matrix(143/257) took 3346 ms. Total solver calls (SAT/UNSAT): 1354(348/1006)
[2020-05-20 18:51:51] [INFO ] Computation of Finished co-enabling matrix. took 5773 ms. Total solver calls (SAT/UNSAT): 1956(548/1408)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-20 18:51:51] [INFO ] Built C files in 14022ms 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 1590000711747

--------------------
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="Parking-PT-416"
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 Parking-PT-416, 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 r111-csrt-158961257800530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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