fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r227-tall-162098231000221
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldIIPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4309.132 3600000.00 3626116.00 10310.20 TTTFFF?FFFFFT??F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231000221.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldIIPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231000221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 338K May 5 16:52 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 ShieldIIPt-PT-020B-00
FORMULA_NAME ShieldIIPt-PT-020B-01
FORMULA_NAME ShieldIIPt-PT-020B-02
FORMULA_NAME ShieldIIPt-PT-020B-03
FORMULA_NAME ShieldIIPt-PT-020B-04
FORMULA_NAME ShieldIIPt-PT-020B-05
FORMULA_NAME ShieldIIPt-PT-020B-06
FORMULA_NAME ShieldIIPt-PT-020B-07
FORMULA_NAME ShieldIIPt-PT-020B-08
FORMULA_NAME ShieldIIPt-PT-020B-09
FORMULA_NAME ShieldIIPt-PT-020B-10
FORMULA_NAME ShieldIIPt-PT-020B-11
FORMULA_NAME ShieldIIPt-PT-020B-12
FORMULA_NAME ShieldIIPt-PT-020B-13
FORMULA_NAME ShieldIIPt-PT-020B-14
FORMULA_NAME ShieldIIPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1621145507411

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 06:11:48] [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, -timeout, 3600, -rebuildPNML]
[2021-05-16 06:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 06:11:49] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2021-05-16 06:11:49] [INFO ] Transformed 1403 places.
[2021-05-16 06:11:49] [INFO ] Transformed 1303 transitions.
[2021-05-16 06:11:49] [INFO ] Found NUPN structural information;
[2021-05-16 06:11:49] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 75 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 598 ms. (steps per millisecond=167 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 1303 rows 1403 cols
[2021-05-16 06:11:49] [INFO ] Computed 181 place invariants in 37 ms
[2021-05-16 06:11:50] [INFO ] [Real]Absence check using 181 positive place invariants in 205 ms returned sat
[2021-05-16 06:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:11:54] [INFO ] [Real]Absence check using state equation in 3488 ms returned sat
[2021-05-16 06:11:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:11:54] [INFO ] [Nat]Absence check using 181 positive place invariants in 79 ms returned unsat
[2021-05-16 06:11:54] [INFO ] [Real]Absence check using 181 positive place invariants in 184 ms returned sat
[2021-05-16 06:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:11:58] [INFO ] [Real]Absence check using state equation in 3376 ms returned sat
[2021-05-16 06:11:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:11:58] [INFO ] [Nat]Absence check using 181 positive place invariants in 248 ms returned sat
[2021-05-16 06:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:12:02] [INFO ] [Nat]Absence check using state equation in 3288 ms returned sat
[2021-05-16 06:12:02] [INFO ] Deduced a trap composed of 30 places in 691 ms
[2021-05-16 06:12:03] [INFO ] Deduced a trap composed of 24 places in 601 ms
[2021-05-16 06:12:04] [INFO ] Deduced a trap composed of 21 places in 580 ms
[2021-05-16 06:12:04] [INFO ] Deduced a trap composed of 23 places in 671 ms
[2021-05-16 06:12:05] [INFO ] Deduced a trap composed of 21 places in 600 ms
[2021-05-16 06:12:06] [INFO ] Deduced a trap composed of 32 places in 556 ms
[2021-05-16 06:12:06] [INFO ] Deduced a trap composed of 33 places in 557 ms
[2021-05-16 06:12:07] [INFO ] Deduced a trap composed of 36 places in 533 ms
[2021-05-16 06:12:07] [INFO ] Deduced a trap composed of 36 places in 536 ms
[2021-05-16 06:12:08] [INFO ] Deduced a trap composed of 24 places in 512 ms
[2021-05-16 06:12:09] [INFO ] Deduced a trap composed of 18 places in 511 ms
[2021-05-16 06:12:09] [INFO ] Deduced a trap composed of 32 places in 495 ms
[2021-05-16 06:12:10] [INFO ] Deduced a trap composed of 20 places in 487 ms
[2021-05-16 06:12:10] [INFO ] Deduced a trap composed of 20 places in 487 ms
[2021-05-16 06:12:11] [INFO ] Deduced a trap composed of 24 places in 484 ms
[2021-05-16 06:12:11] [INFO ] Deduced a trap composed of 30 places in 485 ms
[2021-05-16 06:12:12] [INFO ] Deduced a trap composed of 34 places in 474 ms
[2021-05-16 06:12:12] [INFO ] Deduced a trap composed of 31 places in 489 ms
[2021-05-16 06:12:13] [INFO ] Deduced a trap composed of 19 places in 460 ms
[2021-05-16 06:12:13] [INFO ] Deduced a trap composed of 37 places in 454 ms
[2021-05-16 06:12:14] [INFO ] Deduced a trap composed of 25 places in 457 ms
[2021-05-16 06:12:14] [INFO ] Deduced a trap composed of 37 places in 457 ms
[2021-05-16 06:12:15] [INFO ] Deduced a trap composed of 15 places in 440 ms
[2021-05-16 06:12:15] [INFO ] Deduced a trap composed of 24 places in 446 ms
[2021-05-16 06:12:16] [INFO ] Deduced a trap composed of 40 places in 429 ms
[2021-05-16 06:12:16] [INFO ] Deduced a trap composed of 25 places in 424 ms
[2021-05-16 06:12:17] [INFO ] Deduced a trap composed of 30 places in 424 ms
[2021-05-16 06:12:17] [INFO ] Deduced a trap composed of 24 places in 406 ms
[2021-05-16 06:12:17] [INFO ] Deduced a trap composed of 32 places in 401 ms
[2021-05-16 06:12:18] [INFO ] Deduced a trap composed of 34 places in 423 ms
[2021-05-16 06:12:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s230 s231 s232 s233 s234 s235 s251 s253 s277 s278 s279 s280 s281 s282 s283 s284 s285) 0)") while checking expression at index 1
[2021-05-16 06:12:18] [INFO ] [Real]Absence check using 181 positive place invariants in 149 ms returned sat
[2021-05-16 06:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:12:22] [INFO ] [Real]Absence check using state equation in 3327 ms returned sat
[2021-05-16 06:12:22] [INFO ] Deduced a trap composed of 28 places in 482 ms
[2021-05-16 06:12:23] [INFO ] Deduced a trap composed of 30 places in 472 ms
[2021-05-16 06:12:23] [INFO ] Deduced a trap composed of 18 places in 468 ms
[2021-05-16 06:12:24] [INFO ] Deduced a trap composed of 18 places in 444 ms
[2021-05-16 06:12:24] [INFO ] Deduced a trap composed of 20 places in 439 ms
[2021-05-16 06:12:25] [INFO ] Deduced a trap composed of 23 places in 420 ms
[2021-05-16 06:12:25] [INFO ] Deduced a trap composed of 18 places in 409 ms
[2021-05-16 06:12:25] [INFO ] Deduced a trap composed of 38 places in 393 ms
[2021-05-16 06:12:26] [INFO ] Deduced a trap composed of 24 places in 400 ms
[2021-05-16 06:12:26] [INFO ] Deduced a trap composed of 19 places in 369 ms
[2021-05-16 06:12:27] [INFO ] Deduced a trap composed of 25 places in 388 ms
[2021-05-16 06:12:27] [INFO ] Deduced a trap composed of 33 places in 364 ms
[2021-05-16 06:12:28] [INFO ] Deduced a trap composed of 24 places in 357 ms
[2021-05-16 06:12:28] [INFO ] Deduced a trap composed of 20 places in 383 ms
[2021-05-16 06:12:28] [INFO ] Deduced a trap composed of 36 places in 356 ms
[2021-05-16 06:12:29] [INFO ] Deduced a trap composed of 37 places in 352 ms
[2021-05-16 06:12:29] [INFO ] Deduced a trap composed of 20 places in 352 ms
[2021-05-16 06:12:30] [INFO ] Deduced a trap composed of 34 places in 330 ms
[2021-05-16 06:12:30] [INFO ] Deduced a trap composed of 36 places in 330 ms
[2021-05-16 06:12:30] [INFO ] Deduced a trap composed of 36 places in 327 ms
[2021-05-16 06:12:31] [INFO ] Deduced a trap composed of 31 places in 324 ms
[2021-05-16 06:12:31] [INFO ] Deduced a trap composed of 43 places in 327 ms
[2021-05-16 06:12:31] [INFO ] Deduced a trap composed of 35 places in 304 ms
[2021-05-16 06:12:32] [INFO ] Deduced a trap composed of 37 places in 301 ms
[2021-05-16 06:12:32] [INFO ] Deduced a trap composed of 35 places in 313 ms
[2021-05-16 06:12:32] [INFO ] Deduced a trap composed of 33 places in 292 ms
[2021-05-16 06:12:33] [INFO ] Deduced a trap composed of 32 places in 285 ms
[2021-05-16 06:12:33] [INFO ] Deduced a trap composed of 32 places in 288 ms
[2021-05-16 06:12:33] [INFO ] Deduced a trap composed of 33 places in 279 ms
[2021-05-16 06:12:34] [INFO ] Deduced a trap composed of 32 places in 282 ms
[2021-05-16 06:12:34] [INFO ] Deduced a trap composed of 32 places in 265 ms
[2021-05-16 06:12:34] [INFO ] Deduced a trap composed of 32 places in 252 ms
[2021-05-16 06:12:35] [INFO ] Deduced a trap composed of 39 places in 253 ms
[2021-05-16 06:12:35] [INFO ] Deduced a trap composed of 30 places in 244 ms
[2021-05-16 06:12:35] [INFO ] Deduced a trap composed of 42 places in 241 ms
[2021-05-16 06:12:36] [INFO ] Deduced a trap composed of 30 places in 224 ms
[2021-05-16 06:12:36] [INFO ] Deduced a trap composed of 36 places in 220 ms
[2021-05-16 06:12:36] [INFO ] Deduced a trap composed of 30 places in 216 ms
[2021-05-16 06:12:36] [INFO ] Deduced a trap composed of 32 places in 202 ms
[2021-05-16 06:12:37] [INFO ] Deduced a trap composed of 40 places in 201 ms
[2021-05-16 06:12:37] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14984 ms
[2021-05-16 06:12:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:12:37] [INFO ] [Nat]Absence check using 181 positive place invariants in 228 ms returned sat
[2021-05-16 06:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:12:40] [INFO ] [Nat]Absence check using state equation in 3247 ms returned sat
[2021-05-16 06:12:41] [INFO ] Deduced a trap composed of 21 places in 537 ms
[2021-05-16 06:12:42] [INFO ] Deduced a trap composed of 19 places in 634 ms
[2021-05-16 06:12:42] [INFO ] Deduced a trap composed of 18 places in 520 ms
[2021-05-16 06:12:43] [INFO ] Deduced a trap composed of 20 places in 515 ms
[2021-05-16 06:12:43] [INFO ] Deduced a trap composed of 23 places in 513 ms
[2021-05-16 06:12:44] [INFO ] Deduced a trap composed of 31 places in 493 ms
[2021-05-16 06:12:44] [INFO ] Deduced a trap composed of 21 places in 480 ms
[2021-05-16 06:12:45] [INFO ] Deduced a trap composed of 39 places in 537 ms
[2021-05-16 06:12:45] [INFO ] Deduced a trap composed of 29 places in 469 ms
[2021-05-16 06:12:46] [INFO ] Deduced a trap composed of 37 places in 465 ms
[2021-05-16 06:12:46] [INFO ] Deduced a trap composed of 36 places in 453 ms
[2021-05-16 06:12:47] [INFO ] Deduced a trap composed of 30 places in 446 ms
[2021-05-16 06:12:47] [INFO ] Deduced a trap composed of 31 places in 446 ms
[2021-05-16 06:12:48] [INFO ] Deduced a trap composed of 23 places in 445 ms
[2021-05-16 06:12:48] [INFO ] Deduced a trap composed of 35 places in 441 ms
[2021-05-16 06:12:49] [INFO ] Deduced a trap composed of 28 places in 413 ms
[2021-05-16 06:12:49] [INFO ] Deduced a trap composed of 25 places in 422 ms
[2021-05-16 06:12:50] [INFO ] Deduced a trap composed of 24 places in 411 ms
[2021-05-16 06:12:50] [INFO ] Deduced a trap composed of 18 places in 412 ms
[2021-05-16 06:12:51] [INFO ] Deduced a trap composed of 35 places in 411 ms
[2021-05-16 06:12:51] [INFO ] Deduced a trap composed of 15 places in 401 ms
[2021-05-16 06:12:51] [INFO ] Deduced a trap composed of 41 places in 398 ms
[2021-05-16 06:12:52] [INFO ] Deduced a trap composed of 18 places in 371 ms
[2021-05-16 06:12:52] [INFO ] Deduced a trap composed of 34 places in 370 ms
[2021-05-16 06:12:53] [INFO ] Deduced a trap composed of 35 places in 354 ms
[2021-05-16 06:12:53] [INFO ] Deduced a trap composed of 25 places in 342 ms
[2021-05-16 06:12:53] [INFO ] Deduced a trap composed of 34 places in 328 ms
[2021-05-16 06:12:54] [INFO ] Deduced a trap composed of 32 places in 313 ms
[2021-05-16 06:12:54] [INFO ] Deduced a trap composed of 31 places in 326 ms
[2021-05-16 06:12:54] [INFO ] Deduced a trap composed of 32 places in 317 ms
[2021-05-16 06:12:55] [INFO ] Deduced a trap composed of 29 places in 292 ms
[2021-05-16 06:12:55] [INFO ] Deduced a trap composed of 21 places in 305 ms
[2021-05-16 06:12:55] [INFO ] Deduced a trap composed of 34 places in 292 ms
[2021-05-16 06:12:56] [INFO ] Deduced a trap composed of 33 places in 294 ms
[2021-05-16 06:12:56] [INFO ] Deduced a trap composed of 38 places in 283 ms
[2021-05-16 06:12:56] [INFO ] Deduced a trap composed of 22 places in 276 ms
[2021-05-16 06:12:57] [INFO ] Deduced a trap composed of 22 places in 269 ms
[2021-05-16 06:12:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1145 s1147 s1186 s1187 s1188 s1189 s1190 s1191 s1192 s1193 s1194) 0)") while checking expression at index 2
[2021-05-16 06:12:57] [INFO ] [Real]Absence check using 181 positive place invariants in 149 ms returned sat
[2021-05-16 06:12:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:13:00] [INFO ] [Real]Absence check using state equation in 3315 ms returned sat
[2021-05-16 06:13:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:13:01] [INFO ] [Nat]Absence check using 181 positive place invariants in 231 ms returned sat
[2021-05-16 06:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:13:04] [INFO ] [Nat]Absence check using state equation in 3210 ms returned sat
[2021-05-16 06:13:05] [INFO ] Deduced a trap composed of 25 places in 548 ms
[2021-05-16 06:13:05] [INFO ] Deduced a trap composed of 22 places in 552 ms
[2021-05-16 06:13:06] [INFO ] Deduced a trap composed of 22 places in 535 ms
[2021-05-16 06:13:06] [INFO ] Deduced a trap composed of 21 places in 534 ms
[2021-05-16 06:13:07] [INFO ] Deduced a trap composed of 18 places in 523 ms
[2021-05-16 06:13:07] [INFO ] Deduced a trap composed of 18 places in 528 ms
[2021-05-16 06:13:08] [INFO ] Deduced a trap composed of 25 places in 521 ms
[2021-05-16 06:13:09] [INFO ] Deduced a trap composed of 22 places in 515 ms
[2021-05-16 06:13:09] [INFO ] Deduced a trap composed of 28 places in 509 ms
[2021-05-16 06:13:10] [INFO ] Deduced a trap composed of 23 places in 503 ms
[2021-05-16 06:13:10] [INFO ] Deduced a trap composed of 25 places in 501 ms
[2021-05-16 06:13:11] [INFO ] Deduced a trap composed of 35 places in 489 ms
[2021-05-16 06:13:11] [INFO ] Deduced a trap composed of 19 places in 495 ms
[2021-05-16 06:13:12] [INFO ] Deduced a trap composed of 23 places in 493 ms
[2021-05-16 06:13:12] [INFO ] Deduced a trap composed of 24 places in 486 ms
[2021-05-16 06:13:13] [INFO ] Deduced a trap composed of 21 places in 461 ms
[2021-05-16 06:13:13] [INFO ] Deduced a trap composed of 26 places in 468 ms
[2021-05-16 06:13:14] [INFO ] Deduced a trap composed of 18 places in 469 ms
[2021-05-16 06:13:14] [INFO ] Deduced a trap composed of 20 places in 459 ms
[2021-05-16 06:13:15] [INFO ] Deduced a trap composed of 36 places in 448 ms
[2021-05-16 06:13:15] [INFO ] Deduced a trap composed of 19 places in 449 ms
[2021-05-16 06:13:16] [INFO ] Deduced a trap composed of 32 places in 453 ms
[2021-05-16 06:13:16] [INFO ] Deduced a trap composed of 31 places in 442 ms
[2021-05-16 06:13:17] [INFO ] Deduced a trap composed of 25 places in 436 ms
[2021-05-16 06:13:17] [INFO ] Deduced a trap composed of 30 places in 435 ms
[2021-05-16 06:13:18] [INFO ] Deduced a trap composed of 34 places in 421 ms
[2021-05-16 06:13:18] [INFO ] Deduced a trap composed of 29 places in 419 ms
[2021-05-16 06:13:19] [INFO ] Deduced a trap composed of 23 places in 399 ms
[2021-05-16 06:13:19] [INFO ] Deduced a trap composed of 33 places in 394 ms
[2021-05-16 06:13:20] [INFO ] Deduced a trap composed of 27 places in 384 ms
[2021-05-16 06:13:20] [INFO ] Deduced a trap composed of 15 places in 378 ms
[2021-05-16 06:13:20] [INFO ] Deduced a trap composed of 49 places in 372 ms
[2021-05-16 06:13:21] [INFO ] Deduced a trap composed of 31 places in 367 ms
[2021-05-16 06:13:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s368 s369 s370 s371 s372 s373 s374 s375 s379 s405 s406 s407 s408 s409 s410 s411) 0)") while checking expression at index 3
[2021-05-16 06:13:21] [INFO ] [Real]Absence check using 181 positive place invariants in 149 ms returned sat
[2021-05-16 06:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 06:13:25] [INFO ] [Real]Absence check using state equation in 3456 ms returned sat
[2021-05-16 06:13:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 06:13:25] [INFO ] [Nat]Absence check using 181 positive place invariants in 229 ms returned sat
[2021-05-16 06:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 06:13:28] [INFO ] [Nat]Absence check using state equation in 3166 ms returned sat
[2021-05-16 06:13:29] [INFO ] Deduced a trap composed of 21 places in 476 ms
[2021-05-16 06:13:29] [INFO ] Deduced a trap composed of 34 places in 472 ms
[2021-05-16 06:13:30] [INFO ] Deduced a trap composed of 20 places in 521 ms
[2021-05-16 06:13:30] [INFO ] Deduced a trap composed of 21 places in 451 ms
[2021-05-16 06:13:31] [INFO ] Deduced a trap composed of 18 places in 446 ms
[2021-05-16 06:13:31] [INFO ] Deduced a trap composed of 21 places in 458 ms
[2021-05-16 06:13:32] [INFO ] Deduced a trap composed of 19 places in 441 ms
[2021-05-16 06:13:32] [INFO ] Deduced a trap composed of 19 places in 436 ms
[2021-05-16 06:13:33] [INFO ] Deduced a trap composed of 18 places in 434 ms
[2021-05-16 06:13:33] [INFO ] Deduced a trap composed of 20 places in 424 ms
[2021-05-16 06:13:34] [INFO ] Deduced a trap composed of 33 places in 421 ms
[2021-05-16 06:13:34] [INFO ] Deduced a trap composed of 25 places in 419 ms
[2021-05-16 06:13:34] [INFO ] Deduced a trap composed of 35 places in 405 ms
[2021-05-16 06:13:35] [INFO ] Deduced a trap composed of 33 places in 398 ms
[2021-05-16 06:13:35] [INFO ] Deduced a trap composed of 35 places in 404 ms
[2021-05-16 06:13:36] [INFO ] Deduced a trap composed of 20 places in 389 ms
[2021-05-16 06:13:36] [INFO ] Deduced a trap composed of 34 places in 395 ms
[2021-05-16 06:13:37] [INFO ] Deduced a trap composed of 38 places in 383 ms
[2021-05-16 06:13:37] [INFO ] Deduced a trap composed of 29 places in 379 ms
[2021-05-16 06:13:37] [INFO ] Deduced a trap composed of 30 places in 370 ms
[2021-05-16 06:13:38] [INFO ] Deduced a trap composed of 19 places in 364 ms
[2021-05-16 06:13:38] [INFO ] Deduced a trap composed of 29 places in 358 ms
[2021-05-16 06:13:39] [INFO ] Deduced a trap composed of 26 places in 353 ms
[2021-05-16 06:13:39] [INFO ] Deduced a trap composed of 23 places in 350 ms
[2021-05-16 06:13:39] [INFO ] Deduced a trap composed of 36 places in 348 ms
[2021-05-16 06:13:40] [INFO ] Deduced a trap composed of 28 places in 369 ms
[2021-05-16 06:13:40] [INFO ] Deduced a trap composed of 22 places in 343 ms
[2021-05-16 06:13:41] [INFO ] Deduced a trap composed of 32 places in 341 ms
[2021-05-16 06:13:41] [INFO ] Deduced a trap composed of 32 places in 337 ms
[2021-05-16 06:13:41] [INFO ] Deduced a trap composed of 31 places in 329 ms
[2021-05-16 06:13:42] [INFO ] Deduced a trap composed of 34 places in 321 ms
[2021-05-16 06:13:42] [INFO ] Deduced a trap composed of 20 places in 314 ms
[2021-05-16 06:13:42] [INFO ] Deduced a trap composed of 33 places in 314 ms
[2021-05-16 06:13:43] [INFO ] Deduced a trap composed of 28 places in 292 ms
[2021-05-16 06:13:43] [INFO ] Deduced a trap composed of 34 places in 296 ms
[2021-05-16 06:13:43] [INFO ] Deduced a trap composed of 35 places in 268 ms
[2021-05-16 06:13:44] [INFO ] Deduced a trap composed of 41 places in 265 ms
[2021-05-16 06:13:44] [INFO ] Deduced a trap composed of 32 places in 256 ms
[2021-05-16 06:13:44] [INFO ] Deduced a trap composed of 39 places in 249 ms
[2021-05-16 06:13:45] [INFO ] Deduced a trap composed of 32 places in 249 ms
[2021-05-16 06:13:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 06:13:45] [INFO ] Deduced a trap composed of 14 places in 801 ms
[2021-05-16 06:13:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s1196 s1197 s1198 s1199 s1200 s1201 s1202 s1203 s1204 s1205 s1206) 0)") while checking expression at index 4
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-16 06:13:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 06:13:46] [INFO ] Flatten gal took : 155 ms
FORMULA ShieldIIPt-PT-020B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 06:13:46] [INFO ] Applying decomposition
[2021-05-16 06:13:46] [INFO ] Flatten gal took : 65 ms
[2021-05-16 06:13:46] [INFO ] Decomposing Gal with order
[2021-05-16 06:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 06:13:46] [INFO ] Flatten gal took : 98 ms
[2021-05-16 06:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-16 06:13:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-16 06:13:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-020B @ 3570 seconds

FORMULA ShieldIIPt-PT-020B-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 11911864 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16138164 kB

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

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ShieldIIPt-PT-020B, 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 r227-tall-162098231000221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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