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-158987914000547.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-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 22:45 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 148K 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-13-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591162954831

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:42:37] [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 05:42:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:42:37] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-06-03 05:42:37] [INFO ] Transformed 593 places.
[2020-06-03 05:42:37] [INFO ] Transformed 536 transitions.
[2020-06-03 05:42:37] [INFO ] Found NUPN structural information;
[2020-06-03 05:42:37] [INFO ] Parsed PT model containing 593 places and 536 transitions in 182 ms.
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 44 ms.
Incomplete random walk after 100000 steps, including 719 resets, run finished after 216 ms. (steps per millisecond=462 ) properties seen :[0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 528 rows 585 cols
[2020-06-03 05:42:38] [INFO ] Computed 95 place invariants in 27 ms
[2020-06-03 05:42:38] [INFO ] [Real]Absence check using 57 positive place invariants in 84 ms returned sat
[2020-06-03 05:42:38] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 95 ms returned sat
[2020-06-03 05:42:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:42:39] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-06-03 05:42:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:42:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 124 ms returned sat
[2020-06-03 05:42:40] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 44 ms returned sat
[2020-06-03 05:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:42:42] [INFO ] [Nat]Absence check using state equation in 2705 ms returned sat
[2020-06-03 05:42:43] [INFO ] Deduced a trap composed of 22 places in 1158 ms
[2020-06-03 05:42:44] [INFO ] Deduced a trap composed of 136 places in 593 ms
[2020-06-03 05:42:45] [INFO ] Deduced a trap composed of 14 places in 531 ms
[2020-06-03 05:42:45] [INFO ] Deduced a trap composed of 143 places in 370 ms
[2020-06-03 05:42:45] [INFO ] Deduced a trap composed of 21 places in 385 ms
[2020-06-03 05:42:46] [INFO ] Deduced a trap composed of 24 places in 241 ms
[2020-06-03 05:42:46] [INFO ] Deduced a trap composed of 37 places in 269 ms
[2020-06-03 05:42:46] [INFO ] Deduced a trap composed of 18 places in 228 ms
[2020-06-03 05:42:47] [INFO ] Deduced a trap composed of 140 places in 425 ms
[2020-06-03 05:42:48] [INFO ] Deduced a trap composed of 46 places in 1231 ms
[2020-06-03 05:42:50] [INFO ] Deduced a trap composed of 24 places in 2084 ms
[2020-06-03 05:42:51] [INFO ] Deduced a trap composed of 15 places in 425 ms
[2020-06-03 05:42:51] [INFO ] Deduced a trap composed of 27 places in 527 ms
[2020-06-03 05:42:52] [INFO ] Deduced a trap composed of 133 places in 410 ms
[2020-06-03 05:42:52] [INFO ] Deduced a trap composed of 37 places in 438 ms
[2020-06-03 05:42:54] [INFO ] Deduced a trap composed of 34 places in 2366 ms
[2020-06-03 05:42:55] [INFO ] Deduced a trap composed of 144 places in 627 ms
[2020-06-03 05:42:56] [INFO ] Deduced a trap composed of 35 places in 338 ms
[2020-06-03 05:42:56] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-06-03 05:42:56] [INFO ] Deduced a trap composed of 27 places in 185 ms
[2020-06-03 05:42:56] [INFO ] Deduced a trap composed of 134 places in 168 ms
[2020-06-03 05:42:56] [INFO ] Deduced a trap composed of 141 places in 181 ms
[2020-06-03 05:42:57] [INFO ] Deduced a trap composed of 36 places in 178 ms
[2020-06-03 05:42:57] [INFO ] Deduced a trap composed of 146 places in 178 ms
[2020-06-03 05:42:57] [INFO ] Deduced a trap composed of 141 places in 181 ms
[2020-06-03 05:42:57] [INFO ] Deduced a trap composed of 70 places in 204 ms
[2020-06-03 05:42:57] [INFO ] Deduced a trap composed of 142 places in 181 ms
[2020-06-03 05:42:58] [INFO ] Deduced a trap composed of 141 places in 210 ms
[2020-06-03 05:42:58] [INFO ] Deduced a trap composed of 149 places in 180 ms
[2020-06-03 05:42:58] [INFO ] Deduced a trap composed of 141 places in 187 ms
[2020-06-03 05:42:58] [INFO ] Deduced a trap composed of 153 places in 165 ms
[2020-06-03 05:43:00] [INFO ] Deduced a trap composed of 138 places in 1886 ms
[2020-06-03 05:43: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s32 s33 s35 s36 s39 s40 s49 s50 s53 s54 s67 s68 s111 s112 s113 s140 s141 s142 s155 s157 s162 s163 s164 s167 s168 s169 s170 s171 s172 s173 s174 s175 s179 s197 s198 s199 s212 s213 s214 s218 s219 s220 s224 s225 s226 s267 s271 s286 s290 s292 s296 s301 s306 s311 s326 s331 s350 s351 s352 s356 s361 s371 s376 s380 s381 s382 s401 s406 s415 s416 s417 s418 s419 s420 s421 s424 s425 s426 s427 s428 s429 s432 s433 s443 s444 s447 s448 s458 s459 s460 s461 s464 s465 s470 s471 s472 s473 s474 s475 s476 s477 s480 s481 s484 s485 s491 s492 s493 s494 s495 s496 s501 s502 s507 s508 s516 s518 s523 s534 s535 s540 s541 s548 s549 s550 s570 s573) 0)") while checking expression at index 0
[2020-06-03 05:43:00] [INFO ] [Real]Absence check using 57 positive place invariants in 59 ms returned sat
[2020-06-03 05:43:00] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 47 ms returned sat
[2020-06-03 05:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:01] [INFO ] [Real]Absence check using state equation in 925 ms returned sat
[2020-06-03 05:43:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:43:02] [INFO ] [Nat]Absence check using 57 positive place invariants in 353 ms returned sat
[2020-06-03 05:43:02] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 39 ms returned sat
[2020-06-03 05:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:03] [INFO ] [Nat]Absence check using state equation in 1368 ms returned sat
[2020-06-03 05:43:05] [INFO ] Deduced a trap composed of 25 places in 1571 ms
[2020-06-03 05:43:05] [INFO ] Deduced a trap composed of 24 places in 561 ms
[2020-06-03 05:43:06] [INFO ] Deduced a trap composed of 15 places in 903 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 17 places in 118 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 24 places in 146 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 22 places in 101 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 25 places in 105 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2020-06-03 05:43:07] [INFO ] Deduced a trap composed of 29 places in 100 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 18 places in 143 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 40 places in 99 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 45 places in 98 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 36 places in 116 ms
[2020-06-03 05:43:08] [INFO ] Deduced a trap composed of 59 places in 141 ms
[2020-06-03 05:43:09] [INFO ] Deduced a trap composed of 39 places in 189 ms
[2020-06-03 05:43:09] [INFO ] Deduced a trap composed of 34 places in 207 ms
[2020-06-03 05:43:09] [INFO ] Deduced a trap composed of 52 places in 146 ms
[2020-06-03 05:43:09] [INFO ] Deduced a trap composed of 58 places in 95 ms
[2020-06-03 05:43:09] [INFO ] Deduced a trap composed of 51 places in 104 ms
[2020-06-03 05:43:09] [INFO ] Deduced a trap composed of 39 places in 111 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 37 places in 96 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 53 places in 95 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 52 places in 94 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 52 places in 92 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 48 places in 96 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 50 places in 93 ms
[2020-06-03 05:43:10] [INFO ] Deduced a trap composed of 33 places in 92 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 53 places in 90 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 41 places in 96 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 39 places in 106 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 38 places in 90 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 34 places in 109 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 41 places in 88 ms
[2020-06-03 05:43:11] [INFO ] Deduced a trap composed of 39 places in 90 ms
[2020-06-03 05:43:11] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 8132 ms
[2020-06-03 05:43:11] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 41 ms.
[2020-06-03 05:43:14] [INFO ] Added : 289 causal constraints over 59 iterations in 3049 ms. Result :sat
[2020-06-03 05:43:15] [INFO ] [Real]Absence check using 57 positive place invariants in 104 ms returned sat
[2020-06-03 05:43:15] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 32 ms returned sat
[2020-06-03 05:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:17] [INFO ] [Real]Absence check using state equation in 2070 ms returned sat
[2020-06-03 05:43:18] [INFO ] Deduced a trap composed of 15 places in 1238 ms
[2020-06-03 05:43:19] [INFO ] Deduced a trap composed of 16 places in 1059 ms
[2020-06-03 05:43:20] [INFO ] Deduced a trap composed of 8 places in 589 ms
[2020-06-03 05:43:20] [INFO ] Deduced a trap composed of 15 places in 278 ms
[2020-06-03 05:43:23] [INFO ] Deduced a trap composed of 27 places in 3160 ms
[2020-06-03 05:43:26] [INFO ] Deduced a trap composed of 16 places in 2474 ms
[2020-06-03 05:43:28] [INFO ] Deduced a trap composed of 14 places in 1762 ms
[2020-06-03 05:43:28] [INFO ] Deduced a trap composed of 22 places in 395 ms
[2020-06-03 05:43:28] [INFO ] Deduced a trap composed of 111 places in 323 ms
[2020-06-03 05:43:29] [INFO ] Deduced a trap composed of 18 places in 356 ms
[2020-06-03 05:43:29] [INFO ] Deduced a trap composed of 136 places in 379 ms
[2020-06-03 05:43:30] [INFO ] Deduced a trap composed of 39 places in 384 ms
[2020-06-03 05:43:30] [INFO ] Deduced a trap composed of 24 places in 635 ms
[2020-06-03 05:43:32] [INFO ] Deduced a trap composed of 129 places in 1869 ms
[2020-06-03 05:43:32] [INFO ] Deduced a trap composed of 22 places in 216 ms
[2020-06-03 05:43:33] [INFO ] Deduced a trap composed of 22 places in 207 ms
[2020-06-03 05:43:33] [INFO ] Deduced a trap composed of 140 places in 468 ms
[2020-06-03 05:43:33] [INFO ] Deduced a trap composed of 39 places in 239 ms
[2020-06-03 05:43:36] [INFO ] Deduced a trap composed of 31 places in 2232 ms
[2020-06-03 05:43:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s203 s267 s281 s286 s296 s326 s395 s396 s397 s401 s434 s435 s436 s437 s440 s466 s467 s507 s508 s534 s535) 0)") while checking expression at index 2
[2020-06-03 05:43:36] [INFO ] [Real]Absence check using 57 positive place invariants in 58 ms returned sat
[2020-06-03 05:43:36] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 32 ms returned sat
[2020-06-03 05:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:37] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2020-06-03 05:43:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:43:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 89 ms returned sat
[2020-06-03 05:43:37] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 32 ms returned sat
[2020-06-03 05:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:40] [INFO ] [Nat]Absence check using state equation in 3029 ms returned sat
[2020-06-03 05:43:40] [INFO ] Deduced a trap composed of 12 places in 125 ms
[2020-06-03 05:43:41] [INFO ] Deduced a trap composed of 15 places in 255 ms
[2020-06-03 05:43:41] [INFO ] Deduced a trap composed of 33 places in 127 ms
[2020-06-03 05:43:41] [INFO ] Deduced a trap composed of 45 places in 194 ms
[2020-06-03 05:43:41] [INFO ] Deduced a trap composed of 44 places in 106 ms
[2020-06-03 05:43:41] [INFO ] Deduced a trap composed of 48 places in 147 ms
[2020-06-03 05:43:41] [INFO ] Deduced a trap composed of 24 places in 109 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 14 places in 106 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 56 places in 99 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 54 places in 129 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 43 places in 133 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 60 places in 127 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 16 places in 129 ms
[2020-06-03 05:43:42] [INFO ] Deduced a trap composed of 19 places in 103 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 42 places in 1181 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 16 places in 223 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 23 places in 227 ms
[2020-06-03 05:43:44] [INFO ] Deduced a trap composed of 45 places in 224 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 46 places in 212 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 33 places in 108 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 64 places in 109 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 48 places in 107 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 88 places in 162 ms
[2020-06-03 05:43:45] [INFO ] Deduced a trap composed of 46 places in 139 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 66 places in 150 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 55 places in 115 ms
[2020-06-03 05:43:46] [INFO ] Deduced a trap composed of 53 places in 144 ms
[2020-06-03 05:43:46] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5787 ms
[2020-06-03 05:43:46] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 28 ms.
[2020-06-03 05:43:49] [INFO ] Added : 347 causal constraints over 70 iterations in 3488 ms. Result :sat
[2020-06-03 05:43:50] [INFO ] Deduced a trap composed of 37 places in 581 ms
[2020-06-03 05:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 683 ms
[2020-06-03 05:43:50] [INFO ] [Real]Absence check using 57 positive place invariants in 33 ms returned sat
[2020-06-03 05:43:50] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 23 ms returned sat
[2020-06-03 05:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:51] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-06-03 05:43:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:43:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 266 ms returned sat
[2020-06-03 05:43:52] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 116 ms returned sat
[2020-06-03 05:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:43:53] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2020-06-03 05:43:54] [INFO ] Deduced a trap composed of 24 places in 1057 ms
[2020-06-03 05:43:55] [INFO ] Deduced a trap composed of 17 places in 1061 ms
[2020-06-03 05:43:55] [INFO ] Deduced a trap composed of 27 places in 163 ms
[2020-06-03 05:43:55] [INFO ] Deduced a trap composed of 36 places in 168 ms
[2020-06-03 05:43:56] [INFO ] Deduced a trap composed of 133 places in 940 ms
[2020-06-03 05:43:57] [INFO ] Deduced a trap composed of 124 places in 305 ms
[2020-06-03 05:43:57] [INFO ] Deduced a trap composed of 137 places in 164 ms
[2020-06-03 05:43:57] [INFO ] Deduced a trap composed of 38 places in 246 ms
[2020-06-03 05:43:57] [INFO ] Deduced a trap composed of 48 places in 176 ms
[2020-06-03 05:43:58] [INFO ] Deduced a trap composed of 133 places in 781 ms
[2020-06-03 05:43:59] [INFO ] Deduced a trap composed of 41 places in 498 ms
[2020-06-03 05:43:59] [INFO ] Deduced a trap composed of 45 places in 206 ms
[2020-06-03 05:44:00] [INFO ] Deduced a trap composed of 137 places in 748 ms
[2020-06-03 05:44:00] [INFO ] Deduced a trap composed of 36 places in 154 ms
[2020-06-03 05:44:00] [INFO ] Deduced a trap composed of 125 places in 189 ms
[2020-06-03 05:44:00] [INFO ] Deduced a trap composed of 140 places in 154 ms
[2020-06-03 05:44:00] [INFO ] Deduced a trap composed of 31 places in 194 ms
[2020-06-03 05:44:01] [INFO ] Deduced a trap composed of 43 places in 308 ms
[2020-06-03 05:44:01] [INFO ] Deduced a trap composed of 46 places in 171 ms
[2020-06-03 05:44:01] [INFO ] Deduced a trap composed of 53 places in 424 ms
[2020-06-03 05:44:06] [INFO ] Deduced a trap composed of 51 places in 4830 ms
[2020-06-03 05:44:07] [INFO ] Deduced a trap composed of 143 places in 178 ms
[2020-06-03 05:44:07] [INFO ] Deduced a trap composed of 31 places in 385 ms
[2020-06-03 05:44:07] [INFO ] Deduced a trap composed of 138 places in 178 ms
[2020-06-03 05:44:07] [INFO ] Deduced a trap composed of 142 places in 155 ms
[2020-06-03 05:44:08] [INFO ] Deduced a trap composed of 157 places in 232 ms
[2020-06-03 05:44:08] [INFO ] Deduced a trap composed of 138 places in 311 ms
[2020-06-03 05:44:08] [INFO ] Deduced a trap composed of 149 places in 204 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 146 places in 279 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 138 places in 169 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 129 places in 158 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 136 places in 202 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 145 places in 166 ms
[2020-06-03 05:44:09] [INFO ] Deduced a trap composed of 139 places in 169 ms
[2020-06-03 05:44:10] [INFO ] Deduced a trap composed of 150 places in 181 ms
[2020-06-03 05:44:10] [INFO ] Deduced a trap composed of 131 places in 376 ms
[2020-06-03 05:44:10] [INFO ] Deduced a trap composed of 22 places in 54 ms
[2020-06-03 05:44:10] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2020-06-03 05:44:10] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 17521 ms
[2020-06-03 05:44:10] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 27 ms.
[2020-06-03 05:44:11] [INFO ] Added : 85 causal constraints over 17 iterations in 753 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 05:44:12] [INFO ] [Real]Absence check using 57 positive place invariants in 368 ms returned sat
[2020-06-03 05:44:12] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2020-06-03 05:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:44:12] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2020-06-03 05:44:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:44:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 80 ms returned sat
[2020-06-03 05:44:13] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 32 ms returned sat
[2020-06-03 05:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:44:14] [INFO ] [Nat]Absence check using state equation in 1661 ms returned sat
[2020-06-03 05:44:15] [INFO ] Deduced a trap composed of 15 places in 242 ms
[2020-06-03 05:44:15] [INFO ] Deduced a trap composed of 35 places in 627 ms
[2020-06-03 05:44:15] [INFO ] Deduced a trap composed of 11 places in 168 ms
[2020-06-03 05:44:16] [INFO ] Deduced a trap composed of 31 places in 193 ms
[2020-06-03 05:44:16] [INFO ] Deduced a trap composed of 34 places in 161 ms
[2020-06-03 05:44:16] [INFO ] Deduced a trap composed of 41 places in 212 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 39 places in 948 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 44 places in 100 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 57 places in 99 ms
[2020-06-03 05:44:17] [INFO ] Deduced a trap composed of 18 places in 109 ms
[2020-06-03 05:44:19] [INFO ] Deduced a trap composed of 40 places in 1951 ms
[2020-06-03 05:44:20] [INFO ] Deduced a trap composed of 52 places in 540 ms
[2020-06-03 05:44:20] [INFO ] Deduced a trap composed of 37 places in 306 ms
[2020-06-03 05:44:21] [INFO ] Deduced a trap composed of 23 places in 555 ms
[2020-06-03 05:44:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 6701 ms
[2020-06-03 05:44:21] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 34 ms.
[2020-06-03 05:44:24] [INFO ] Added : 285 causal constraints over 58 iterations in 2937 ms. Result :sat
[2020-06-03 05:44:24] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-06-03 05:44:24] [INFO ] Deduced a trap composed of 35 places in 108 ms
[2020-06-03 05:44:26] [INFO ] Deduced a trap composed of 39 places in 1371 ms
[2020-06-03 05:44:26] [INFO ] Deduced a trap composed of 38 places in 236 ms
[2020-06-03 05:44:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2115 ms
[2020-06-03 05:44:26] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 05:44:26] [INFO ] Flatten gal took : 121 ms
[2020-06-03 05:44:26] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 05:44:26] [INFO ] Flatten gal took : 30 ms
FORMULA BusinessProcesses-PT-13-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:44:26] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 05:44:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BusinessProcesses-PT-13 @ 3570 seconds

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

FORMULA BusinessProcesses-PT-13-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA BusinessProcesses-PT-13-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-13-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLCardinality @ BusinessProcesses-PT-13

{
"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 05:44:27 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 2,
"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": "AX(((((p312 <= 0)) OR ((1 <= p426))) AND (((p554 <= 0)) OR ((1 <= p329)))))",
"processed_size": 77,
"rewrites": 15
},
"net":
{
"conflict_clusters": 444,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "E (F (((1 <= p184))))",
"processed_size": 21,
"rewrites": 15
},
"result":
{
"edges": 263,
"markings": 264,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(EF((((1 <= p222)) AND ((p47 <= 0)))))",
"processed_size": 40,
"rewrites": 16
},
"net":
{
"conflict_clusters": 444,
"singleton_clusters": 0
},
"result":
{
"edges": 135,
"markings": 136,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p534 <= 0)) OR ((1 <= p465)))",
"processed_size": 33,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AG(EX((((p345 <= 0)) OR ((1 <= p42)))))",
"processed_size": 40,
"rewrites": 16
},
"net":
{
"conflict_clusters": 444,
"singleton_clusters": 0
},
"result":
{
"edges": 202,
"markings": 202,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((((1 <= p422)) AND ((p246 <= 0))))",
"processed_size": 37,
"rewrites": 15
},
"net":
{
"conflict_clusters": 444,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"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 ((((p484 <= 0)) OR ((p112 <= 1) AND (1 <= p112)))))",
"processed_size": 57,
"rewrites": 16
},
"result":
{
"edges": 208,
"markings": 209,
"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"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"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 ((((p514 <= 0)) OR ((1 <= p453)))))",
"processed_size": 41,
"rewrites": 16
},
"result":
{
"edges": 147,
"markings": 148,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 <= p295)) AND ((p305 <= 0)))))",
"processed_size": 41,
"rewrites": 15
},
"result":
{
"edges": 119,
"markings": 120,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (F (((1 <= p412) AND ((p137 <= 0)) AND ((1 <= p79)) AND ((p3 <= 0)))))",
"processed_size": 72,
"rewrites": 15
},
"result":
{
"edges": 144,
"markings": 145,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "(((1 <= p318)) AND ((p244 <= 0)))",
"processed_size": 33,
"rewrites": 18
},
"result":
{
"edges": 128,
"markings": 128,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 29728,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(X(**)) : (A(X(**)) AND (E(G(**)) OR E(F(**)))) : A(G(A(F(**)))) : A(G(**)) : A(X(E(F(**)))) : (A(G(E(X(**)))) AND **) : DEADLOCK : A(G(**)) : E(F(*))"
},
"net":
{
"arcs": 1566,
"conflict_clusters": 444,
"places": 585,
"places_significant": 490,
"singleton_clusters": 0,
"transitions": 528
},
"result":
{
"preliminary_value": "yes no yes no no yes no no no yes ",
"value": "yes no yes no no yes no no no yes "
},
"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: 1113/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 585
lola: finding significant places
lola: 585 places, 528 transitions, 490 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: (p412 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p426 <= 1)
lola: LP says that atomic proposition is always true: (p329 <= 1)
lola: LP says that atomic proposition is always true: (p544 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p465 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p453 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: E (F (((1 <= p412) AND ((p137 <= 0)) AND ((1 <= p79)) AND ((p3 <= 0))))) : A (X ((((1 <= p422)) AND ((p246 <= 0))))) : (A (((((p523 <= 0)) OR ((1 <= p289))) U (1 <= 0))) OR (A (X (((((p312 <= 0)) OR ((1 <= p426))) AND (((p554 <= 0)) OR ((1 <= p329)))))) AND (E (G (((1 <= p544)))) OR E (F (((1 <= p184))))))) : A (G (A (F ((((p318 <= 0)) OR ((1 <= p244))))))) : A (G ((((p484 <= 0)) OR ((p112 <= 1) AND (1 <= p112))))) : A (X (E (F ((((1 <= p222)) AND ((p47 <= 0))))))) : (A (G (E (X ((((p345 <= 0)) OR ((1 <= p42))))))) AND (((p534 <= 0)) OR ((1 <= p465)))) : (E ((((1 <= p273)) U (1 <= 0))) OR A (X ((1 <= 0)))) : A (G ((((p514 <= 0)) OR ((1 <= p453))))) : E (F (NOT(E (G ((((p295 <= 0)) OR ((1 <= p305))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 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: 14 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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((((p312 <= 0)) OR ((1 <= p426))) AND (((p554 <= 0)) OR ((1 <= p329)))))) AND (E (G (((1 <= p544)))) OR E (F (((1 <= p184))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((((p312 <= 0)) OR ((1 <= p426))) AND (((p554 <= 0)) OR ((1 <= p329))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((((p312 <= 0)) OR ((1 <= p426))) AND (((p554 <= 0)) OR ((1 <= p329)))))
lola: processed formula length: 77
lola: 15 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p184))))
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 <= p184))))
lola: processed formula length: 21
lola: 15 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 264 markings, 263 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((((1 <= p222)) AND ((p47 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((((1 <= p222)) AND ((p47 <= 0)))))
lola: processed formula length: 40
lola: 16 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 136 markings, 135 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((((p345 <= 0)) OR ((1 <= p42))))))) AND (((p534 <= 0)) OR ((1 <= p465))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p534 <= 0)) OR ((1 <= p465)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p534 <= 0)) OR ((1 <= p465)))
lola: processed formula length: 33
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((((p345 <= 0)) OR ((1 <= p42)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((((p345 <= 0)) OR ((1 <= p42)))))
lola: processed formula length: 40
lola: 16 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 1 significant temporal operators and needs 5 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: 202 markings, 202 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p422)) AND ((p246 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p422)) AND ((p246 <= 0))))
lola: processed formula length: 37
lola: 15 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p484 <= 0)) OR ((p112 <= 1) AND (1 <= p112)))))
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 ((((p484 <= 0)) OR ((p112 <= 1) AND (1 <= p112)))))
lola: processed formula length: 57
lola: 16 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 <= p484)) AND ((2 <= p112) OR (p112 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 209 markings, 208 edges
lola: ========================================
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p514 <= 0)) OR ((1 <= p453)))))
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 ((((p514 <= 0)) OR ((1 <= p453)))))
lola: processed formula length: 41
lola: 16 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 <= p514)) AND ((p453 <= 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: 148 markings, 147 edges
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p295)) AND ((p305 <= 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 <= p295)) AND ((p305 <= 0)))))
lola: processed formula length: 41
lola: 15 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 <= p295)) AND ((p305 <= 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: 120 markings, 119 edges
lola: ========================================
lola: subprocess 8 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p412) AND ((p137 <= 0)) AND ((1 <= p79)) AND ((p3 <= 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 <= p412) AND ((p137 <= 0)) AND ((1 <= p79)) AND ((p3 <= 0)))))
lola: processed formula length: 72
lola: 15 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 <= p412) AND ((p137 <= 0)) AND ((1 <= p79)) AND ((p3 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 145 markings, 144 edges
lola: ========================================
lola: subprocess 9 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p318 <= 0)) OR ((1 <= p244)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p318)) AND ((p244 <= 0)))
lola: processed formula length: 33
lola: 18 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p318)) AND ((p244 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation task get result started, id 0
lola: The predicate does not eventually occur from all states.
lola: 128 markings, 128 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p318 <= 0)) OR ((1 <= p244)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes no no no yes
lola:
preliminary result: yes no yes no no yes no no no yes
lola: memory consumption: 29728 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

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