Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100595.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 itslola
Input is BusinessProcesses-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 189K 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 BusinessProcesses-PT-19-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591166920126

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:48:43] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2020-06-03 06:48:43] [INFO ] Transformed 772 places.
[2020-06-03 06:48:43] [INFO ] Transformed 685 transitions.
[2020-06-03 06:48:43] [INFO ] Found NUPN structural information;
[2020-06-03 06:48:43] [INFO ] Parsed PT model containing 772 places and 685 transitions in 172 ms.
Deduced a syphon composed of 15 places in 24 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 57 ms.
Incomplete random walk after 100000 steps, including 551 resets, run finished after 383 ms. (steps per millisecond=261 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 670 rows 757 cols
[2020-06-03 06:48:43] [INFO ] Computed 125 place invariants in 58 ms
[2020-06-03 06:48:44] [INFO ] [Real]Absence check using 78 positive place invariants in 335 ms returned sat
[2020-06-03 06:48:44] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 132 ms returned sat
[2020-06-03 06:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:46] [INFO ] [Real]Absence check using state equation in 1623 ms returned sat
[2020-06-03 06:48:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:48:47] [INFO ] [Nat]Absence check using 78 positive place invariants in 151 ms returned sat
[2020-06-03 06:48:47] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 88 ms returned sat
[2020-06-03 06:48:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:48:48] [INFO ] [Nat]Absence check using state equation in 1273 ms returned sat
[2020-06-03 06:48:48] [INFO ] Deduced a trap composed of 13 places in 511 ms
[2020-06-03 06:48:49] [INFO ] Deduced a trap composed of 11 places in 645 ms
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 16 places in 392 ms
[2020-06-03 06:48:50] [INFO ] Deduced a trap composed of 8 places in 579 ms
[2020-06-03 06:48:56] [INFO ] Deduced a trap composed of 153 places in 5287 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 30 places in 3089 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 140 places in 345 ms
[2020-06-03 06:48:59] [INFO ] Deduced a trap composed of 15 places in 212 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 19 places in 290 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 137 places in 247 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 153 places in 256 ms
[2020-06-03 06:49:00] [INFO ] Deduced a trap composed of 159 places in 205 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 153 places in 226 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 150 places in 263 ms
[2020-06-03 06:49:01] [INFO ] Deduced a trap composed of 154 places in 220 ms
[2020-06-03 06:49:02] [INFO ] Deduced a trap composed of 157 places in 213 ms
[2020-06-03 06:49:02] [INFO ] Deduced a trap composed of 156 places in 218 ms
[2020-06-03 06:49:02] [INFO ] Deduced a trap composed of 158 places in 213 ms
[2020-06-03 06:49:02] [INFO ] Deduced a trap composed of 146 places in 213 ms
[2020-06-03 06:49:03] [INFO ] Deduced a trap composed of 162 places in 210 ms
[2020-06-03 06:49:03] [INFO ] Deduced a trap composed of 144 places in 221 ms
[2020-06-03 06:49:03] [INFO ] Deduced a trap composed of 144 places in 198 ms
[2020-06-03 06:49:03] [INFO ] Deduced a trap composed of 154 places in 214 ms
[2020-06-03 06:49:04] [INFO ] Deduced a trap composed of 149 places in 192 ms
[2020-06-03 06:49:04] [INFO ] Deduced a trap composed of 148 places in 197 ms
[2020-06-03 06:49:04] [INFO ] Deduced a trap composed of 150 places in 195 ms
[2020-06-03 06:49:04] [INFO ] Deduced a trap composed of 139 places in 232 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 146 places in 194 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 150 places in 208 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 156 places in 213 ms
[2020-06-03 06:49:05] [INFO ] Deduced a trap composed of 150 places in 204 ms
[2020-06-03 06:49:10] [INFO ] Deduced a trap composed of 140 places in 4397 ms
[2020-06-03 06:49:10] [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 s42 s43 s61 s62 s82 s83 s84 s100 s101 s102 s153 s154 s155 s159 s160 s161 s239 s240 s260 s261 s262 s278 s279 s280 s284 s285 s286 s300 s303 s345 s350 s355 s359 s360 s361 s374 s376 s379 s381 s390 s395 s405 s413 s414 s415 s418 s427 s441 s442 s443 s446 s447 s448 s457 s461 s462 s463 s466 s467 s468 s486 s488 s492 s501 s502 s503 s516 s518 s521 s522 s523 s527 s536 s537 s538 s542 s546 s549 s550 s551 s552 s553 s554 s555 s556 s557 s558 s559 s560 s575 s576 s579 s582 s583 s584 s585 s586 s587 s590 s591 s597 s598 s599 s600 s617 s618 s623 s624 s635 s636 s641 s642 s662 s663 s664 s665 s666 s667 s668 s669 s672 s673 s676 s677 s690 s691 s694 s695 s700 s701 s702 s703 s712 s713 s718 s719 s722) 0)") while checking expression at index 0
[2020-06-03 06:49:10] [INFO ] [Real]Absence check using 78 positive place invariants in 96 ms returned sat
[2020-06-03 06:49:10] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 105 ms returned sat
[2020-06-03 06:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:13] [INFO ] [Real]Absence check using state equation in 3070 ms returned sat
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 16 places in 278 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 16 places in 262 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 25 places in 257 ms
[2020-06-03 06:49:14] [INFO ] Deduced a trap composed of 8 places in 280 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 150 places in 6238 ms
[2020-06-03 06:49:21] [INFO ] Deduced a trap composed of 11 places in 468 ms
[2020-06-03 06:49:25] [INFO ] Deduced a trap composed of 15 places in 3448 ms
[2020-06-03 06:49:26] [INFO ] Deduced a trap composed of 141 places in 744 ms
[2020-06-03 06:49:30] [INFO ] Deduced a trap composed of 43 places in 4298 ms
[2020-06-03 06:49:30] [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 s284 s285 s286 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s331 s332 s333 s334 s384 s385 s386 s393 s395 s396 s397) 0)") while checking expression at index 1
[2020-06-03 06:49:30] [INFO ] [Real]Absence check using 78 positive place invariants in 421 ms returned sat
[2020-06-03 06:49:31] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 156 ms returned sat
[2020-06-03 06:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:33] [INFO ] [Real]Absence check using state equation in 2609 ms returned sat
[2020-06-03 06:49:42] [INFO ] Deduced a trap composed of 8 places in 9216 ms
[2020-06-03 06:49:49] [INFO ] Deduced a trap composed of 15 places in 7019 ms
[2020-06-03 06:49:50] [INFO ] Deduced a trap composed of 20 places in 254 ms
[2020-06-03 06:49:52] [INFO ] Deduced a trap composed of 15 places in 2266 ms
[2020-06-03 06:49:52] [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 s281 s384 s385 s386 s714 s715) 0)") while checking expression at index 2
[2020-06-03 06:49:52] [INFO ] [Real]Absence check using 78 positive place invariants in 84 ms returned sat
[2020-06-03 06:49:52] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 85 ms returned sat
[2020-06-03 06:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:57] [INFO ] [Real]Absence check using state equation in 4464 ms returned sat
[2020-06-03 06:49:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:49:57] [INFO ] [Nat]Absence check using 78 positive place invariants in 98 ms returned sat
[2020-06-03 06:49:57] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 49 ms returned sat
[2020-06-03 06:49:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:49:59] [INFO ] [Nat]Absence check using state equation in 2291 ms returned sat
[2020-06-03 06:50:01] [INFO ] Deduced a trap composed of 13 places in 1144 ms
[2020-06-03 06:50:02] [INFO ] Deduced a trap composed of 11 places in 1378 ms
[2020-06-03 06:50:04] [INFO ] Deduced a trap composed of 8 places in 2074 ms
[2020-06-03 06:50:15] [INFO ] Deduced a trap composed of 15 places in 10860 ms
[2020-06-03 06:50:22] [INFO ] Deduced a trap composed of 16 places in 6900 ms
[2020-06-03 06:50:22] [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 s37 s40 s41 s290 s291 s292 s300 s303 s345 s390 s405 s565 s566) 0)") while checking expression at index 3
[2020-06-03 06:50:22] [INFO ] [Real]Absence check using 78 positive place invariants in 191 ms returned sat
[2020-06-03 06:50:22] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 95 ms returned sat
[2020-06-03 06:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:28] [INFO ] [Real]Absence check using state equation in 5523 ms returned sat
[2020-06-03 06:50:35] [INFO ] Deduced a trap composed of 25 places in 7434 ms
[2020-06-03 06:50:41] [INFO ] Deduced a trap composed of 11 places in 5825 ms
[2020-06-03 06:50:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 13339 ms
[2020-06-03 06:50:42] [INFO ] [Real]Absence check using 78 positive place invariants in 434 ms returned sat
[2020-06-03 06:50:42] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 170 ms returned sat
[2020-06-03 06:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:48] [INFO ] [Real]Absence check using state equation in 5443 ms returned sat
[2020-06-03 06:50:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:50:48] [INFO ] [Nat]Absence check using 78 positive place invariants in 249 ms returned sat
[2020-06-03 06:50:48] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 192 ms returned sat
[2020-06-03 06:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:50:54] [INFO ] [Nat]Absence check using state equation in 5601 ms returned sat
[2020-06-03 06:51:01] [INFO ] Deduced a trap composed of 23 places in 6905 ms
[2020-06-03 06:51:08] [INFO ] Deduced a trap composed of 16 places in 7699 ms
[2020-06-03 06:51: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s281 s284 s285 s286 s384 s385 s386) 0)") while checking expression at index 5
[2020-06-03 06:51:09] [INFO ] [Real]Absence check using 78 positive place invariants in 409 ms returned sat
[2020-06-03 06:51:09] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 163 ms returned sat
[2020-06-03 06:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:15] [INFO ] [Real]Absence check using state equation in 5465 ms returned sat
[2020-06-03 06:51:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:51:15] [INFO ] [Nat]Absence check using 78 positive place invariants in 321 ms returned sat
[2020-06-03 06:51:15] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 165 ms returned sat
[2020-06-03 06:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:21] [INFO ] [Nat]Absence check using state equation in 5574 ms returned sat
[2020-06-03 06:51:26] [INFO ] Deduced a trap composed of 26 places in 5326 ms
[2020-06-03 06:51:33] [INFO ] Deduced a trap composed of 8 places in 6175 ms
[2020-06-03 06:51:37] [INFO ] Deduced a trap composed of 8 places in 4306 ms
[2020-06-03 06:51:37] [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 s300 s303 s404 s405 s406) 0)") while checking expression at index 6
[2020-06-03 06:51:37] [INFO ] [Real]Absence check using 78 positive place invariants in 209 ms returned sat
[2020-06-03 06:51:37] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 73 ms returned sat
[2020-06-03 06:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:51:43] [INFO ] [Real]Absence check using state equation in 5831 ms returned sat
[2020-06-03 06:51:50] [INFO ] Deduced a trap composed of 8 places in 6327 ms
[2020-06-03 06:51:57] [INFO ] Deduced a trap composed of 16 places in 7682 ms
[2020-06-03 06:51: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 s37 s38 s39 s40 s41 s42 s43 s300 s303 s390 s405 s718 s719) 0)") while checking expression at index 7
[2020-06-03 06:51:58] [INFO ] [Real]Absence check using 78 positive place invariants in 332 ms returned sat
[2020-06-03 06:51:58] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 249 ms returned sat
[2020-06-03 06:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:04] [INFO ] [Real]Absence check using state equation in 5633 ms returned sat
[2020-06-03 06:52:11] [INFO ] Deduced a trap composed of 23 places in 7541 ms
[2020-06-03 06:52:17] [INFO ] Deduced a trap composed of 21 places in 5318 ms
[2020-06-03 06:52:23] [INFO ] Deduced a trap composed of 16 places in 6251 ms
[2020-06-03 06:52: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s281 s284 s285 s286 s384 s385 s386) 0)") while checking expression at index 8
[2020-06-03 06:52:23] [INFO ] [Real]Absence check using 78 positive place invariants in 278 ms returned sat
[2020-06-03 06:52:24] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 181 ms returned sat
[2020-06-03 06:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:29] [INFO ] [Real]Absence check using state equation in 5492 ms returned sat
[2020-06-03 06:52:35] [INFO ] Deduced a trap composed of 24 places in 6147 ms
[2020-06-03 06:52:40] [INFO ] Deduced a trap composed of 8 places in 4960 ms
[2020-06-03 06:52:46] [INFO ] Deduced a trap composed of 17 places in 5464 ms
[2020-06-03 06:52:46] [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 s37 s38 s39 s300 s303 s349 s350 s351 s390 s405 s565 s566 s718 s719) 0)") while checking expression at index 9
[2020-06-03 06:52:46] [INFO ] [Real]Absence check using 78 positive place invariants in 219 ms returned sat
[2020-06-03 06:52:46] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 199 ms returned sat
[2020-06-03 06:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:52] [INFO ] [Real]Absence check using state equation in 5303 ms returned sat
[2020-06-03 06:52:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:52:52] [INFO ] [Nat]Absence check using 78 positive place invariants in 234 ms returned sat
[2020-06-03 06:52:52] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 131 ms returned sat
[2020-06-03 06:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:52:58] [INFO ] [Nat]Absence check using state equation in 5311 ms returned sat
[2020-06-03 06:53:06] [INFO ] Deduced a trap composed of 14 places in 8337 ms
[2020-06-03 06:53:11] [INFO ] Deduced a trap composed of 18 places in 5180 ms
[2020-06-03 06:53:16] [INFO ] Deduced a trap composed of 26 places in 4796 ms
[2020-06-03 06:53:16] [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 s231 s232 s233 s239 s240 s304 s305 s306 s307 s308 s309 s310 s311 s486 s487 s488 s492 s497 s505 s507 s508 s509 s664 s665) 0)") while checking expression at index 10
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 06:53:17] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 06:53:17] [INFO ] Flatten gal took : 245 ms
[2020-06-03 06:53:17] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-03 06:53:17] [INFO ] Flatten gal took : 136 ms
FORMULA BusinessProcesses-PT-19-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:53:17] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 11 ms.
[2020-06-03 06:53:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-19 @ 3570 seconds

FORMULA BusinessProcesses-PT-19-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-19-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for CTLCardinality @ BusinessProcesses-PT-19

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:53:17 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p663 <= 0))))",
"processed_size": 21,
"rewrites": 20
},
"result":
{
"edges": 240,
"markings": 240,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p188 <= 0))))",
"processed_size": 21,
"rewrites": 20
},
"result":
{
"edges": 247,
"markings": 247,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p509 <= 0)) OR ((p192 <= 1) AND (1 <= p192)))))",
"processed_size": 57,
"rewrites": 20
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p115)) AND ((p261 <= 0)))))",
"processed_size": 41,
"rewrites": 19
},
"result":
{
"edges": 79,
"markings": 79,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p193 <= 0)) OR ((1 <= p519)) OR (((1 <= p562)) AND ((p208 <= 0))))))",
"processed_size": 79,
"rewrites": 20
},
"result":
{
"edges": 391,
"markings": 381,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG(E(((1 <= p651)) U (((p390 <= 0)) OR ((1 <= p154)))))",
"processed_size": 56,
"rewrites": 20
},
"net":
{
"conflict_clusters": 578,
"singleton_clusters": 0
},
"result":
{
"edges": 357,
"markings": 179,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p639)) AND ((p335 <= 0)))",
"processed_size": 33,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p639)) AND ((p335 <= 0)))",
"processed_size": 33,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p521 <= 0)) OR ((1 <= p51)))))",
"processed_size": 40,
"rewrites": 20
},
"result":
{
"edges": 198,
"markings": 198,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27156,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : (A(G(**)) OR **) : A(G(*)) : DEADLOCK : A(G(*)) : E(F(*)) : A(G(E((** U **)))) : A(G(**))"
},
"net":
{
"arcs": 1951,
"conflict_clusters": 578,
"places": 757,
"places_significant": 632,
"singleton_clusters": 0,
"transitions": 670
},
"result":
{
"preliminary_value": "no no no no no yes no no ",
"value": "no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1427/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 757
lola: finding significant places
lola: 757 places, 670 transitions, 632 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p663 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p651 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p519 <= 1)
lola: LP says that atomic proposition is always true: (p208 <= 1)
lola: A (G ((((p509 <= 0)) OR ((p192 <= 1) AND (1 <= p192))))) : (A (G ((((p521 <= 0)) OR ((1 <= p51))))) OR (((1 <= p639)) AND ((p335 <= 0)))) : A (G (NOT(A (F (((1 <= p663))))))) : A (X ((1 <= 0))) : A (G (NOT(E (F (((1 <= p188))))))) : (E (X (E (G ((1 <= 0))))) OR NOT(A (G ((((p115 <= 0)) OR ((1 <= p261))))))) : A (G (E ((((1 <= p651)) U (((p390 <= 0)) OR ((1 <= p154))))))) : A (G ((((p193 <= 0)) OR ((1 <= p519)) OR (((1 <= p562)) AND ((p208 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p663 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p663 <= 0))))
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p663))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 240 markings, 240 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p188 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p188 <= 0))))
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p188))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 247 markings, 247 edges
lola: ========================================
lola: subprocess 3 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p509 <= 0)) OR ((p192 <= 1) AND (1 <= p192)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p509 <= 0)) OR ((p192 <= 1) AND (1 <= p192)))))
lola: processed formula length: 57
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
sara: try reading problem file CTLCardinality-0.sara.
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p115)) AND ((p261 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p115)) AND ((p261 <= 0)))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p115)) AND ((p261 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 79 edges
lola: ========================================
lola: subprocess 5 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p193 <= 0)) OR ((1 <= p519)) OR (((1 <= p562)) AND ((p208 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p193 <= 0)) OR ((1 <= p519)) OR (((1 <= p562)) AND ((p208 <= 0))))))
lola: processed formula length: 79
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 381 markings, 391 edges
lola: ========================================
lola: subprocess 6 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E ((((1 <= p651)) U (((p390 <= 0)) OR ((1 <= p154)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E(((1 <= p651)) U (((p390 <= 0)) OR ((1 <= p154)))))
lola: processed formula length: 56
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 179 markings, 357 edges
lola: subprocess 7 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p521 <= 0)) OR ((1 <= p51))))) OR (((1 <= p639)) AND ((p335 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p639)) AND ((p335 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p639)) AND ((p335 <= 0)))
lola: processed formula length: 33
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((((p521 <= 0)) OR ((1 <= p51))))) OR (((1 <= p639)) AND ((p335 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p639)) AND ((p335 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p639)) AND ((p335 <= 0)))
lola: processed formula length: 33
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p521 <= 0)) OR ((1 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p521 <= 0)) OR ((1 <= p51)))))
lola: processed formula length: 40
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p521)) AND ((p51 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 198 markings, 198 edges
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no
lola:
preliminary result: no no no no no yes no no
lola: ========================================
lola: memory consumption: 27156 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 7849580 kB
After kill :
MemTotal: 16427332 kB
MemFree: 7838152 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="BusinessProcesses-PT-19"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-19, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;