Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814200345.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Dekker-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 25M Apr 27 14:36 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 Dekker-PT-200-00
FORMULA_NAME Dekker-PT-200-01
FORMULA_NAME Dekker-PT-200-02
FORMULA_NAME Dekker-PT-200-03
FORMULA_NAME Dekker-PT-200-04
FORMULA_NAME Dekker-PT-200-05
FORMULA_NAME Dekker-PT-200-06
FORMULA_NAME Dekker-PT-200-07
FORMULA_NAME Dekker-PT-200-08
FORMULA_NAME Dekker-PT-200-09
FORMULA_NAME Dekker-PT-200-10
FORMULA_NAME Dekker-PT-200-11
FORMULA_NAME Dekker-PT-200-12
FORMULA_NAME Dekker-PT-200-13
FORMULA_NAME Dekker-PT-200-14
FORMULA_NAME Dekker-PT-200-15

=== Now, execution of the tool begins

BK_START 1590111411216

[2020-05-22 01:36:52] [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-22 01:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:36:54] [INFO ] Load time of PNML (sax parser for PT used): 1212 ms
[2020-05-22 01:36:54] [INFO ] Transformed 1000 places.
[2020-05-22 01:36:54] [INFO ] Transformed 40400 transitions.
[2020-05-22 01:36:54] [INFO ] Found NUPN structural information;
[2020-05-22 01:36:54] [INFO ] Parsed PT model containing 1000 places and 40400 transitions in 1553 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 148 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 5727 ms. (steps per millisecond=17 ) properties seen :[0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1]
[2020-05-22 01:37:00] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2020-05-22 01:37:00] [INFO ] Computed 600 place invariants in 55 ms
[2020-05-22 01:37:01] [INFO ] [Real]Absence check using 400 positive place invariants in 369 ms returned sat
[2020-05-22 01:37:01] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 155 ms returned sat
[2020-05-22 01:37:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:04] [INFO ] [Real]Absence check using state equation in 2968 ms returned sat
[2020-05-22 01:37:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:37:05] [INFO ] [Nat]Absence check using 400 positive place invariants in 271 ms returned sat
[2020-05-22 01:37:05] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 166 ms returned sat
[2020-05-22 01:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:07] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2020-05-22 01:37:07] [INFO ] State equation strengthened by 200 read => feed constraints.
[2020-05-22 01:37:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 172 ms returned sat
[2020-05-22 01:37:08] [INFO ] Deduced a trap composed of 4 places in 800 ms
[2020-05-22 01:37:09] [INFO ] Deduced a trap composed of 4 places in 632 ms
[2020-05-22 01:37:10] [INFO ] Deduced a trap composed of 4 places in 580 ms
[2020-05-22 01:37:10] [INFO ] Deduced a trap composed of 4 places in 687 ms
[2020-05-22 01:37:11] [INFO ] Deduced a trap composed of 4 places in 603 ms
[2020-05-22 01:37:12] [INFO ] Deduced a trap composed of 6 places in 585 ms
[2020-05-22 01:37:12] [INFO ] Deduced a trap composed of 4 places in 474 ms
[2020-05-22 01:37:13] [INFO ] Deduced a trap composed of 4 places in 465 ms
[2020-05-22 01:37:13] [INFO ] Deduced a trap composed of 4 places in 458 ms
[2020-05-22 01:37:14] [INFO ] Deduced a trap composed of 4 places in 480 ms
[2020-05-22 01:37:14] [INFO ] Deduced a trap composed of 4 places in 652 ms
[2020-05-22 01:37:15] [INFO ] Deduced a trap composed of 4 places in 524 ms
[2020-05-22 01:37:16] [INFO ] Deduced a trap composed of 5 places in 500 ms
[2020-05-22 01:37:16] [INFO ] Deduced a trap composed of 4 places in 482 ms
[2020-05-22 01:37:17] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-05-22 01:37:17] [INFO ] Deduced a trap composed of 4 places in 691 ms
[2020-05-22 01:37:18] [INFO ] Deduced a trap composed of 4 places in 519 ms
[2020-05-22 01:37:19] [INFO ] Deduced a trap composed of 4 places in 497 ms
[2020-05-22 01:37:19] [INFO ] Deduced a trap composed of 4 places in 568 ms
[2020-05-22 01:37:20] [INFO ] Deduced a trap composed of 4 places in 542 ms
[2020-05-22 01:37:20] [INFO ] Deduced a trap composed of 5 places in 499 ms
[2020-05-22 01:37:21] [INFO ] Deduced a trap composed of 4 places in 493 ms
[2020-05-22 01:37:21] [INFO ] Deduced a trap composed of 4 places in 432 ms
[2020-05-22 01:37:22] [INFO ] Deduced a trap composed of 4 places in 407 ms
[2020-05-22 01:37:22] [INFO ] Deduced a trap composed of 5 places in 389 ms
[2020-05-22 01:37:23] [INFO ] Deduced a trap composed of 6 places in 526 ms
[2020-05-22 01:37:23] [INFO ] Deduced a trap composed of 5 places in 455 ms
[2020-05-22 01:37:24] [INFO ] Deduced a trap composed of 5 places in 486 ms
[2020-05-22 01:37:25] [INFO ] Deduced a trap composed of 4 places in 549 ms
[2020-05-22 01:37:25] [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 (> (+ s52 s132 s479 s599) 0)") while checking expression at index 0
[2020-05-22 01:37:25] [INFO ] [Real]Absence check using 400 positive place invariants in 210 ms returned sat
[2020-05-22 01:37:25] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 127 ms returned sat
[2020-05-22 01:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:27] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2020-05-22 01:37:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:37:28] [INFO ] [Nat]Absence check using 400 positive place invariants in 244 ms returned sat
[2020-05-22 01:37:28] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 159 ms returned sat
[2020-05-22 01:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:30] [INFO ] [Nat]Absence check using state equation in 2058 ms returned sat
[2020-05-22 01:37:30] [INFO ] [Nat]Added 200 Read/Feed constraints in 93 ms returned sat
[2020-05-22 01:37:31] [INFO ] Deduced a trap composed of 4 places in 603 ms
[2020-05-22 01:37:31] [INFO ] Deduced a trap composed of 4 places in 729 ms
[2020-05-22 01:37:32] [INFO ] Deduced a trap composed of 4 places in 763 ms
[2020-05-22 01:37:33] [INFO ] Deduced a trap composed of 4 places in 776 ms
[2020-05-22 01:37:34] [INFO ] Deduced a trap composed of 4 places in 623 ms
[2020-05-22 01:37:34] [INFO ] Deduced a trap composed of 6 places in 628 ms
[2020-05-22 01:37:35] [INFO ] Deduced a trap composed of 4 places in 561 ms
[2020-05-22 01:37:36] [INFO ] Deduced a trap composed of 4 places in 611 ms
[2020-05-22 01:37:36] [INFO ] Deduced a trap composed of 4 places in 612 ms
[2020-05-22 01:37:37] [INFO ] Deduced a trap composed of 4 places in 525 ms
[2020-05-22 01:37:37] [INFO ] Deduced a trap composed of 4 places in 636 ms
[2020-05-22 01:37:38] [INFO ] Deduced a trap composed of 4 places in 666 ms
[2020-05-22 01:37:39] [INFO ] Deduced a trap composed of 5 places in 579 ms
[2020-05-22 01:37:39] [INFO ] Deduced a trap composed of 4 places in 609 ms
[2020-05-22 01:37:40] [INFO ] Deduced a trap composed of 4 places in 606 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 421 ms
[2020-05-22 01:37:41] [INFO ] Deduced a trap composed of 4 places in 607 ms
[2020-05-22 01:37:42] [INFO ] Deduced a trap composed of 4 places in 630 ms
[2020-05-22 01:37:42] [INFO ] Deduced a trap composed of 4 places in 542 ms
[2020-05-22 01:37:43] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-05-22 01:37:43] [INFO ] Deduced a trap composed of 5 places in 420 ms
[2020-05-22 01:37:44] [INFO ] Deduced a trap composed of 4 places in 526 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 4 places in 518 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 4 places in 426 ms
[2020-05-22 01:37:45] [INFO ] Deduced a trap composed of 5 places in 417 ms
[2020-05-22 01:37:46] [INFO ] Deduced a trap composed of 6 places in 455 ms
[2020-05-22 01:37:47] [INFO ] Deduced a trap composed of 5 places in 452 ms
[2020-05-22 01:37:47] [INFO ] Deduced a trap composed of 5 places in 442 ms
[2020-05-22 01:37:48] [INFO ] Deduced a trap composed of 4 places in 512 ms
[2020-05-22 01:37:48] [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 (> (+ s52 s132 s479 s599) 0)") while checking expression at index 1
[2020-05-22 01:37:48] [INFO ] [Real]Absence check using 400 positive place invariants in 213 ms returned sat
[2020-05-22 01:37:48] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 120 ms returned sat
[2020-05-22 01:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:37:50] [INFO ] [Real]Absence check using state equation in 2019 ms returned sat
[2020-05-22 01:37:50] [INFO ] [Real]Added 200 Read/Feed constraints in 168 ms returned sat
[2020-05-22 01:37:51] [INFO ] Deduced a trap composed of 4 places in 504 ms
[2020-05-22 01:37:51] [INFO ] Deduced a trap composed of 5 places in 586 ms
[2020-05-22 01:37:52] [INFO ] Deduced a trap composed of 4 places in 548 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 6 places in 423 ms
[2020-05-22 01:37:53] [INFO ] Deduced a trap composed of 4 places in 437 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 5 places in 459 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 6 places in 426 ms
[2020-05-22 01:37:54] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-05-22 01:37:55] [INFO ] Deduced a trap composed of 4 places in 426 ms
[2020-05-22 01:37:55] [INFO ] Deduced a trap composed of 5 places in 449 ms
[2020-05-22 01:37:56] [INFO ] Deduced a trap composed of 6 places in 420 ms
[2020-05-22 01:37:56] [INFO ] Deduced a trap composed of 4 places in 396 ms
[2020-05-22 01:37:57] [INFO ] Deduced a trap composed of 4 places in 403 ms
[2020-05-22 01:37:57] [INFO ] Deduced a trap composed of 4 places in 378 ms
[2020-05-22 01:37:58] [INFO ] Deduced a trap composed of 4 places in 361 ms
[2020-05-22 01:37:58] [INFO ] Deduced a trap composed of 4 places in 348 ms
[2020-05-22 01:37:58] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-05-22 01:37:59] [INFO ] Deduced a trap composed of 4 places in 321 ms
[2020-05-22 01:37:59] [INFO ] Deduced a trap composed of 4 places in 360 ms
[2020-05-22 01:37:59] [INFO ] Deduced a trap composed of 4 places in 301 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-05-22 01:38:00] [INFO ] Deduced a trap composed of 4 places in 282 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 316 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 345 ms
[2020-05-22 01:38:01] [INFO ] Deduced a trap composed of 4 places in 353 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 6 places in 322 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-05-22 01:38:02] [INFO ] Deduced a trap composed of 6 places in 319 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 6 places in 335 ms
[2020-05-22 01:38:03] [INFO ] Deduced a trap composed of 6 places in 326 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 4 places in 279 ms
[2020-05-22 01:38:04] [INFO ] Deduced a trap composed of 6 places in 318 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-05-22 01:38:05] [INFO ] Deduced a trap composed of 6 places in 319 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 6 places in 305 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-05-22 01:38:06] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 280 ms
[2020-05-22 01:38:07] [INFO ] Deduced a trap composed of 4 places in 411 ms
[2020-05-22 01:38:08] [INFO ] Deduced a trap composed of 4 places in 350 ms
[2020-05-22 01:38:08] [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 (> (+ s98 s328 s548 s893) 0)") while checking expression at index 2
[2020-05-22 01:38:08] [INFO ] [Real]Absence check using 400 positive place invariants in 247 ms returned sat
[2020-05-22 01:38:08] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 168 ms returned sat
[2020-05-22 01:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:10] [INFO ] [Real]Absence check using state equation in 2021 ms returned sat
[2020-05-22 01:38:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:38:11] [INFO ] [Nat]Absence check using 400 positive place invariants in 248 ms returned sat
[2020-05-22 01:38:11] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 160 ms returned sat
[2020-05-22 01:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:13] [INFO ] [Nat]Absence check using state equation in 2092 ms returned sat
[2020-05-22 01:38:13] [INFO ] [Nat]Added 200 Read/Feed constraints in 120 ms returned sat
[2020-05-22 01:38:14] [INFO ] Deduced a trap composed of 5 places in 659 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 541 ms
[2020-05-22 01:38:15] [INFO ] Deduced a trap composed of 4 places in 617 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 4 places in 504 ms
[2020-05-22 01:38:16] [INFO ] Deduced a trap composed of 5 places in 493 ms
[2020-05-22 01:38:17] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-05-22 01:38:17] [INFO ] Deduced a trap composed of 4 places in 561 ms
[2020-05-22 01:38:18] [INFO ] Deduced a trap composed of 4 places in 468 ms
[2020-05-22 01:38:18] [INFO ] Deduced a trap composed of 4 places in 516 ms
[2020-05-22 01:38:19] [INFO ] Deduced a trap composed of 4 places in 510 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 4 places in 565 ms
[2020-05-22 01:38:20] [INFO ] Deduced a trap composed of 6 places in 464 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 4 places in 586 ms
[2020-05-22 01:38:21] [INFO ] Deduced a trap composed of 4 places in 454 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 424 ms
[2020-05-22 01:38:22] [INFO ] Deduced a trap composed of 4 places in 393 ms
[2020-05-22 01:38:23] [INFO ] Deduced a trap composed of 4 places in 477 ms
[2020-05-22 01:38:23] [INFO ] Deduced a trap composed of 4 places in 414 ms
[2020-05-22 01:38:24] [INFO ] Deduced a trap composed of 4 places in 531 ms
[2020-05-22 01:38:24] [INFO ] Deduced a trap composed of 4 places in 385 ms
[2020-05-22 01:38:25] [INFO ] Deduced a trap composed of 4 places in 455 ms
[2020-05-22 01:38:25] [INFO ] Deduced a trap composed of 6 places in 438 ms
[2020-05-22 01:38:25] [INFO ] Deduced a trap composed of 4 places in 399 ms
[2020-05-22 01:38:26] [INFO ] Deduced a trap composed of 4 places in 338 ms
[2020-05-22 01:38:26] [INFO ] Deduced a trap composed of 4 places in 328 ms
[2020-05-22 01:38:27] [INFO ] Deduced a trap composed of 4 places in 322 ms
[2020-05-22 01:38:27] [INFO ] Deduced a trap composed of 4 places in 306 ms
[2020-05-22 01:38:27] [INFO ] Deduced a trap composed of 4 places in 343 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-05-22 01:38:28] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 309 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 299 ms
[2020-05-22 01:38:29] [INFO ] Deduced a trap composed of 4 places in 420 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 256 ms
[2020-05-22 01:38:30] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-05-22 01:38:31] [INFO ] Deduced a trap composed of 4 places in 285 ms
[2020-05-22 01:38:31] [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 (> (+ s192 s254 s689 s782) 0)") while checking expression at index 3
[2020-05-22 01:38:31] [INFO ] [Real]Absence check using 400 positive place invariants in 250 ms returned sat
[2020-05-22 01:38:31] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 167 ms returned sat
[2020-05-22 01:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:34] [INFO ] [Real]Absence check using state equation in 2265 ms returned sat
[2020-05-22 01:38:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:38:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 27 ms returned unsat
[2020-05-22 01:38:34] [INFO ] [Real]Absence check using 400 positive place invariants in 259 ms returned sat
[2020-05-22 01:38:34] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 184 ms returned sat
[2020-05-22 01:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:37] [INFO ] [Real]Absence check using state equation in 2422 ms returned sat
[2020-05-22 01:38:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:38:37] [INFO ] [Nat]Absence check using 400 positive place invariants in 26 ms returned unsat
[2020-05-22 01:38:38] [INFO ] [Real]Absence check using 400 positive place invariants in 304 ms returned sat
[2020-05-22 01:38:38] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 176 ms returned sat
[2020-05-22 01:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:40] [INFO ] [Real]Absence check using state equation in 2389 ms returned sat
[2020-05-22 01:38:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:38:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 268 ms returned sat
[2020-05-22 01:38:41] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 172 ms returned sat
[2020-05-22 01:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:38:43] [INFO ] [Nat]Absence check using state equation in 2536 ms returned sat
[2020-05-22 01:38:43] [INFO ] [Nat]Added 200 Read/Feed constraints in 114 ms returned sat
[2020-05-22 01:38:44] [INFO ] Deduced a trap composed of 4 places in 555 ms
[2020-05-22 01:38:45] [INFO ] Deduced a trap composed of 4 places in 472 ms
[2020-05-22 01:38:45] [INFO ] Deduced a trap composed of 4 places in 507 ms
[2020-05-22 01:38:46] [INFO ] Deduced a trap composed of 4 places in 550 ms
[2020-05-22 01:38:46] [INFO ] Deduced a trap composed of 5 places in 506 ms
[2020-05-22 01:38:47] [INFO ] Deduced a trap composed of 6 places in 602 ms
[2020-05-22 01:38:47] [INFO ] Deduced a trap composed of 4 places in 404 ms
[2020-05-22 01:38:48] [INFO ] Deduced a trap composed of 4 places in 441 ms
[2020-05-22 01:38:48] [INFO ] Deduced a trap composed of 6 places in 347 ms
[2020-05-22 01:38:49] [INFO ] Deduced a trap composed of 4 places in 479 ms
[2020-05-22 01:38:49] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-05-22 01:38:50] [INFO ] Deduced a trap composed of 4 places in 413 ms
[2020-05-22 01:38:50] [INFO ] Deduced a trap composed of 4 places in 397 ms
[2020-05-22 01:38:51] [INFO ] Deduced a trap composed of 4 places in 392 ms
[2020-05-22 01:38:51] [INFO ] Deduced a trap composed of 4 places in 400 ms
[2020-05-22 01:38:51] [INFO ] Deduced a trap composed of 4 places in 370 ms
[2020-05-22 01:38:52] [INFO ] Deduced a trap composed of 4 places in 373 ms
[2020-05-22 01:38:52] [INFO ] Deduced a trap composed of 4 places in 390 ms
[2020-05-22 01:38:53] [INFO ] Deduced a trap composed of 4 places in 444 ms
[2020-05-22 01:38:53] [INFO ] Deduced a trap composed of 4 places in 321 ms
[2020-05-22 01:38:54] [INFO ] Deduced a trap composed of 4 places in 338 ms
[2020-05-22 01:38:54] [INFO ] Deduced a trap composed of 5 places in 370 ms
[2020-05-22 01:38:54] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-05-22 01:38:55] [INFO ] Deduced a trap composed of 4 places in 383 ms
[2020-05-22 01:38:55] [INFO ] Deduced a trap composed of 4 places in 330 ms
[2020-05-22 01:38:56] [INFO ] Deduced a trap composed of 4 places in 377 ms
[2020-05-22 01:38:56] [INFO ] Deduced a trap composed of 5 places in 284 ms
[2020-05-22 01:38:56] [INFO ] Deduced a trap composed of 4 places in 254 ms
[2020-05-22 01:38:57] [INFO ] Deduced a trap composed of 4 places in 268 ms
[2020-05-22 01:38:57] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-05-22 01:38:57] [INFO ] Deduced a trap composed of 4 places in 318 ms
[2020-05-22 01:38:58] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-05-22 01:38:58] [INFO ] Deduced a trap composed of 5 places in 265 ms
[2020-05-22 01:38:58] [INFO ] Deduced a trap composed of 4 places in 292 ms
[2020-05-22 01:38:59] [INFO ] Deduced a trap composed of 5 places in 417 ms
[2020-05-22 01:38:59] [INFO ] Deduced a trap composed of 4 places in 253 ms
[2020-05-22 01:39:00] [INFO ] Deduced a trap composed of 4 places in 295 ms
[2020-05-22 01:39:00] [INFO ] Deduced a trap composed of 5 places in 368 ms
[2020-05-22 01:39:00] [INFO ] Deduced a trap composed of 4 places in 298 ms
[2020-05-22 01:39:00] [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 (> (+ s262 s288 s794 s833) 0)") while checking expression at index 6
[2020-05-22 01:39:01] [INFO ] [Real]Absence check using 400 positive place invariants in 218 ms returned sat
[2020-05-22 01:39:01] [INFO ] [Real]Absence check using 400 positive and 200 generalized place invariants in 177 ms returned sat
[2020-05-22 01:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:39:03] [INFO ] [Real]Absence check using state equation in 2265 ms returned sat
[2020-05-22 01:39:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:39:03] [INFO ] [Nat]Absence check using 400 positive place invariants in 221 ms returned sat
[2020-05-22 01:39:04] [INFO ] [Nat]Absence check using 400 positive and 200 generalized place invariants in 153 ms returned sat
[2020-05-22 01:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:39:06] [INFO ] [Nat]Absence check using state equation in 2579 ms returned sat
[2020-05-22 01:39:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 96 ms returned sat
[2020-05-22 01:39:07] [INFO ] Deduced a trap composed of 4 places in 493 ms
[2020-05-22 01:39:07] [INFO ] Deduced a trap composed of 4 places in 504 ms
[2020-05-22 01:39:08] [INFO ] Deduced a trap composed of 4 places in 558 ms
[2020-05-22 01:39:09] [INFO ] Deduced a trap composed of 4 places in 643 ms
[2020-05-22 01:39:09] [INFO ] Deduced a trap composed of 5 places in 575 ms
[2020-05-22 01:39:10] [INFO ] Deduced a trap composed of 6 places in 414 ms
[2020-05-22 01:39:10] [INFO ] Deduced a trap composed of 4 places in 485 ms
[2020-05-22 01:39:11] [INFO ] Deduced a trap composed of 4 places in 447 ms
[2020-05-22 01:39:11] [INFO ] Deduced a trap composed of 6 places in 431 ms
[2020-05-22 01:39:12] [INFO ] Deduced a trap composed of 4 places in 546 ms
[2020-05-22 01:39:12] [INFO ] Deduced a trap composed of 4 places in 445 ms
[2020-05-22 01:39:13] [INFO ] Deduced a trap composed of 4 places in 478 ms
[2020-05-22 01:39:13] [INFO ] Deduced a trap composed of 4 places in 394 ms
[2020-05-22 01:39:14] [INFO ] Deduced a trap composed of 4 places in 331 ms
[2020-05-22 01:39:14] [INFO ] Deduced a trap composed of 4 places in 338 ms
[2020-05-22 01:39:14] [INFO ] Deduced a trap composed of 4 places in 363 ms
[2020-05-22 01:39:15] [INFO ] Deduced a trap composed of 4 places in 376 ms
[2020-05-22 01:39:15] [INFO ] Deduced a trap composed of 4 places in 339 ms
[2020-05-22 01:39:15] [INFO ] Deduced a trap composed of 4 places in 375 ms
[2020-05-22 01:39:16] [INFO ] Deduced a trap composed of 4 places in 368 ms
[2020-05-22 01:39:16] [INFO ] Deduced a trap composed of 4 places in 377 ms
[2020-05-22 01:39:17] [INFO ] Deduced a trap composed of 5 places in 348 ms
[2020-05-22 01:39:17] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-05-22 01:39:17] [INFO ] Deduced a trap composed of 4 places in 344 ms
[2020-05-22 01:39:18] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-05-22 01:39:18] [INFO ] Deduced a trap composed of 4 places in 283 ms
[2020-05-22 01:39:18] [INFO ] Deduced a trap composed of 5 places in 291 ms
[2020-05-22 01:39:19] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2020-05-22 01:39:19] [INFO ] Deduced a trap composed of 4 places in 306 ms
[2020-05-22 01:39:19] [INFO ] Deduced a trap composed of 5 places in 315 ms
[2020-05-22 01:39:20] [INFO ] Deduced a trap composed of 4 places in 294 ms
[2020-05-22 01:39:20] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-05-22 01:39:20] [INFO ] Deduced a trap composed of 5 places in 323 ms
[2020-05-22 01:39:21] [INFO ] Deduced a trap composed of 4 places in 351 ms
[2020-05-22 01:39:21] [INFO ] Deduced a trap composed of 5 places in 387 ms
[2020-05-22 01:39:22] [INFO ] Deduced a trap composed of 4 places in 323 ms
[2020-05-22 01:39:22] [INFO ] Deduced a trap composed of 4 places in 358 ms
[2020-05-22 01:39:22] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2020-05-22 01:39:23] [INFO ] Deduced a trap composed of 4 places in 303 ms
[2020-05-22 01:39:23] [INFO ] Deduced a trap composed of 4 places in 303 ms
[2020-05-22 01:39:23] [INFO ] Deduced a trap composed of 4 places in 290 ms
[2020-05-22 01:39:23] [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 (> (+ s262 s294 s794 s842) 0)") while checking expression at index 7
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 01:39:26] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-22 01:39:26] [INFO ] Flatten gal took : 2338 ms
FORMULA Dekker-PT-200-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:39:28] [INFO ] Flatten gal took : 1624 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:39:33] [INFO ] Applying decomposition
[2020-05-22 01:39:34] [INFO ] Input system was already deterministic with 40400 transitions.
[2020-05-22 01:39:34] [INFO ] Too many transitions (40400) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:39:36] [INFO ] Flatten gal took : 2988 ms
[2020-05-22 01:39:38] [INFO ] Built C files in 7626ms 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]
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/graph2756020617909488714.txt, -o, /tmp/graph2756020617909488714.bin, -w, /tmp/graph2756020617909488714.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/graph2756020617909488714.bin, -l, -1, -v, -w, /tmp/graph2756020617909488714.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:39:41] [INFO ] Decomposing Gal with order
[2020-05-22 01:39:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:39:46] [INFO ] Removed a total of 138302 redundant transitions.
[2020-05-22 01:39:47] [INFO ] Flatten gal took : 3364 ms
[2020-05-22 01:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1300 ms.
[2020-05-22 01:39:48] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 138 ms
[2020-05-22 01:39:48] [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 9 LTL properties
Checking formula 0 : !((F(!(("((u171.p3_178!=0)&&(i33.u51.flag_1_53!=1))")U(X("((u171.p3_178==0)||(i33.u51.flag_1_53==1))"))))))
Formula 0 simplified : !F!("((u171.p3_178!=0)&&(i33.u51.flag_1_53!=1))" U X"((u171.p3_178==0)||(i33.u51.flag_1_53==1))")
built 19901 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u5.exit_5, u6.exit_6, u10.exit_9, u16.exit_13, u19.exit_18, u20.exit_19, u26.exit_26, u27.exit_27, u28.exit_28, u30.exit_30, u31.exit_31, u35.exit_35, u36.exit_36, u37.exit_37, u38.exit_38, u40.exit_40, u41.exit_41, u42.exit_42, u44.exit_44, u46.exit_47, u47.exit_48, u49.exit_52, u53.exit_55, u54.exit_56, u55.exit_57, u57.exit_59, u59.exit_61, u60.exit_62, u61.exit_63, u64.exit_66, u69.exit_69, u73.exit_73, u79.exit_81, u82.exit_85, u91.exit_93, u92.exit_94, u94.exit_96, u96.exit_98, u99.exit_101, u100.exit_102, u102.exit_105, u106.exit_108, u107.exit_109, u111.exit_113, u113.exit_116, u114.exit_117, u116.exit_119, u117.exit_120, u120.exit_123, u124.exit_126, u126.exit_128, u129.exit_132, u130.exit_133, u131.exit_134, u132.exit_135, u135.exit_138, u140.exit_142, u141.exit_144, u143.exit_146, u152.exit_154, u153.exit_155, u157.exit_160, u162.exit_167, u163.exit_168, u168.exit_173, u170.exit_176, u171.exit_178, u172.exit_179, u174.exit_181, u176.exit_183, u178.exit_185, u181.exit_188, u182.exit_189, u183.exit_190, u189.exit_194, u190.exit_195, u192.exit_197, u194.exit_199, u201.exit_14, u203.exit_16, u207.exit_23, u208.exit_24, u216.exit_45, u218.exit_49, u220.exit_51, u226.exit_71, u230.exit_76, u232.exit_78, u235.exit_82, u249.exit_104, u251.exit_111, u254.exit_115, u261.exit_130, u267.exit_143, u273.exit_151, u275.exit_157, u278.exit_161, u279.exit_163, u280.exit_164, u288.exit_175, u289.exit_177, i1.exit_4, i4.exit_7, i6.exit_10, i7.exit_11, i9.exit_15, i12.exit_20, i16.exit_29, i19.exit_34, i27.exit_43, i29.exit_46, i33.exit_53, i38.exit_60, i43.exit_67, i44.exit_68, i46.exit_70, i47.exit_72, i49.exit_77, i52.exit_87, i53.exit_88, i54.exit_89, i55.exit_92, i59.exit_97, i61.exit_99, i62.exit_100, i65.exit_103, i67.exit_106, i68.exit_107, i71.exit_110, i72.exit_112, i78.exit_121, i79.exit_122, i81.exit_124, i84.exit_131, i89.exit_137, i91.exit_139, i92.exit_141, i95.exit_145, i97.exit_152, i98.exit_153, i101.exit_159, i103.exit_162, i106.exit_169, i107.exit_170, i108.exit_171, i116.exit_187, i120.exit_191, i121.exit_192, i124.exit_196, i126.exit_198, i128.exit_1, i129.exit_2, i130.exit_3, i131.exit_8, i132.exit_12, i135.exit_17, i136.exit_21, i137.exit_22, i140.exit_25, i141.exit_32, i142.exit_33, i143.exit_39, i146.exit_50, i148.exit_54, i149.exit_58, i150.exit_64, i151.exit_65, i153.exit_74, i154.exit_75, i157.exit_79, i158.exit_80, i160.exit_83, i161.exit_84, i162.exit_86, i163.exit_90, i164.exit_91, i165.exit_95, i168.exit_114, i170.exit_118, i171.exit_125, i172.exit_127, i173.exit_129, i175.exit_136, i176.exit_140, i178.exit_147, i179.exit_148, i180.exit_149, i181.exit_150, i183.exit_156, i185.exit_158, i189.exit_165, i190.exit_166, i191.exit_172, i192.exit_174, i195.exit_180, i196.exit_182, i197.exit_184, i198.exit_186, i199.exit_193, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/40200/200/40400
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
16269 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,177.507,3161376,1,0,9.49187e+06,20336,313682,4.164e+06,448,30977,11192929
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-200-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(F((((X(F("(i103.u159.p0_162==1)")))||("(u94.p3_96==0)"))||("(i16.u210.flag_1_29==1)"))&&(X("((u94.p3_96==0)||(i16.u210.flag_1_29==1))")))))))
Formula 1 simplified : !F!F(("(i16.u210.flag_1_29==1)" | "(u94.p3_96==0)" | XF"(i103.u159.p0_162==1)") & X"((u94.p3_96==0)||(i16.u210.flag_1_29==1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5894 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,236.449,3248368,1,0,9.49198e+06,20336,111493,4.16526e+06,104,30977,73019
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-200-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(F(!(F((X("((i135.u18.flag_0_17==0)||(i78.u256.p1_121==1))"))U("((u182.flag_1_189==0)||(i16.u29.p1_29==1))"))))))))
Formula 2 simplified : !FXF!F(X"((i135.u18.flag_0_17==0)||(i78.u256.p1_121==1))" U "((u182.flag_1_189==0)||(i16.u29.p1_29==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1944 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,255.885,3248368,1,0,9.49198e+06,20336,133715,4.16526e+06,116,30977,1839994
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-200-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X(F(X("((u114.flag_1_117==0)||(i84.u262.p0_131==1))"))))))
Formula 3 simplified : XFX"((u114.flag_1_117==0)||(i84.u262.p0_131==1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
1684 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,272.725,3248368,1,0,9.49198e+06,20336,135927,4.16526e+06,116,30977,1863462
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-200-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(X(!(X(((X(F("((i196.u291.p0_182!=0)&&(i95.u142.flag_0_145!=1))")))||("(u100.flag_1_102==0)"))||("(u172.flag_0_179==1)"))))))))
Formula 4 simplified : !F!X!X("(u100.flag_1_102==0)" | "(u172.flag_0_179==1)" | XF"((i196.u291.p0_182!=0)&&(i95.u142.flag_0_145!=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
671 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,279.437,3248368,1,0,9.49198e+06,20336,138042,4.16526e+06,118,30977,1886088
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-200-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G("((i197.u177.flag_1_184!=0)&&(i191.u167.p1_172!=1))"))))
Formula 5 simplified : !FG"((i197.u177.flag_1_184!=0)&&(i191.u167.p1_172!=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
220 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,281.636,3248368,1,0,9.49198e+06,20336,138085,4.16526e+06,118,30977,2381656
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-200-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(X(X((((!(G("((i185.u155.flag_1_158==0)||(u30.p3_30==1))")))&&(!(G("((i84.u128.p3_131==0)||(u54.p3_56==1))"))))&&("(i84.u128.p3_131!=0)"))&&("(u54.p3_56!=1)"))))))
Formula 6 simplified : !GXX("(i84.u128.p3_131!=0)" & "(u54.p3_56!=1)" & !G"((i185.u155.flag_1_158==0)||(u30.p3_30==1))" & !G"((i84.u128.p3_131==0)||(u54.p3_56==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
16 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,281.806,3248368,1,0,9.49198e+06,20336,138115,4.16526e+06,122,30977,2391862
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-200-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(("((i65.u101.flag_0_103==0)||(i181.u147.flag_1_150==1))")U(X("((i65.u101.flag_0_103!=0)&&(i181.u147.flag_1_150!=1))")))))
Formula 7 simplified : !G("((i65.u101.flag_0_103==0)||(i181.u147.flag_1_150==1))" U X"((i65.u101.flag_0_103!=0)&&(i181.u147.flag_1_150!=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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,281.967,3248368,1,0,9.49198e+06,20336,138129,4.16526e+06,123,30977,2405249
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-200-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((i106.u164.flag_0_169==0)||(u53.p1_55==1))")))
Formula 8 simplified : !F"((i106.u164.flag_0_169==0)||(u53.p1_55==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
905 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,291.03,3248368,1,0,9.49198e+06,20336,140780,4.16526e+06,124,30977,2424253
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-200-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590111886004

--------------------
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="Dekker-PT-200"
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 Dekker-PT-200, 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 r066-tajo-158922814200345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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