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-158961257800529.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257800529
=====================================================================

--------------------
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 1590000682648

[2020-05-20 18:51:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 18:51:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:24] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2020-05-20 18:51:24] [INFO ] Transformed 305 places.
[2020-05-20 18:51:24] [INFO ] Transformed 433 transitions.
[2020-05-20 18:51:24] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:24] [INFO ] Parsed PT model containing 305 places and 433 transitions in 160 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1282 resets, run finished after 451 ms. (steps per millisecond=221 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 257 rows 305 cols
[2020-05-20 18:51:25] [INFO ] Computed 76 place invariants in 16 ms
[2020-05-20 18:51:25] [INFO ] [Real]Absence check using 72 positive place invariants in 56 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:26] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2020-05-20 18:51:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:26] [INFO ] [Nat]Absence check using 72 positive place invariants in 47 ms returned sat
[2020-05-20 18:51:26] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:26] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2020-05-20 18:51:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2020-05-20 18:51:26] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:51:26] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-05-20 18:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2020-05-20 18:51:26] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 71 ms.
[2020-05-20 18:51:28] [INFO ] Added : 219 causal constraints over 44 iterations in 1403 ms. Result :sat
[2020-05-20 18:51:28] [INFO ] [Real]Absence check using 72 positive place invariants in 54 ms returned sat
[2020-05-20 18:51:28] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 18:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:28] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[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 16 ms returned unsat
[2020-05-20 18:51:28] [INFO ] [Real]Absence check using 72 positive place invariants in 46 ms returned sat
[2020-05-20 18:51:28] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:29] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2020-05-20 18:51:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:29] [INFO ] [Nat]Absence check using 72 positive place invariants in 10 ms returned unsat
[2020-05-20 18:51:29] [INFO ] [Real]Absence check using 72 positive place invariants in 43 ms returned sat
[2020-05-20 18:51:29] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:29] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-05-20 18:51:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:29] [INFO ] [Nat]Absence check using 72 positive place invariants in 52 ms returned sat
[2020-05-20 18:51:29] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:30] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2020-05-20 18:51:30] [INFO ] [Nat]Added 60 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:51:30] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 24 ms.
[2020-05-20 18:51:31] [INFO ] Added : 230 causal constraints over 47 iterations in 1324 ms. Result :sat
[2020-05-20 18:51:31] [INFO ] Deduced a trap composed of 32 places in 31 ms
[2020-05-20 18:51:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2020-05-20 18:51:31] [INFO ] [Real]Absence check using 72 positive place invariants in 34 ms returned sat
[2020-05-20 18:51:31] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 2 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 273 ms returned sat
[2020-05-20 18:51:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:32] [INFO ] [Nat]Absence check using 72 positive place invariants in 42 ms returned sat
[2020-05-20 18:51:32] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:32] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2020-05-20 18:51:32] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2020-05-20 18:51:32] [INFO ] Deduced a trap composed of 36 places in 36 ms
[2020-05-20 18:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-05-20 18:51:32] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 21 ms.
[2020-05-20 18:51:33] [INFO ] Added : 248 causal constraints over 50 iterations in 1306 ms. Result :sat
[2020-05-20 18:51:33] [INFO ] [Real]Absence check using 72 positive place invariants in 31 ms returned sat
[2020-05-20 18:51:33] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:34] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[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 9 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-20 18:51:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-20 18:51:34] [INFO ] Flatten gal took : 107 ms
FORMULA Parking-PT-416-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:51:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-20 18:51:34] [INFO ] Flatten gal took : 22 ms
[2020-05-20 18:51:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Parking-PT-416-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:51:34] [INFO ] Applying decomposition
[2020-05-20 18:51:34] [INFO ] Flatten gal took : 36 ms
[2020-05-20 18:51:34] [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/graph14553198761166112451.txt, -o, /tmp/graph14553198761166112451.bin, -w, /tmp/graph14553198761166112451.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/graph14553198761166112451.bin, -l, -1, -v, -w, /tmp/graph14553198761166112451.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 257 rows 305 cols
[2020-05-20 18:51:34] [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:34] [INFO ] Computed 76 place invariants in 7 ms
[2020-05-20 18:51:35] [INFO ] Decomposing Gal with order
[2020-05-20 18:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 18:51:35] [INFO ] Removed a total of 8 redundant transitions.
[2020-05-20 18:51:35] [INFO ] Flatten gal took : 158 ms
[2020-05-20 18:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-20 18:51:35] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 9 ms
[2020-05-20 18:51:35] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !((!(X("((i6.u54.p159==0)||(i14.u79.p259==1))"))))
Formula 0 simplified : X"((i6.u54.p159==0)||(i14.u79.p259==1))"
built 36 ordering constraints for composite.
built 23 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 14 ordering constraints for composite.
built 23 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 27 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 23 ordering constraints for composite.
built 5 ordering constraints for composite.
built 13 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 12 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t346, t374, t402, t430, i2.t431, i2.t429, i2.t428, i5.u33.t178, i5.u33.t180, i6.t403, i6.t401, i6.t400, i10.u55.t120, i10.u55.t122, i11.u76.t62, i11.u76.t64, i12.t375, i12.t373, i12.t372, i14.t347, i14.t345, i14.t344, i18.u98.t4, i18.u98.t6, 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
28 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.345598,27476,1,0,28569,5060,2940,30084,853,10270,43217
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Parking-PT-416-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("((i13.u64.p182==0)||(i0.u63.p180==1))")U("(((i4.u28.p78==0)||(i18.u98.p256==1))||(i14.u97.p273==1))"))))
Formula 1 simplified : !G("((i13.u64.p182==0)||(i0.u63.p180==1))" U "(((i4.u28.p78==0)||(i18.u98.p256==1))||(i14.u97.p273==1))")
Computing Next relation with stutter on 130321 deadlock states
[2020-05-20 18:51:36] [INFO ] Proved 305 variables to be positive in 1251 ms
[2020-05-20 18:51:36] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2020-05-20 18:51:36] [INFO ] Computation of disable matrix completed :0/257 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:51:36] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:51:36] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2020-05-20 18:51:36] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
51 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.854216,48400,1,0,80813,6235,3521,99851,891,16336,116324
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 : !((F(G((G((X("((i6.u44.p128==0)||(i2.u32.p71==1))"))||(F(G("((i10.u45.p132==0)||(i2.u18.p37==1))")))))U(F(G("((i3.u1.p3==0)||(i5.u23.p60==1))")))))))
Formula 2 simplified : !FG(G(X"((i6.u44.p128==0)||(i2.u32.p71==1))" | FG"((i10.u45.p132==0)||(i2.u18.p37==1))") U FG"((i3.u1.p3==0)||(i5.u23.p60==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
57 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.41512,71384,1,0,136379,6351,3582,182612,891,17140,181989
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-416-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X("((i8.u50.p150==0)||(i18.u90.p279==1))"))))
Formula 3 simplified : !FX"((i8.u50.p150==0)||(i18.u90.p279==1))"
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
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41664,71648,1,0,136379,6351,3604,182612,892,17140,182015
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Parking-PT-416-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(F("(i10.u55.p163==1)"))))
Formula 4 simplified : F"(i10.u55.p163==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
12 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.5388,76400,1,0,150417,6376,3646,195259,893,17392,203175
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-416-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(!(X(X((X("((i15.u73.p222==0)||(i14.u81.p243==1))"))&&("((i3.u26.p73==0)||(i13.u64.p182==1))"))))))))
Formula 5 simplified : !XF!XX("((i3.u26.p73==0)||(i13.u64.p182==1))" & X"((i15.u73.p222==0)||(i14.u81.p243==1))")
Computing Next relation with stutter on 130321 deadlock states
[2020-05-20 18:51:37] [INFO ] Computing symmetric co enabling matrix : 257 transitions.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
81 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.35177,103592,1,0,215101,6662,3704,298745,893,18305,287486
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-416-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X(("((i16.u94.p289==0)||(i8.u35.p98==1))")U((X(X("((i5.u33.p53!=0)&&(i0.u61.p176!=1))")))&&("((i16.u94.p289==0)||(i8.u35.p98==1))"))))))
Formula 6 simplified : X("((i16.u94.p289==0)||(i8.u35.p98==1))" U ("((i16.u94.p289==0)||(i8.u35.p98==1))" & XX"((i5.u33.p53!=0)&&(i0.u61.p176!=1))"))
Computing Next relation with stutter on 130321 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
26 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.60159,114136,1,0,244432,6689,3748,331717,895,18560,326114
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-416-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(!(X(G("((i18.u88.p272==0)||(i8.u50.p148==1))"))))))
Formula 7 simplified : !G!XG"((i18.u88.p272==0)||(i8.u50.p148==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
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,2.61668,114664,1,0,245650,6704,3771,332837,896,18645,328389
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-416-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!((G(!(("((i14.u83.p247==0)||(i5.u33.p94==1))")U("((i5.u33.p54==0)||(i10.u55.p116==1))"))))U(X("((i14.u83.p247==0)||(i5.u33.p94==1))")))))
Formula 8 simplified : G!("((i14.u83.p247==0)||(i5.u33.p94==1))" U "((i5.u33.p54==0)||(i10.u55.p116==1))") U X"((i14.u83.p247==0)||(i5.u33.p94==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.62038,114912,1,0,245712,6704,3785,332898,897,18645,328638
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-416-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(((F(G(!(X("((i18.u98.p264==0)||(i6.u36.p100==1))")))))||("(i4.u29.p80==1)"))U((("((i14.u97.p257==0)||(i15.u73.p222==1))")U("((i14.u97.p257!=0)&&(i15.u73.p222!=1))"))&&("((i14.u97.p257==0)||(i15.u73.p222==1))")))))
Formula 9 simplified : !F(("(i4.u29.p80==1)" | FG!X"((i18.u98.p264==0)||(i6.u36.p100==1))") U ("((i14.u97.p257==0)||(i15.u73.p222==1))" & ("((i14.u97.p257==0)||(i15.u73.p222==1))" U "((i14.u97.p257!=0)&&(i15.u73.p222!=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
7 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.7001,118060,1,0,253777,6845,3826,342993,898,19244,340620
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-416-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Could not set logic :(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:104)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:381)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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:38] [INFO ] Built C files in 4121ms 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 1590000698938

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-416"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-416, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961257800529"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;