fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257800545
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for Parking-PT-832

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.570 1762467.00 1936261.00 351.20 TFFTTTFTFFTFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 3.6K Apr 12 00:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 00:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 23:07 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.0K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.1K Apr 10 07:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 07:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 12:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 12:23 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 251K 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-832-00
FORMULA_NAME Parking-PT-832-01
FORMULA_NAME Parking-PT-832-02
FORMULA_NAME Parking-PT-832-03
FORMULA_NAME Parking-PT-832-04
FORMULA_NAME Parking-PT-832-05
FORMULA_NAME Parking-PT-832-06
FORMULA_NAME Parking-PT-832-07
FORMULA_NAME Parking-PT-832-08
FORMULA_NAME Parking-PT-832-09
FORMULA_NAME Parking-PT-832-10
FORMULA_NAME Parking-PT-832-11
FORMULA_NAME Parking-PT-832-12
FORMULA_NAME Parking-PT-832-13
FORMULA_NAME Parking-PT-832-14
FORMULA_NAME Parking-PT-832-15

=== Now, execution of the tool begins

BK_START 1590000741618

[2020-05-20 18:52:23] [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:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:52:24] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2020-05-20 18:52:24] [INFO ] Transformed 737 places.
[2020-05-20 18:52:24] [INFO ] Transformed 993 transitions.
[2020-05-20 18:52:24] [INFO ] Found NUPN structural information;
[2020-05-20 18:52:24] [INFO ] Parsed PT model containing 737 places and 993 transitions in 185 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 506 resets, run finished after 884 ms. (steps per millisecond=113 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 609 rows 737 cols
[2020-05-20 18:52:25] [INFO ] Computed 184 place invariants in 27 ms
[2020-05-20 18:52:25] [INFO ] [Real]Absence check using 176 positive place invariants in 285 ms returned sat
[2020-05-20 18:52:25] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 19 ms returned sat
[2020-05-20 18:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:27] [INFO ] [Real]Absence check using state equation in 1542 ms returned sat
[2020-05-20 18:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:27] [INFO ] [Nat]Absence check using 176 positive place invariants in 185 ms returned sat
[2020-05-20 18:52:27] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-20 18:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:29] [INFO ] [Nat]Absence check using state equation in 1875 ms returned sat
[2020-05-20 18:52:29] [INFO ] State equation strengthened by 152 read => feed constraints.
[2020-05-20 18:52:29] [INFO ] [Nat]Added 152 Read/Feed constraints in 53 ms returned sat
[2020-05-20 18:52:30] [INFO ] Deduced a trap composed of 47 places in 373 ms
[2020-05-20 18:52:30] [INFO ] Deduced a trap composed of 40 places in 116 ms
[2020-05-20 18:52:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 648 ms
[2020-05-20 18:52:30] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 59 ms.
[2020-05-20 18:52:37] [INFO ] Added : 547 causal constraints over 110 iterations in 7413 ms. Result :sat
[2020-05-20 18:52:37] [INFO ] Deduced a trap composed of 44 places in 61 ms
[2020-05-20 18:52:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2020-05-20 18:52:38] [INFO ] [Real]Absence check using 176 positive place invariants in 142 ms returned sat
[2020-05-20 18:52:38] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-20 18:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:39] [INFO ] [Real]Absence check using state equation in 1446 ms returned sat
[2020-05-20 18:52:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:40] [INFO ] [Nat]Absence check using 176 positive place invariants in 34 ms returned unsat
[2020-05-20 18:52:40] [INFO ] [Real]Absence check using 176 positive place invariants in 104 ms returned sat
[2020-05-20 18:52:40] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-20 18:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:41] [INFO ] [Real]Absence check using state equation in 1487 ms returned sat
[2020-05-20 18:52:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:42] [INFO ] [Nat]Absence check using 176 positive place invariants in 33 ms returned unsat
[2020-05-20 18:52:42] [INFO ] [Real]Absence check using 176 positive place invariants in 107 ms returned sat
[2020-05-20 18:52:42] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-20 18:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:43] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2020-05-20 18:52:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:44] [INFO ] [Nat]Absence check using 176 positive place invariants in 102 ms returned sat
[2020-05-20 18:52:44] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-20 18:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:45] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2020-05-20 18:52:45] [INFO ] [Nat]Added 152 Read/Feed constraints in 27 ms returned sat
[2020-05-20 18:52:45] [INFO ] Deduced a trap composed of 40 places in 68 ms
[2020-05-20 18:52:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2020-05-20 18:52:45] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 63 ms.
[2020-05-20 18:52:51] [INFO ] Added : 521 causal constraints over 105 iterations in 6195 ms. Result :sat
[2020-05-20 18:52:52] [INFO ] Deduced a trap composed of 44 places in 143 ms
[2020-05-20 18:52:52] [INFO ] Deduced a trap composed of 44 places in 98 ms
[2020-05-20 18:52:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2020-05-20 18:52:52] [INFO ] [Real]Absence check using 176 positive place invariants in 114 ms returned sat
[2020-05-20 18:52:52] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 9 ms returned sat
[2020-05-20 18:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:53] [INFO ] [Real]Absence check using state equation in 1320 ms returned sat
[2020-05-20 18:52:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:54] [INFO ] [Nat]Absence check using 176 positive place invariants in 30 ms returned unsat
[2020-05-20 18:52:54] [INFO ] [Real]Absence check using 176 positive place invariants in 106 ms returned sat
[2020-05-20 18:52:54] [INFO ] [Real]Absence check using 176 positive and 8 generalized place invariants in 16 ms returned sat
[2020-05-20 18:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:55] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2020-05-20 18:52:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:56] [INFO ] [Nat]Absence check using 176 positive place invariants in 122 ms returned sat
[2020-05-20 18:52:56] [INFO ] [Nat]Absence check using 176 positive and 8 generalized place invariants in 16 ms returned sat
[2020-05-20 18:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:57] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2020-05-20 18:52:57] [INFO ] [Nat]Added 152 Read/Feed constraints in 29 ms returned sat
[2020-05-20 18:52:57] [INFO ] Deduced a trap composed of 40 places in 139 ms
[2020-05-20 18:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2020-05-20 18:52:57] [INFO ] Computed and/alt/rep : 608/1920/608 causal constraints in 52 ms.
[2020-05-20 18:53:05] [INFO ] Added : 576 causal constraints over 116 iterations in 7770 ms. Result :sat
[2020-05-20 18:53:06] [INFO ] Deduced a trap composed of 44 places in 818 ms
[2020-05-20 18:53:07] [INFO ] Deduced a trap composed of 44 places in 853 ms
[2020-05-20 18:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1987 ms
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-20 18:53:07] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-20 18:53:07] [INFO ] Flatten gal took : 226 ms
FORMULA Parking-PT-832-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:53:07] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-20 18:53:07] [INFO ] Flatten gal took : 50 ms
[2020-05-20 18:53:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Parking-PT-832-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-832-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:53:08] [INFO ] Applying decomposition
[2020-05-20 18:53:08] [INFO ] Flatten gal took : 78 ms
[2020-05-20 18:53:08] [INFO ] Input system was already deterministic with 609 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/graph5060116356452421663.txt, -o, /tmp/graph5060116356452421663.bin, -w, /tmp/graph5060116356452421663.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/graph5060116356452421663.bin, -l, -1, -v, -w, /tmp/graph5060116356452421663.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:53:08] [INFO ] Decomposing Gal with order
[2020-05-20 18:53:08] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 609 rows 737 cols
[2020-05-20 18:53:08] [INFO ] Computed 184 place invariants in 16 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p343 + p344 + p345 + p346 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p667 + p668 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p55 + p56 = 1
inv : 5*p0 + p448 + p456 + p464 + p472 + p496 + p498 = 5
inv : p0 + p15 + p16 = 1
inv : p0 + p587 + p588 = 1
inv : p0 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 = 1
inv : -4*p0 + p285 + p286 + p287 + p288 + p289 + p290 + p291 - p300 - p308 - p316 - p340 - p342 = -4
inv : p0 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p65 + p66 = 1
inv : 5*p0 + p370 + p378 + p386 + p394 + p418 + p420 = 5
inv : p0 + p75 + p76 = 1
inv : p0 + p437 + p438 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p507 + p508 = 1
inv : p0 + p125 + p126 = 1
inv : 5*p0 + p526 + p534 + p542 + p550 + p574 + p576 = 5
inv : p0 + p105 + p106 = 1
inv : p0 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 = 1
inv : p0 + p265 + p266 + p267 + p268 = 1
inv : p0 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 = 1
inv : p0 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p659 + p660 = 1
inv : p0 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 = 1
inv : p0 + p427 + p428 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p13 + p14 = 1
inv : 5*p0 + p214 + p222 + p230 + p238 + p262 + p264 = 5
inv : p0 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p595 + p596 = 1
inv : p0 + p205 + p206 = 1
inv : p0 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p0 + p665 + p666 = 1
inv : p0 + p357 + p358 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p275 + p276 = 1
inv : p0 + p203 + p204 = 1
inv : 5*p0 + p136 + p144 + p152 + p160 + p184 + p186 = 5
inv : p0 + p273 + p274 = 1
inv : p0 + p589 + p590 = 1
inv : -4*p0 + p129 + p130 + p131 + p132 + p133 + p134 + p135 - p144 - p152 - p160 - p184 - p186 = -4
inv : p0 + p283 + p284 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 = 1
inv : p0 + p193 + p194 = 1
inv : 5*p0 + p682 + p690 + p698 + p706 + p730 + p732 = 5
inv : p0 + p585 + p586 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 = 1
inv : p0 + p669 + p670 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p87 + p88 = 1
inv : -4*p0 + p441 + p442 + p443 + p444 + p445 + p446 + p447 - p456 - p464 - p472 - p496 - p498 = -4
inv : -4*p0 + p363 + p364 + p365 + p366 + p367 + p368 + p369 - p378 - p386 - p394 - p418 - p420 = -4
inv : p0 + p53 + p54 = 1
inv : p0 + p515 + p516 = 1
inv : p0 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 = 1
inv : p0 + p73 + p74 = 1
inv : -4*p0 + p675 + p676 + p677 + p678 + p679 + p680 + p681 - p690 - p698 - p706 - p730 - p732 = -4
inv : p0 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706 = 1
inv : p0 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p425 + p426 = 1
inv : p0 + p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 = 1
inv : p0 + p355 + p356 = 1
inv : p0 + p435 + p436 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 = 1
inv : 5*p0 + p604 + p612 + p620 + p628 + p652 + p654 = 5
inv : p0 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p577 + p578 + p579 + p580 = 1
inv : p0 + p517 + p518 = 1
inv : p0 + p505 + p506 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p575 + p576 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p351 + p352 = 1
inv : p0 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 = 1
inv : p0 + p655 + p656 + p657 + p658 = 1
inv : p0 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 = 1
inv : p0 + p673 + p674 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p431 + p432 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p271 + p272 = 1
inv : p0 + p361 + p362 = 1
inv : p0 + p661 + p662 = 1
inv : p0 + p591 + p592 = 1
inv : p0 + p201 + p202 = 1
inv : -4*p0 + p597 + p598 + p599 + p600 + p601 + p602 + p603 - p612 - p620 - p628 - p652 - p654 = -4
inv : -4*p0 + p207 + p208 + p209 + p210 + p211 + p212 + p213 - p222 - p230 - p238 - p262 - p264 = -4
inv : p0 + p119 + p120 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p513 + p514 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 = 1
inv : p0 + p653 + p654 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p433 + p434 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p503 + p504 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p583 + p584 = 1
inv : p0 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p281 + p282 = 1
inv : p0 + p671 + p672 = 1
inv : p0 + p509 + p510 = 1
inv : p0 + p429 + p430 = 1
inv : p0 + p419 + p420 = 1
inv : p0 + p499 + p500 + p501 + p502 = 1
inv : p0 + p187 + p188 + p189 + p190 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p359 + p360 = 1
inv : p0 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p439 + p440 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 = 1
inv : p0 + p279 + p280 = 1
inv : p0 + p733 + p734 + p735 + p736 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 = 1
inv : p0 + p349 + p350 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p93 + p94 = 1
inv : 5*p0 + p292 + p300 + p308 + p316 + p340 + p342 = 5
inv : p0 + p593 + p594 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p731 + p732 = 1
inv : p0 + p421 + p422 + p423 + p424 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p347 + p348 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p663 + p664 = 1
inv : p0 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 = 1
inv : p0 + p511 + p512 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 = 1
inv : p0 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 = 1
inv : p0 + p581 + p582 = 1
inv : -4*p0 + p519 + p520 + p521 + p522 + p523 + p524 + p525 - p534 - p542 - p550 - p574 - p576 = -4
inv : p0 + p185 + p186 = 1
Total of 184 invariants.
[2020-05-20 18:53:08] [INFO ] Computed 184 place invariants in 19 ms
[2020-05-20 18:53:08] [INFO ] Removed a total of 16 redundant transitions.
[2020-05-20 18:53:08] [INFO ] Flatten gal took : 142 ms
[2020-05-20 18:53:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2020-05-20 18:53:08] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 42 ms
[2020-05-20 18:53:08] [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 5 LTL properties
Checking formula 0 : !(((F(G(!(X(X(!(X(("((i12.u223.p623==0)||(i10.i0.i1.i1.u31.p63==1))")U("(i2.u62.p124==1)")))))))))&&(F("((i12.u223.p623==0)||(i10.i0.i1.i1.u31.p63==1))"))))
Formula 0 simplified : !(FG!XX!X("((i12.u223.p623==0)||(i10.i0.i1.i1.u31.p63==1))" U "(i2.u62.p124==1)") & F"((i12.u223.p623==0)||(i10.i0.i1.i1.u31.p63==1))")
built 41 ordering constraints for composite.
built 29 ordering constraints for composite.
built 39 ordering constraints for composite.
built 40 ordering constraints for composite.
built 50 ordering constraints for composite.
built 39 ordering constraints for composite.
built 14 ordering constraints for composite.
built 40 ordering constraints for composite.
built 42 ordering constraints for composite.
built 39 ordering constraints for composite.
built 40 ordering constraints for composite.
built 53 ordering constraints for composite.
built 41 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 24 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 42 ordering constraints for composite.
built 41 ordering constraints for composite.
[2020-05-20 18:53:12] [INFO ] Proved 737 variables to be positive in 3515 ms
[2020-05-20 18:53:12] [INFO ] Computing symmetric may disable matrix : 609 transitions.
[2020-05-20 18:53:12] [INFO ] Computation of disable matrix completed :0/609 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:53:12] [INFO ] Computation of Complete disable matrix. took 98 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:53:12] [INFO ] Computing symmetric may enable matrix : 609 transitions.
[2020-05-20 18:53:12] [INFO ] Computation of Complete enable matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:53:14] [INFO ] Computing symmetric co enabling matrix : 609 transitions.
[2020-05-20 18:53:17] [INFO ] Computation of co-enabling matrix(0/609) took 2200 ms. Total solver calls (SAT/UNSAT): 608(0/608)
[2020-05-20 18:53:20] [INFO ] Computation of co-enabling matrix(28/609) took 5249 ms. Total solver calls (SAT/UNSAT): 791(53/738)
[2020-05-20 18:53:23] [INFO ] Computation of co-enabling matrix(63/609) took 8266 ms. Total solver calls (SAT/UNSAT): 1000(144/856)
[2020-05-20 18:53:26] [INFO ] Computation of co-enabling matrix(94/609) took 11267 ms. Total solver calls (SAT/UNSAT): 1180(228/952)
[2020-05-20 18:53:29] [INFO ] Computation of co-enabling matrix(125/609) took 14280 ms. Total solver calls (SAT/UNSAT): 1395(312/1083)
[2020-05-20 18:53:32] [INFO ] Computation of co-enabling matrix(176/609) took 17313 ms. Total solver calls (SAT/UNSAT): 1576(392/1184)
[2020-05-20 18:53:35] [INFO ] Computation of co-enabling matrix(218/609) took 20317 ms. Total solver calls (SAT/UNSAT): 1748(483/1265)
Reverse transition relation is NOT exact ! Due to transitions i2.t991, i2.t990, i2.t989, i2.t988, i2.u82.t410, i2.u82.t412, i3.t963, i3.t962, i3.t961, i3.t960, i3.u107.t352, i3.u107.t354, i5.t935, i5.t934, i5.t933, i5.t932, i5.u133.t294, i5.u133.t296, i6.t907, i6.t906, i6.t905, i6.t904, i6.u158.t236, i6.u158.t238, i8.t879, i8.t878, i8.t877, i8.t876, i8.u184.t178, i8.u184.t180, i9.t851, i9.t850, i9.t849, i9.t848, i9.u209.t120, i9.u209.t122, i12.t823, i12.t822, i12.t821, i12.t820, i12.u234.t62, i12.u234.t64, i13.t795, i13.t794, i13.t793, i13.t792, i13.u259.t4, i13.u259.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/561/48/609
Computing Next relation with stutter on 7.8311e+10 deadlock states
[2020-05-20 18:53:38] [INFO ] Computation of co-enabling matrix(245/609) took 23366 ms. Total solver calls (SAT/UNSAT): 2014(613/1401)
[2020-05-20 18:53:41] [INFO ] Computation of co-enabling matrix(266/609) took 26382 ms. Total solver calls (SAT/UNSAT): 2207(697/1510)
[2020-05-20 18:53:44] [INFO ] Computation of co-enabling matrix(289/609) took 29494 ms. Total solver calls (SAT/UNSAT): 2577(728/1849)
[2020-05-20 18:53:47] [INFO ] Computation of co-enabling matrix(307/609) took 32888 ms. Total solver calls (SAT/UNSAT): 2897(728/2169)
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
3862 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,38.7431,872456,1,0,1.25791e+06,10113,8833,6.90991e+06,1114,33490,1192720
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(X(X(G(("(i13.u248.p703==1)")U("(i13.u248.p703==1)")))))))
Formula 1 simplified : XXG"(i13.u248.p703==1)"
Computing Next relation with stutter on 7.8311e+10 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,38.754,872772,1,0,1.25863e+06,10120,8852,6.9102e+06,1116,33492,1195431
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Parking-PT-832-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(F(G(X(X(X(!(X(F(G("((i11.u128.p332==0)||(i13.u244.p684==1))")))))))))))))
Formula 2 simplified : GFGXXX!XFG"((i11.u128.p332==0)||(i13.u244.p684==1))"
Computing Next relation with stutter on 7.8311e+10 deadlock states
[2020-05-20 18:53:50] [INFO ] Computation of co-enabling matrix(319/609) took 35916 ms. Total solver calls (SAT/UNSAT): 3101(728/2373)
[2020-05-20 18:53:53] [INFO ] Computation of co-enabling matrix(335/609) took 39031 ms. Total solver calls (SAT/UNSAT): 3375(728/2647)
[2020-05-20 18:53:57] [INFO ] Computation of co-enabling matrix(347/609) took 42312 ms. Total solver calls (SAT/UNSAT): 3575(728/2847)
[2020-05-20 18:54:00] [INFO ] Computation of co-enabling matrix(358/609) took 45559 ms. Total solver calls (SAT/UNSAT): 3749(728/3021)
[2020-05-20 18:54:03] [INFO ] Computation of co-enabling matrix(375/609) took 48899 ms. Total solver calls (SAT/UNSAT): 4042(728/3314)
[2020-05-20 18:54:06] [INFO ] Computation of co-enabling matrix(400/609) took 51932 ms. Total solver calls (SAT/UNSAT): 4266(758/3508)
[2020-05-20 18:54:09] [INFO ] Computation of co-enabling matrix(437/609) took 54940 ms. Total solver calls (SAT/UNSAT): 4461(825/3636)
[2020-05-20 18:54:12] [INFO ] Computation of co-enabling matrix(479/609) took 57965 ms. Total solver calls (SAT/UNSAT): 4680(908/3772)
[2020-05-20 18:54:15] [INFO ] Computation of co-enabling matrix(509/609) took 60978 ms. Total solver calls (SAT/UNSAT): 4843(958/3885)
[2020-05-20 18:54:18] [INFO ] Computation of co-enabling matrix(562/609) took 63996 ms. Total solver calls (SAT/UNSAT): 5115(1058/4057)
[2020-05-20 18:54:21] [INFO ] Computation of Finished co-enabling matrix. took 66646 ms. Total solver calls (SAT/UNSAT): 5352(1128/4224)
[2020-05-20 18:54:21] [INFO ] Computing Do-Not-Accords matrix : 609 transitions.
[2020-05-20 18:54:22] [INFO ] Computation of Completed DNA matrix. took 835 ms. Total solver calls (SAT/UNSAT): 72(0/72)
[2020-05-20 18:54:22] [INFO ] Built C files in 74394ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 9659 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( [](<>([](X(X(X(!( X(<>([]((LTLAP3==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(!( X(<>([]((LTLAP3==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(!( X(<>([]((LTLAP3==true))))) ))))))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-20 19:13:23] [INFO ] Applying decomposition
[2020-05-20 19:13:23] [INFO ] Flatten gal took : 76 ms
[2020-05-20 19:13:23] [INFO ] Decomposing Gal with order
[2020-05-20 19:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-20 19:13:23] [INFO ] Removed a total of 112 redundant transitions.
[2020-05-20 19:13:23] [INFO ] Flatten gal took : 109 ms
[2020-05-20 19:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 27 ms.
[2020-05-20 19:13:23] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 30 ms
[2020-05-20 19:13:23] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/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 3 LTL properties
Checking formula 0 : !((!(G(F(G(X(X(X(!(X(F(G("((u99.p332==0)||(u171.p684==1))")))))))))))))
Formula 0 simplified : GFGXXX!XFG"((u99.p332==0)||(u171.p684==1))"
built 313 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t792, t793, t794, t795, t820, t821, t822, t823, t848, t849, t850, t851, t876, t877, t878, t879, t904, t905, t906, t907, t932, t933, t934, t935, t960, t961, t962, t963, t988, t989, t990, t991, u71.t410, u71.t412, u86.t352, u86.t354, u101.t294, u101.t296, u116.t236, u116.t238, u131.t178, u131.t180, u146.t120, u146.t122, u161.t62, u161.t64, u176.t4, u176.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/545/48/593
Computing Next relation with stutter on 7.8311e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
48124 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,481.342,8616568,1,0,1.76696e+07,4.77467e+06,3555,3.8506e+07,344,1.85005e+07,5560572
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-832-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G("((u105.p354==0)||(u96.p298==1))"))&&((F("((u84.p262==0)||(u71.p188==1))"))||(F("((u122.p436==0)||(u99.p327==1))"))))))
Formula 1 simplified : !X(G"((u105.p354==0)||(u96.p298==1))" & (F"((u84.p262==0)||(u71.p188==1))" | F"((u122.p436==0)||(u99.p327==1))"))
Computing Next relation with stutter on 7.8311e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
187 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,483.221,8616756,1,0,1.76696e+07,4.77467e+06,5991,3.8506e+07,383,1.85005e+07,5994870
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-832-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((("((u69.p171==0)||(u118.p428==1))")&&((!(X("(u114.p415==1)")))||("((u68.p159!=0)&&(u81.p218!=1))")))&&((F("(u114.p415==1)"))||("(u114.p415==1)")))))
Formula 2 simplified : !F("((u69.p171==0)||(u118.p428==1))" & ("((u68.p159!=0)&&(u81.p218!=1))" | !X"(u114.p415==1)") & ("(u114.p415==1)" | F"(u114.p415==1)"))
Computing Next relation with stutter on 7.8311e+10 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
93 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,484.153,8616756,1,0,1.76696e+07,4.77467e+06,6305,3.8506e+07,388,1.85005e+07,6177695
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-832-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590002504085

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

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