Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 218K May 5 16:51 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 RefineWMG-PT-100100-00
FORMULA_NAME RefineWMG-PT-100100-01
FORMULA_NAME RefineWMG-PT-100100-02
FORMULA_NAME RefineWMG-PT-100100-03
FORMULA_NAME RefineWMG-PT-100100-04
FORMULA_NAME RefineWMG-PT-100100-05
FORMULA_NAME RefineWMG-PT-100100-06
FORMULA_NAME RefineWMG-PT-100100-07
FORMULA_NAME RefineWMG-PT-100100-08
FORMULA_NAME RefineWMG-PT-100100-09
FORMULA_NAME RefineWMG-PT-100100-10
FORMULA_NAME RefineWMG-PT-100100-11
FORMULA_NAME RefineWMG-PT-100100-12
FORMULA_NAME RefineWMG-PT-100100-13
FORMULA_NAME RefineWMG-PT-100100-14
FORMULA_NAME RefineWMG-PT-100100-15

=== Now, execution of the tool begins

BK_START 1621429454037

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:04:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 13:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:04:15] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-19 13:04:15] [INFO ] Transformed 504 places.
[2021-05-19 13:04:15] [INFO ] Transformed 403 transitions.
[2021-05-19 13:04:15] [INFO ] Parsed PT model containing 504 places and 403 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100079 steps, including 0 resets, run finished after 368 ms. (steps per millisecond=271 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0]
// Phase 1: matrix 403 rows 504 cols
[2021-05-19 13:04:16] [INFO ] Computed 202 place invariants in 13 ms
[2021-05-19 13:04:16] [INFO ] [Real]Absence check using 202 positive place invariants in 18 ms returned unsat
[2021-05-19 13:04:16] [INFO ] [Real]Absence check using 202 positive place invariants in 90 ms returned sat
[2021-05-19 13:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:17] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2021-05-19 13:04:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:17] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2021-05-19 13:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:17] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2021-05-19 13:04:17] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2021-05-19 13:04:18] [INFO ] Added : 78 causal constraints over 16 iterations in 339 ms. Result :sat
[2021-05-19 13:04:18] [INFO ] [Real]Absence check using 202 positive place invariants in 56 ms returned sat
[2021-05-19 13:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:18] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2021-05-19 13:04:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:18] [INFO ] [Nat]Absence check using 202 positive place invariants in 86 ms returned sat
[2021-05-19 13:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:19] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2021-05-19 13:04:19] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 34 ms.
[2021-05-19 13:04:19] [INFO ] Added : 75 causal constraints over 15 iterations in 434 ms. Result :sat
[2021-05-19 13:04:20] [INFO ] [Real]Absence check using 202 positive place invariants in 102 ms returned sat
[2021-05-19 13:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:20] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2021-05-19 13:04:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:21] [INFO ] [Nat]Absence check using 202 positive place invariants in 81 ms returned sat
[2021-05-19 13:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:21] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2021-05-19 13:04:21] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 46 ms.
[2021-05-19 13:04:22] [INFO ] Added : 202 causal constraints over 41 iterations in 918 ms. Result :sat
[2021-05-19 13:04:22] [INFO ] [Real]Absence check using 202 positive place invariants in 66 ms returned sat
[2021-05-19 13:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:23] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2021-05-19 13:04:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:23] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2021-05-19 13:04:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:23] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2021-05-19 13:04:23] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2021-05-19 13:04:24] [INFO ] Added : 170 causal constraints over 34 iterations in 711 ms. Result :sat
[2021-05-19 13:04:24] [INFO ] [Real]Absence check using 202 positive place invariants in 84 ms returned sat
[2021-05-19 13:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:25] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-19 13:04:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:25] [INFO ] [Nat]Absence check using 202 positive place invariants in 90 ms returned sat
[2021-05-19 13:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:25] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2021-05-19 13:04:25] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2021-05-19 13:04:26] [INFO ] Added : 199 causal constraints over 40 iterations in 862 ms. Result :sat
[2021-05-19 13:04:26] [INFO ] [Real]Absence check using 202 positive place invariants in 82 ms returned sat
[2021-05-19 13:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:27] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2021-05-19 13:04:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:27] [INFO ] [Nat]Absence check using 202 positive place invariants in 101 ms returned sat
[2021-05-19 13:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:28] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2021-05-19 13:04:28] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2021-05-19 13:04:28] [INFO ] Added : 149 causal constraints over 30 iterations in 555 ms. Result :sat
[2021-05-19 13:04:28] [INFO ] [Real]Absence check using 202 positive place invariants in 5 ms returned unsat
[2021-05-19 13:04:29] [INFO ] [Real]Absence check using 202 positive place invariants in 90 ms returned sat
[2021-05-19 13:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:29] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2021-05-19 13:04:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:29] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2021-05-19 13:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:30] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2021-05-19 13:04:30] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2021-05-19 13:04:30] [INFO ] Added : 198 causal constraints over 40 iterations in 724 ms. Result :sat
[2021-05-19 13:04:30] [INFO ] [Real]Absence check using 202 positive place invariants in 3 ms returned unsat
[2021-05-19 13:04:31] [INFO ] [Real]Absence check using 202 positive place invariants in 76 ms returned sat
[2021-05-19 13:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:31] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2021-05-19 13:04:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:31] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2021-05-19 13:04:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:32] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2021-05-19 13:04:32] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2021-05-19 13:04:32] [INFO ] Added : 75 causal constraints over 15 iterations in 325 ms. Result :sat
[2021-05-19 13:04:32] [INFO ] [Real]Absence check using 202 positive place invariants in 72 ms returned sat
[2021-05-19 13:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:33] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2021-05-19 13:04:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:33] [INFO ] [Nat]Absence check using 202 positive place invariants in 72 ms returned sat
[2021-05-19 13:04:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:33] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2021-05-19 13:04:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2021-05-19 13:04:34] [INFO ] Added : 199 causal constraints over 40 iterations in 799 ms. Result :sat
[2021-05-19 13:04:34] [INFO ] [Real]Absence check using 202 positive place invariants in 4 ms returned unsat
[2021-05-19 13:04:34] [INFO ] [Real]Absence check using 202 positive place invariants in 99 ms returned sat
[2021-05-19 13:04:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:35] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2021-05-19 13:04:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:35] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2021-05-19 13:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:35] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2021-05-19 13:04:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2021-05-19 13:04:36] [INFO ] Added : 75 causal constraints over 15 iterations in 331 ms. Result :sat
[2021-05-19 13:04:36] [INFO ] [Real]Absence check using 202 positive place invariants in 61 ms returned sat
[2021-05-19 13:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:36] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2021-05-19 13:04:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:37] [INFO ] [Nat]Absence check using 202 positive place invariants in 87 ms returned sat
[2021-05-19 13:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:37] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2021-05-19 13:04:37] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 32 ms.
[2021-05-19 13:04:37] [INFO ] Added : 75 causal constraints over 15 iterations in 370 ms. Result :sat
[2021-05-19 13:04:38] [INFO ] [Real]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:38] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-19 13:04:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:38] [INFO ] [Nat]Absence check using 202 positive place invariants in 72 ms returned sat
[2021-05-19 13:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:39] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2021-05-19 13:04:39] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 23 ms.
[2021-05-19 13:04:40] [INFO ] Added : 203 causal constraints over 41 iterations in 811 ms. Result :sat
[2021-05-19 13:04:40] [INFO ] [Real]Absence check using 202 positive place invariants in 7 ms returned unsat
[2021-05-19 13:04:40] [INFO ] [Real]Absence check using 202 positive place invariants in 83 ms returned sat
[2021-05-19 13:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:40] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2021-05-19 13:04:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 113 ms returned sat
[2021-05-19 13:04:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:41] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2021-05-19 13:04:41] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 31 ms.
[2021-05-19 13:04:42] [INFO ] Added : 198 causal constraints over 40 iterations in 945 ms. Result :sat
[2021-05-19 13:04:42] [INFO ] [Real]Absence check using 202 positive place invariants in 152 ms returned sat
[2021-05-19 13:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:43] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2021-05-19 13:04:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2021-05-19 13:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:44] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2021-05-19 13:04:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 20 ms.
[2021-05-19 13:04:44] [INFO ] Added : 117 causal constraints over 24 iterations in 483 ms. Result :sat
[2021-05-19 13:04:44] [INFO ] [Real]Absence check using 202 positive place invariants in 86 ms returned sat
[2021-05-19 13:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:45] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2021-05-19 13:04:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 87 ms returned sat
[2021-05-19 13:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:45] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2021-05-19 13:04:45] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2021-05-19 13:04:46] [INFO ] Added : 30 causal constraints over 6 iterations in 147 ms. Result :sat
[2021-05-19 13:04:46] [INFO ] [Real]Absence check using 202 positive place invariants in 163 ms returned sat
[2021-05-19 13:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:46] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2021-05-19 13:04:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:46] [INFO ] [Nat]Absence check using 202 positive place invariants in 66 ms returned sat
[2021-05-19 13:04:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:47] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-19 13:04:47] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2021-05-19 13:04:47] [INFO ] Added : 27 causal constraints over 6 iterations in 144 ms. Result :sat
[2021-05-19 13:04:47] [INFO ] [Real]Absence check using 202 positive place invariants in 75 ms returned sat
[2021-05-19 13:04:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:48] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-19 13:04:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 93 ms returned sat
[2021-05-19 13:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:48] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2021-05-19 13:04:48] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2021-05-19 13:04:49] [INFO ] Added : 203 causal constraints over 41 iterations in 839 ms. Result :sat
[2021-05-19 13:04:49] [INFO ] [Real]Absence check using 202 positive place invariants in 72 ms returned sat
[2021-05-19 13:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:50] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2021-05-19 13:04:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:50] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2021-05-19 13:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:50] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2021-05-19 13:04:50] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2021-05-19 13:04:51] [INFO ] Added : 199 causal constraints over 40 iterations in 995 ms. Result :sat
[2021-05-19 13:04:52] [INFO ] [Real]Absence check using 202 positive place invariants in 68 ms returned sat
[2021-05-19 13:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:52] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2021-05-19 13:04:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:52] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2021-05-19 13:04:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:53] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2021-05-19 13:04:53] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2021-05-19 13:04:53] [INFO ] Added : 202 causal constraints over 41 iterations in 711 ms. Result :sat
[2021-05-19 13:04:53] [INFO ] [Real]Absence check using 202 positive place invariants in 67 ms returned sat
[2021-05-19 13:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:54] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2021-05-19 13:04:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:54] [INFO ] [Nat]Absence check using 202 positive place invariants in 72 ms returned sat
[2021-05-19 13:04:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:55] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2021-05-19 13:04:55] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 19 ms.
[2021-05-19 13:04:55] [INFO ] Added : 198 causal constraints over 40 iterations in 766 ms. Result :sat
[2021-05-19 13:04:56] [INFO ] [Real]Absence check using 202 positive place invariants in 68 ms returned sat
[2021-05-19 13:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:56] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2021-05-19 13:04:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2021-05-19 13:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:57] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-19 13:04:57] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2021-05-19 13:04:57] [INFO ] Added : 206 causal constraints over 42 iterations in 651 ms. Result :sat
[2021-05-19 13:04:57] [INFO ] [Real]Absence check using 202 positive place invariants in 4 ms returned unsat
[2021-05-19 13:04:57] [INFO ] [Real]Absence check using 202 positive place invariants in 73 ms returned sat
[2021-05-19 13:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:58] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-19 13:04:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:04:58] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2021-05-19 13:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:04:58] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2021-05-19 13:04:58] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 22 ms.
[2021-05-19 13:04:59] [INFO ] Added : 75 causal constraints over 15 iterations in 325 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-05-19 13:04:59] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 13:04:59] [INFO ] Flatten gal took : 71 ms
FORMULA RefineWMG-PT-100100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:04:59] [INFO ] Flatten gal took : 35 ms
[2021-05-19 13:04:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 13:04:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-100100 @ 3570 seconds

FORMULA RefineWMG-PT-100100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-100100-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1641
rslt: Output for LTLCardinality @ RefineWMG-PT-100100

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:04:59 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p267 <= 0)",
"processed_size": 11,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((G ((2 <= p76)) AND ((2 <= p76) U X ((p393 + 1 <= p2))))) AND (1 <= p129)))",
"processed_size": 82,
"rewrites": 91
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 399
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X ((2 <= p412)) OR ((3 <= p214) OR (G ((2 <= p412)) AND F ((X ((2 <= p412)) OR (3 <= p214)))))))",
"processed_size": 100,
"rewrites": 91
},
"result":
{
"edges": 202,
"markings": 203,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "X (G ((p151 <= p354)))",
"processed_size": 22,
"rewrites": 91
},
"result":
{
"edges": 101,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 599
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((1 <= p468))) OR (2 <= p321))))",
"processed_size": 44,
"rewrites": 91
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 749
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((2 <= p385) OR (G ((3 <= p314)) AND F ((2 <= p385))))))",
"processed_size": 62,
"rewrites": 91
},
"result":
{
"edges": 13,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 999
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((F ((p392 <= p307)) OR G ((2 <= p79))))) OR ((1 <= p253) OR (2 <= p79)))))",
"processed_size": 87,
"rewrites": 91
},
"result":
{
"edges": 9853,
"markings": 5181,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1498
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G ((p430 <= 0))",
"processed_size": 15,
"rewrites": 91
},
"result":
{
"edges": 460,
"markings": 361,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2997
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p430 <= 0)",
"processed_size": 11,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2997
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((3 <= p352) AND (3 <= p8))",
"processed_size": 27,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p267 <= 0)",
"processed_size": 11,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G ((p430 <= 0))",
"processed_size": 15,
"rewrites": 91
},
"result":
{
"edges": 460,
"markings": 361,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p430 <= 0)",
"processed_size": 11,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G (F ((p430 <= 0)))",
"processed_size": 19,
"rewrites": 91
},
"result":
{
"edges": 459,
"markings": 360,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((3 <= p352) AND (3 <= p8))",
"processed_size": 27,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G ((p340 <= p176))",
"processed_size": 18,
"rewrites": 91
},
"result":
{
"edges": 1327587,
"markings": 896726,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4008,
"runtime": 1929.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(((X(*) OR *) AND (G(*) AND *))) : F(G((** OR (G(**) AND F(**))))) : (X((G(**) OR F((F(**) AND **)))) OR **) : F(G((F(G((F(**) OR G(**)))) OR (** OR **)))) : X((X((G(**) AND (** U X(**)))) AND **)) : F((X(**) OR (** OR (G(**) AND F((X(**) OR **)))))) : G((X(F(**)) AND (** OR (X(**) AND (** U G(**)))))) : X(G(**)) : X(F((X(F(**)) OR **))) : (F(G(**)) OR (G(**) OR **)) : (* AND (G(*) OR G(F(*))))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "unknown no unknown no no yes unknown no yes unknown no ",
"value": "unknown no unknown no no yes unknown no yes unknown 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: 907/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 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 LTLCardinality.xml
lola: NOT(G ((((X ((3 <= p313)) AND (3 <= p313)) OR F ((3 <= p313))) OR (1 <= p367)))) : NOT(F (NOT(X (G (F (G (X ((G ((3 <= p314)) U (2 <= p385)))))))))) : ((X (G ((p230 + 1 <= p487))) OR X (F ((F ((p487 <= p230)) AND (p2 + 1 <= p176))))) OR (p267 <= 0)) : X (F (G (((F (G ((F ((p392 <= p307)) OR G ((2 <= p79))))) OR (1 <= p253)) OR (2 <= p79))))) : X (((G (X ((2 <= p76))) AND X (((2 <= p76) U X ((p393 + 1 <= p2))))) AND (1 <= p129))) : NOT(G (NOT(F ((G ((2 <= p412)) U (X ((2 <= p412)) OR (3 <= p214))))))) : G ((X (F ((p358 <= p314))) AND ((p358 <= p314) OR (X ((p358 <= p314)) AND ((2 <= p434) U G ((p439 <= 0))))))) : G (X ((p151 <= p354))) : F (X (((1 <= p468) U (F (X (F ((1 <= p468)))) OR (2 <= p321))))) : ((F (X (G (((p419 <= p447) OR (p340 <= p176))))) OR G ((p340 <= p176))) OR ((3 <= p352) AND (3 <= p8))) : NOT((((0 <= 0) U G ((1 <= p430))) U (1 <= p430)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X ((p313 <= 2)) OR (p313 <= 2)) AND (G ((p313 <= 2)) AND (p367 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X ((p313 <= 2)) OR (p313 <= 2)) AND (G ((p313 <= 2)) AND (p367 <= 0))))
lola: processed formula length: 76
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1125089 markings, 1693172 edges, 225018 markings/sec, 0 secs
lola: 2245396 markings, 3379286 edges, 224061 markings/sec, 5 secs
lola: 3364678 markings, 5063772 edges, 223856 markings/sec, 10 secs
lola: 4462026 markings, 6715276 edges, 219470 markings/sec, 15 secs
lola: 5577002 markings, 8393311 edges, 222995 markings/sec, 20 secs
lola: 6663781 markings, 10028924 edges, 217356 markings/sec, 25 secs
lola: 7798350 markings, 11736436 edges, 226914 markings/sec, 30 secs
lola: 8911395 markings, 13411570 edges, 222609 markings/sec, 35 secs
lola: 10043725 markings, 15115717 edges, 226466 markings/sec, 40 secs
lola: 11149974 markings, 16780603 edges, 221250 markings/sec, 45 secs
lola: 12146165 markings, 18279878 edges, 199238 markings/sec, 50 secs
lola: 13124905 markings, 19752884 edges, 195748 markings/sec, 55 secs
lola: 14137370 markings, 21276711 edges, 202493 markings/sec, 60 secs
lola: 15135969 markings, 22779537 edges, 199720 markings/sec, 65 secs
lola: 16161948 markings, 24323653 edges, 205196 markings/sec, 70 secs
lola: 17234433 markings, 25937746 edges, 214497 markings/sec, 75 secs
lola: 18352010 markings, 27619659 edges, 223515 markings/sec, 80 secs
lola: 19451158 markings, 29273884 edges, 219830 markings/sec, 85 secs
lola: 20564427 markings, 30949435 edges, 222654 markings/sec, 90 secs
lola: 21674715 markings, 32620304 edges, 222058 markings/sec, 95 secs
lola: 22770169 markings, 34269040 edges, 219091 markings/sec, 100 secs
lola: 23861942 markings, 35912082 edges, 218355 markings/sec, 105 secs
lola: 24553790 markings, 36953737 edges, 138370 markings/sec, 110 secs
lola: 25087443 markings, 37756678 edges, 106731 markings/sec, 115 secs
lola: 25585195 markings, 38505969 edges, 99550 markings/sec, 120 secs
lola: 26249930 markings, 39506057 edges, 132947 markings/sec, 125 secs
lola: 26869595 markings, 40438703 edges, 123933 markings/sec, 130 secs
lola: 27599589 markings, 41537269 edges, 145999 markings/sec, 135 secs
lola: 28280326 markings, 42561794 edges, 136147 markings/sec, 140 secs
lola: 28906162 markings, 43503726 edges, 125167 markings/sec, 145 secs
lola: 29412443 markings, 44265633 edges, 101256 markings/sec, 150 secs
lola: 30033353 markings, 45200125 edges, 124182 markings/sec, 155 secs
lola: 30379200 markings, 45720644 edges, 69169 markings/sec, 160 secs
lola: 30615629 markings, 46076404 edges, 47286 markings/sec, 165 secs
lola: 30647744 markings, 46124756 edges, 6423 markings/sec, 170 secs
lola: 30648898 markings, 46126515 edges, 231 markings/sec, 175 secs
lola: 30649300 markings, 46127120 edges, 80 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((p230 + 1 <= p487)) OR F ((F ((p487 <= p230)) AND (p2 + 1 <= p176))))) OR (p267 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p267 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p267 <= 0)
lola: processed formula length: 11
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 2 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p230 + 1 <= p487)) OR F ((F ((p487 <= p230)) AND (p2 + 1 <= p176)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p230 + 1 <= p487)) OR F ((F ((p487 <= p230)) AND (p2 + 1 <= p176)))))
lola: processed formula length: 77
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1143238 markings, 1720481 edges, 228648 markings/sec, 0 secs
lola: 2330120 markings, 3506769 edges, 237376 markings/sec, 5 secs
lola: 3528862 markings, 5310863 edges, 239748 markings/sec, 10 secs
lola: 4659913 markings, 7013086 edges, 226210 markings/sec, 15 secs
lola: 5723386 markings, 8613582 edges, 212695 markings/sec, 20 secs
lola: 6813266 markings, 10253922 edges, 217976 markings/sec, 25 secs
lola: 7932471 markings, 11938293 edges, 223841 markings/sec, 30 secs
lola: 9028937 markings, 13588431 edges, 219293 markings/sec, 35 secs
lola: 10177528 markings, 15317132 edges, 229718 markings/sec, 40 secs
lola: 11315441 markings, 17029641 edges, 227583 markings/sec, 45 secs
lola: 12451437 markings, 18739349 edges, 227199 markings/sec, 50 secs
lola: 13581108 markings, 20439465 edges, 225934 markings/sec, 55 secs
lola: 14656815 markings, 22058398 edges, 215141 markings/sec, 60 secs
lola: 15769193 markings, 23732552 edges, 222476 markings/sec, 65 secs
lola: 16851899 markings, 25362056 edges, 216541 markings/sec, 70 secs
lola: 17965920 markings, 27038610 edges, 222804 markings/sec, 75 secs
lola: 19035832 markings, 28648869 edges, 213982 markings/sec, 80 secs
lola: 20137722 markings, 30307202 edges, 220378 markings/sec, 85 secs
lola: 21201312 markings, 31907914 edges, 212718 markings/sec, 90 secs
lola: 22298343 markings, 33558953 edges, 219406 markings/sec, 95 secs
lola: 23358873 markings, 35155049 edges, 212106 markings/sec, 100 secs
lola: 24370893 markings, 36678114 edges, 202404 markings/sec, 105 secs
lola: 24962747 markings, 37568897 edges, 118371 markings/sec, 110 secs
lola: 25399908 markings, 38226934 edges, 87432 markings/sec, 115 secs
lola: 25866847 markings, 38929503 edges, 93388 markings/sec, 120 secs
lola: 26275303 markings, 39544253 edges, 81691 markings/sec, 125 secs
lola: 26871859 markings, 40442117 edges, 119311 markings/sec, 130 secs
lola: 27507729 markings, 41399046 edges, 127174 markings/sec, 135 secs
lola: 28046884 markings, 42210471 edges, 107831 markings/sec, 140 secs
lola: 28689105 markings, 43177034 edges, 128444 markings/sec, 145 secs
lola: 29115656 markings, 43819014 edges, 85310 markings/sec, 150 secs
lola: 29632295 markings, 44596467 edges, 103328 markings/sec, 155 secs
lola: 30195692 markings, 45444423 edges, 112679 markings/sec, 160 secs
lola: 30622566 markings, 46086912 edges, 85375 markings/sec, 165 secs
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: subprocess 2 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G ((2 <= p76)) AND ((2 <= p76) U X ((p393 + 1 <= p2))))) AND (1 <= p129)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G ((2 <= p76)) AND ((2 <= p76) U X ((p393 + 1 <= p2))))) AND (1 <= p129)))
lola: processed formula length: 82
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 101 markings, 101 edges
lola: ========================================
lola: subprocess 3 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((2 <= p412)) OR ((3 <= p214) OR (G ((2 <= p412)) AND F ((X ((2 <= p412)) OR (3 <= p214)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((2 <= p412)) OR ((3 <= p214) OR (G ((2 <= p412)) AND F ((X ((2 <= p412)) OR (3 <= p214)))))))
lola: processed formula length: 100
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 203 markings, 202 edges
lola: ========================================
lola: subprocess 4 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((p358 <= p314))) AND ((p358 <= p314) OR (X ((p358 <= p314)) AND ((2 <= p434) U G ((p439 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((p358 <= p314))) AND ((p358 <= p314) OR (X ((p358 <= p314)) AND ((2 <= p434) U G ((p439 <= 0)))))))
lola: processed formula length: 109
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1024208 markings, 1541328 edges, 204842 markings/sec, 0 secs
lola: 2133053 markings, 3210055 edges, 221769 markings/sec, 5 secs
lola: 3301504 markings, 4968698 edges, 233690 markings/sec, 10 secs
lola: 4461053 markings, 6713757 edges, 231910 markings/sec, 15 secs
lola: 5614336 markings, 8449389 edges, 230657 markings/sec, 20 secs
lola: 6805765 markings, 10242547 edges, 238286 markings/sec, 25 secs
lola: 7843653 markings, 11804624 edges, 207578 markings/sec, 30 secs
lola: 8775853 markings, 13207531 edges, 186440 markings/sec, 35 secs
lola: 9781059 markings, 14720262 edges, 201041 markings/sec, 40 secs
lola: 10828660 markings, 16296895 edges, 209520 markings/sec, 45 secs
lola: 11815175 markings, 17781616 edges, 197303 markings/sec, 50 secs
lola: 12817239 markings, 19289860 edges, 200413 markings/sec, 55 secs
lola: 13809312 markings, 20782755 edges, 198415 markings/sec, 60 secs
lola: 14849677 markings, 22348585 edges, 208073 markings/sec, 65 secs
lola: 15869465 markings, 23883457 edges, 203958 markings/sec, 70 secs
lola: 16887372 markings, 25415352 edges, 203581 markings/sec, 75 secs
lola: 17906302 markings, 26948778 edges, 203786 markings/sec, 80 secs
lola: 18967073 markings, 28545279 edges, 212154 markings/sec, 85 secs
lola: 19998418 markings, 30097549 edges, 206269 markings/sec, 90 secs
lola: 21019665 markings, 31634512 edges, 204249 markings/sec, 95 secs
lola: 22029986 markings, 33154959 edges, 202064 markings/sec, 100 secs
lola: 23065707 markings, 34713671 edges, 207144 markings/sec, 105 secs
lola: 24073508 markings, 36230555 edges, 201560 markings/sec, 110 secs
lola: 25075220 markings, 37738004 edges, 200342 markings/sec, 115 secs
lola: 26076159 markings, 39244516 edges, 200188 markings/sec, 120 secs
lola: 27107832 markings, 40797035 edges, 206335 markings/sec, 125 secs
lola: 27903586 markings, 41995050 edges, 159151 markings/sec, 130 secs
lola: 28345593 markings, 42660377 edges, 88401 markings/sec, 135 secs
lola: 28986091 markings, 43623925 edges, 128100 markings/sec, 140 secs
lola: 29760564 markings, 44789470 edges, 154895 markings/sec, 145 secs
lola: 30087265 markings, 45281099 edges, 65340 markings/sec, 150 secs
lola: 30419790 markings, 45781494 edges, 66505 markings/sec, 155 secs
lola: 30774861 markings, 46315934 edges, 71014 markings/sec, 160 secs
lola: 31277050 markings, 47071674 edges, 100438 markings/sec, 165 secs
lola: 31874835 markings, 47971505 edges, 119557 markings/sec, 170 secs
lola: 32626368 markings, 49102498 edges, 150307 markings/sec, 175 secs
lola: 33259957 markings, 50056105 edges, 126718 markings/sec, 180 secs
lola: 33979813 markings, 51139411 edges, 143971 markings/sec, 185 secs
lola: 34224725 markings, 51508016 edges, 48982 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p151 <= p354)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p151 <= p354)))
lola: processed formula length: 22
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 101 markings, 101 edges
lola: ========================================
lola: subprocess 6 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((1 <= p468))) OR (2 <= p321))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((1 <= p468))) OR (2 <= p321))))
lola: processed formula length: 44
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 7 will run for 749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((2 <= p385) OR (G ((3 <= p314)) AND F ((2 <= p385))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((2 <= p385) OR (G ((3 <= p314)) AND F ((2 <= p385))))))
lola: processed formula length: 62
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 402
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 999 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((F ((p392 <= p307)) OR G ((2 <= p79))))) OR ((1 <= p253) OR (2 <= p79)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((F ((p392 <= p307)) OR G ((2 <= p79))))) OR ((1 <= p253) OR (2 <= p79)))))
lola: processed formula length: 87
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5181 markings, 9853 edges
lola: ========================================
lola: subprocess 9 will run for 1498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p430 <= 0) AND (G ((p430 <= 0)) OR G (F ((p430 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p430 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p430 <= 0))
lola: processed formula length: 15
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 361 markings, 460 edges
lola: ========================================
lola: subprocess 10 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p430 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p430 <= 0)
lola: processed formula length: 11
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: 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: subprocess 10 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p419 <= p447) OR (p340 <= p176)))) OR (G ((p340 <= p176)) OR ((3 <= p352) AND (3 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p352) AND (3 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p352) AND (3 <= p8))
lola: processed formula length: 27
lola: 91 rewrites
lola: closed formula file LTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p419 <= p447) OR (p340 <= p176))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p419 <= p447) OR (p340 <= p176))))
lola: processed formula length: 43
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no no yes unknown no yes unknown unknown
lola: memory consumption: 24100 KB
lola: time consumption: 574 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
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: F (((X ((p313 <= 2)) OR (p313 <= 2)) AND (G ((p313 <= 2)) AND (p367 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X ((p313 <= 2)) OR (p313 <= 2)) AND (G ((p313 <= 2)) AND (p367 <= 0))))
lola: processed formula length: 76
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1024462 markings, 1541702 edges, 204892 markings/sec, 0 secs
lola: 2006276 markings, 3019401 edges, 196363 markings/sec, 5 secs
lola: 3078479 markings, 4633047 edges, 214441 markings/sec, 10 secs
lola: 4091002 markings, 6156856 edges, 202505 markings/sec, 15 secs
lola: 5136560 markings, 7730397 edges, 209112 markings/sec, 20 secs
lola: 6288284 markings, 9463825 edges, 230345 markings/sec, 25 secs
lola: 7381024 markings, 11108343 edges, 218548 markings/sec, 30 secs
lola: 8411479 markings, 12659232 edges, 206091 markings/sec, 35 secs
lola: 9455616 markings, 14230605 edges, 208827 markings/sec, 40 secs
lola: 10491640 markings, 15789859 edges, 207205 markings/sec, 45 secs
lola: 11606604 markings, 17467840 edges, 222993 markings/sec, 50 secs
lola: 12625396 markings, 19001178 edges, 203758 markings/sec, 55 secs
lola: 13643651 markings, 20533604 edges, 203651 markings/sec, 60 secs
lola: 14641599 markings, 22035543 edges, 199590 markings/sec, 65 secs
lola: 15766861 markings, 23729038 edges, 225052 markings/sec, 70 secs
lola: 16801428 markings, 25286037 edges, 206913 markings/sec, 75 secs
lola: 17821748 markings, 26821590 edges, 204064 markings/sec, 80 secs
lola: 18847508 markings, 28365404 edges, 205152 markings/sec, 85 secs
lola: 19984260 markings, 30076220 edges, 227350 markings/sec, 90 secs
lola: 21132002 markings, 31803590 edges, 229548 markings/sec, 95 secs
lola: 22284000 markings, 33537347 edges, 230400 markings/sec, 100 secs
lola: 23419280 markings, 35245954 edges, 227056 markings/sec, 105 secs
lola: 24584169 markings, 36999131 edges, 232978 markings/sec, 110 secs
lola: 25132041 markings, 37823677 edges, 109574 markings/sec, 115 secs
lola: 25536845 markings, 38432895 edges, 80961 markings/sec, 120 secs
lola: 25763022 markings, 38773237 edges, 45235 markings/sec, 125 secs
lola: 26643850 markings, 40098942 edges, 176166 markings/sec, 130 secs
lola: 27355679 markings, 41170222 edges, 142366 markings/sec, 135 secs
lola: 27984613 markings, 42116718 edges, 125787 markings/sec, 140 secs
lola: 28765501 markings, 43292005 edges, 156178 markings/sec, 145 secs
lola: 29007576 markings, 43656345 edges, 48415 markings/sec, 150 secs
lola: 29512869 markings, 44416745 edges, 101059 markings/sec, 155 secs
lola: 30167900 markings, 45402600 edges, 131006 markings/sec, 160 secs
lola: 30567283 markings, 46003685 edges, 79877 markings/sec, 165 secs
lola: 30658029 markings, 46140232 edges, 18149 markings/sec, 170 secs
lola: 30658675 markings, 46141211 edges, 129 markings/sec, 175 secs
lola: 30658781 markings, 46141395 edges, 21 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X ((G ((p230 + 1 <= p487)) OR F ((F ((p487 <= p230)) AND (p2 + 1 <= p176))))) OR (p267 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p267 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p267 <= 0)
lola: processed formula length: 11
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: X ((G ((p230 + 1 <= p487)) OR F ((F ((p487 <= p230)) AND (p2 + 1 <= p176)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p230 + 1 <= p487)) OR F ((F ((p487 <= p230)) AND (p2 + 1 <= p176)))))
lola: processed formula length: 77
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 984528 markings, 1481629 edges, 196906 markings/sec, 0 secs
lola: 1984013 markings, 2985893 edges, 199897 markings/sec, 5 secs
lola: 2953483 markings, 4444902 edges, 193894 markings/sec, 10 secs
lola: 3882821 markings, 5843587 edges, 185868 markings/sec, 15 secs
lola: 4859973 markings, 7314172 edges, 195430 markings/sec, 20 secs
lola: 5871814 markings, 8837002 edges, 202368 markings/sec, 25 secs
lola: 6841193 markings, 10295898 edges, 193876 markings/sec, 30 secs
lola: 7859363 markings, 11828269 edges, 203634 markings/sec, 35 secs
lola: 8847340 markings, 13315147 edges, 197595 markings/sec, 40 secs
lola: 9853753 markings, 14829866 edges, 201283 markings/sec, 45 secs
lola: 10829331 markings, 16298044 edges, 195116 markings/sec, 50 secs
lola: 11863581 markings, 17854567 edges, 206850 markings/sec, 55 secs
lola: 12814595 markings, 19285885 edges, 190203 markings/sec, 60 secs
lola: 13839818 markings, 20828847 edges, 205045 markings/sec, 65 secs
lola: 14831452 markings, 22321301 edges, 198327 markings/sec, 70 secs
lola: 15859713 markings, 23868749 edges, 205652 markings/sec, 75 secs
lola: 16857788 markings, 25370875 edges, 199615 markings/sec, 80 secs
lola: 17893004 markings, 26928905 edges, 207043 markings/sec, 85 secs
lola: 18841227 markings, 28355932 edges, 189645 markings/sec, 90 secs
lola: 19853420 markings, 29879313 edges, 202439 markings/sec, 95 secs
lola: 20815346 markings, 31327021 edges, 192385 markings/sec, 100 secs
lola: 21810733 markings, 32825087 edges, 199077 markings/sec, 105 secs
lola: 22795513 markings, 34307189 edges, 196956 markings/sec, 110 secs
lola: 23831889 markings, 35866889 edges, 207275 markings/sec, 115 secs
lola: 24755235 markings, 37256775 edges, 184669 markings/sec, 120 secs
lola: 25331095 markings, 38123227 edges, 115172 markings/sec, 125 secs
lola: 25809743 markings, 38843673 edges, 95730 markings/sec, 130 secs
lola: 26430559 markings, 39778456 edges, 124163 markings/sec, 135 secs
lola: 27183304 markings, 40911175 edges, 150549 markings/sec, 140 secs
lola: 27888347 markings, 41971882 edges, 141009 markings/sec, 145 secs
lola: 28604760 markings, 43050109 edges, 143283 markings/sec, 150 secs
lola: 29277199 markings, 44062110 edges, 134488 markings/sec, 155 secs
lola: 29961571 markings, 45092017 edges, 136874 markings/sec, 160 secs
lola: 30573892 markings, 46013620 edges, 122464 markings/sec, 165 secs
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: G ((X (F ((p358 <= p314))) AND ((p358 <= p314) OR (X ((p358 <= p314)) AND ((2 <= p434) U G ((p439 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((p358 <= p314))) AND ((p358 <= p314) OR (X ((p358 <= p314)) AND ((2 <= p434) U G ((p439 <= 0)))))))
lola: processed formula length: 109
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1053163 markings, 1584885 edges, 210633 markings/sec, 0 secs
lola: 2110739 markings, 3176427 edges, 211515 markings/sec, 5 secs
lola: 3217680 markings, 4842442 edges, 221388 markings/sec, 10 secs
lola: 4358405 markings, 6559320 edges, 228145 markings/sec, 15 secs
lola: 5478077 markings, 8244302 edges, 223934 markings/sec, 20 secs
lola: 6594839 markings, 9925040 edges, 223352 markings/sec, 25 secs
lola: 7639630 markings, 11497558 edges, 208958 markings/sec, 30 secs
lola: 8666999 markings, 13043721 edges, 205474 markings/sec, 35 secs
lola: 9685729 markings, 14576787 edges, 203746 markings/sec, 40 secs
lola: 10737452 markings, 16159720 edges, 210345 markings/sec, 45 secs
lola: 11769630 markings, 17713115 edges, 206436 markings/sec, 50 secs
lola: 12848295 markings, 19336571 edges, 215733 markings/sec, 55 secs
lola: 13977727 markings, 21036235 edges, 225886 markings/sec, 60 secs
lola: 15150026 markings, 22800644 edges, 234460 markings/sec, 65 secs
lola: 16306373 markings, 24540935 edges, 231269 markings/sec, 70 secs
lola: 17463999 markings, 26283205 edges, 231525 markings/sec, 75 secs
lola: 18646144 markings, 28062295 edges, 236429 markings/sec, 80 secs
lola: 19806391 markings, 29808429 edges, 232049 markings/sec, 85 secs
lola: 20926621 markings, 31494422 edges, 224046 markings/sec, 90 secs
lola: 22072289 markings, 33218621 edges, 229134 markings/sec, 95 secs
lola: 23259759 markings, 35005779 edges, 237494 markings/sec, 100 secs
lola: 24412797 markings, 36741114 edges, 230608 markings/sec, 105 secs
lola: 25562551 markings, 38471419 edges, 229951 markings/sec, 110 secs
lola: 26728760 markings, 40226602 edges, 233242 markings/sec, 115 secs
lola: 27821403 markings, 41871359 edges, 218529 markings/sec, 120 secs
lola: 28421785 markings, 42774674 edges, 120076 markings/sec, 125 secs
lola: 28872241 markings, 43452612 edges, 90091 markings/sec, 130 secs
lola: 29633791 markings, 44598746 edges, 152310 markings/sec, 135 secs
lola: 30105635 markings, 45308845 edges, 94369 markings/sec, 140 secs
lola: 30511385 markings, 45919441 edges, 81150 markings/sec, 145 secs
lola: 30891784 markings, 46491966 edges, 76080 markings/sec, 150 secs
lola: 31535813 markings, 47461272 edges, 128806 markings/sec, 155 secs
lola: 32218056 markings, 48487968 edges, 136449 markings/sec, 160 secs
lola: 32850255 markings, 49439499 edges, 126440 markings/sec, 165 secs
lola: 33647543 markings, 50639426 edges, 159458 markings/sec, 170 secs
lola: 34236791 markings, 51526185 edges, 117850 markings/sec, 175 secs
lola: 34256919 markings, 51556418 edges, 4026 markings/sec, 180 secs
lola: 34258675 markings, 51559083 edges, 351 markings/sec, 185 secs
lola: 34258732 markings, 51559196 edges, 11 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p430 <= 0) AND (G ((p430 <= 0)) OR G (F ((p430 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p430 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p430 <= 0))
lola: processed formula length: 15
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 361 markings, 460 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p430 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p430 <= 0)
lola: processed formula length: 11
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: G (F ((p430 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p430 <= 0)))
lola: processed formula length: 19
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 360 markings, 459 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G (((p419 <= p447) OR (p340 <= p176)))) OR (G ((p340 <= p176)) OR ((3 <= p352) AND (3 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((3 <= p352) AND (3 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p352) AND (3 <= p8))
lola: processed formula length: 27
lola: 91 rewrites
lola: closed formula file LTLCardinality.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: G ((p340 <= p176))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p340 <= p176))
lola: processed formula length: 18
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 896726 markings, 1327587 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p419 <= p447) OR (p340 <= p176))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p419 <= p447) OR (p340 <= p176))))
lola: processed formula length: 43
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 540811 markings, 1042878 edges, 108162 markings/sec, 0 secs
lola: 1110104 markings, 2140487 edges, 113859 markings/sec, 5 secs
lola: 1669570 markings, 3219271 edges, 111893 markings/sec, 10 secs
lola: 2248015 markings, 4326103 edges, 115689 markings/sec, 15 secs
lola: 2812260 markings, 5413924 edges, 112849 markings/sec, 20 secs
lola: 3389049 markings, 6517649 edges, 115358 markings/sec, 25 secs
lola: 3949653 markings, 7598612 edges, 112121 markings/sec, 30 secs
lola: 4512849 markings, 8684595 edges, 112639 markings/sec, 35 secs
lola: 5087037 markings, 9783066 edges, 114838 markings/sec, 40 secs
lola: 5652923 markings, 10874155 edges, 113177 markings/sec, 45 secs
lola: 6208491 markings, 11936943 edges, 111114 markings/sec, 50 secs
lola: 6733463 markings, 12949208 edges, 104994 markings/sec, 55 secs
lola: 7301863 markings, 14045257 edges, 113680 markings/sec, 60 secs
lola: 7889105 markings, 15169032 edges, 117448 markings/sec, 65 secs
lola: 8461087 markings, 16271798 edges, 114396 markings/sec, 70 secs
lola: 9038385 markings, 17376360 edges, 115460 markings/sec, 75 secs
lola: 9608839 markings, 18476362 edges, 114091 markings/sec, 80 secs
lola: 10191681 markings, 19591649 edges, 116568 markings/sec, 85 secs
lola: 10763717 markings, 20694713 edges, 114407 markings/sec, 90 secs
lola: 11337349 markings, 21800522 edges, 114726 markings/sec, 95 secs
lola: 11922889 markings, 22921175 edges, 117108 markings/sec, 100 secs
lola: 12488709 markings, 24012261 edges, 113164 markings/sec, 105 secs
lola: 13060282 markings, 25105764 edges, 114315 markings/sec, 110 secs
lola: 13624210 markings, 26193131 edges, 112786 markings/sec, 115 secs
lola: 14189061 markings, 27277968 edges, 112970 markings/sec, 120 secs
lola: 14781729 markings, 28396749 edges, 118534 markings/sec, 125 secs
lola: 15364370 markings, 29519650 edges, 116528 markings/sec, 130 secs
lola: 16026246 markings, 30745033 edges, 132375 markings/sec, 135 secs
lola: 16706042 markings, 31979464 edges, 135959 markings/sec, 140 secs
lola: 17275464 markings, 33077049 edges, 113884 markings/sec, 145 secs
lola: 18013157 markings, 34356786 edges, 147539 markings/sec, 150 secs
lola: 18580805 markings, 35443024 edges, 113530 markings/sec, 155 secs
lola: 19244438 markings, 36653322 edges, 132727 markings/sec, 160 secs
lola: 19818476 markings, 37742627 edges, 114808 markings/sec, 165 secs
lola: 20374129 markings, 38814399 edges, 111131 markings/sec, 170 secs
lola: 21025260 markings, 40018855 edges, 130226 markings/sec, 175 secs
lola: 21686157 markings, 41242357 edges, 132179 markings/sec, 180 secs
lola: 22286503 markings, 42358259 edges, 120069 markings/sec, 185 secs
lola: 23007618 markings, 43618485 edges, 144223 markings/sec, 190 secs
lola: 23764461 markings, 44912078 edges, 151369 markings/sec, 195 secs
lola: 24491282 markings, 46166216 edges, 145364 markings/sec, 200 secs
lola: 25203845 markings, 47416520 edges, 142513 markings/sec, 205 secs
lola: 25959061 markings, 48694056 edges, 151043 markings/sec, 210 secs
lola: 26740482 markings, 49972227 edges, 156284 markings/sec, 215 secs
lola: 27515592 markings, 51253672 edges, 155022 markings/sec, 220 secs
lola: 28084893 markings, 52346299 edges, 113860 markings/sec, 225 secs
lola: 28802914 markings, 53580128 edges, 143604 markings/sec, 230 secs
lola: 29560222 markings, 54823283 edges, 151462 markings/sec, 235 secs
lola: 30221863 markings, 56016521 edges, 132328 markings/sec, 240 secs
lola: 30973210 markings, 57286543 edges, 150269 markings/sec, 245 secs
lola: 31582835 markings, 58414202 edges, 121925 markings/sec, 250 secs
lola: 32192343 markings, 59540983 edges, 121902 markings/sec, 255 secs
lola: 32810895 markings, 60665650 edges, 123710 markings/sec, 260 secs
lola: 33552008 markings, 61922338 edges, 148223 markings/sec, 265 secs
lola: 34383296 markings, 63205503 edges, 166258 markings/sec, 270 secs
lola: 35185698 markings, 64509232 edges, 160480 markings/sec, 275 secs
lola: 36077108 markings, 65841113 edges, 178282 markings/sec, 280 secs
lola: 36734808 markings, 67020751 edges, 131540 markings/sec, 285 secs
lola: 37474801 markings, 68271647 edges, 147999 markings/sec, 290 secs
lola: 38247040 markings, 69518539 edges, 154448 markings/sec, 295 secs
lola: 39056626 markings, 70825848 edges, 161917 markings/sec, 300 secs
lola: 39771440 markings, 72001013 edges, 142963 markings/sec, 305 secs
lola: 40479073 markings, 73200024 edges, 141527 markings/sec, 310 secs
lola: 41225058 markings, 74482474 edges, 149197 markings/sec, 315 secs
lola: 41907280 markings, 75699618 edges, 136444 markings/sec, 320 secs
lola: 42486008 markings, 76815641 edges, 115746 markings/sec, 325 secs
lola: 43091590 markings, 77957650 edges, 121116 markings/sec, 330 secs
lola: 43650541 markings, 79035669 edges, 111790 markings/sec, 335 secs
lola: 44216497 markings, 80095294 edges, 113191 markings/sec, 340 secs
lola: 44889081 markings, 81289165 edges, 134517 markings/sec, 345 secs
lola: 45715318 markings, 82605335 edges, 165247 markings/sec, 350 secs
lola: 46438369 markings, 83737277 edges, 144610 markings/sec, 355 secs
lola: 47073276 markings, 84907774 edges, 126981 markings/sec, 360 secs
lola: 47860004 markings, 86204534 edges, 157346 markings/sec, 365 secs
lola: 48452847 markings, 87327925 edges, 118569 markings/sec, 370 secs
lola: 49078730 markings, 88478456 edges, 125177 markings/sec, 375 secs
lola: 49855287 markings, 89736116 edges, 155311 markings/sec, 380 secs
lola: 50559738 markings, 90934824 edges, 140890 markings/sec, 385 secs
lola: 51333948 markings, 92210546 edges, 154842 markings/sec, 390 secs
lola: 52117115 markings, 93482729 edges, 156633 markings/sec, 395 secs
lola: 52895018 markings, 94716862 edges, 155581 markings/sec, 400 secs
lola: 53650703 markings, 95984375 edges, 151137 markings/sec, 405 secs
lola: 54527230 markings, 97362484 edges, 175305 markings/sec, 410 secs
lola: 55121612 markings, 98473506 edges, 118876 markings/sec, 415 secs
lola: 55825454 markings, 99660221 edges, 140768 markings/sec, 420 secs
lola: 56471212 markings, 100839029 edges, 129152 markings/sec, 425 secs
lola: 57213872 markings, 102100741 edges, 148532 markings/sec, 430 secs
lola: 58007848 markings, 103379788 edges, 158795 markings/sec, 435 secs
lola: 58649779 markings, 104525037 edges, 128386 markings/sec, 440 secs
lola: 59379041 markings, 105740096 edges, 145852 markings/sec, 445 secs
lola: 60173779 markings, 106970691 edges, 158948 markings/sec, 450 secs
lola: 61095960 markings, 108339816 edges, 184436 markings/sec, 455 secs
lola: 61868470 markings, 109609661 edges, 154502 markings/sec, 460 secs
lola: 62611188 markings, 110821888 edges, 148544 markings/sec, 465 secs
lola: 63370136 markings, 112060447 edges, 151790 markings/sec, 470 secs
lola: 64235000 markings, 113429444 edges, 172973 markings/sec, 475 secs
lola: 64931600 markings, 114652289 edges, 139320 markings/sec, 480 secs
lola: 65590485 markings, 115869745 edges, 131777 markings/sec, 485 secs
lola: 66243273 markings, 117082266 edges, 130558 markings/sec, 490 secs
lola: 66868004 markings, 118250620 edges, 124946 markings/sec, 495 secs
lola: 67684029 markings, 119570578 edges, 163205 markings/sec, 500 secs
lola: 68539636 markings, 120899056 edges, 171121 markings/sec, 505 secs
lola: 69386473 markings, 122245346 edges, 169367 markings/sec, 510 secs
lola: 70210068 markings, 123530771 edges, 164719 markings/sec, 515 secs
lola: 70991738 markings, 124782819 edges, 156334 markings/sec, 520 secs
lola: 71890442 markings, 126164253 edges, 179741 markings/sec, 525 secs
lola: 72754193 markings, 127484955 edges, 172750 markings/sec, 530 secs
lola: 73533298 markings, 128737218 edges, 155821 markings/sec, 535 secs
lola: 74357796 markings, 130074193 edges, 164900 markings/sec, 540 secs
lola: 75079284 markings, 131306427 edges, 144298 markings/sec, 545 secs
lola: 75674946 markings, 132430523 edges, 119132 markings/sec, 550 secs
lola: 76319316 markings, 133604435 edges, 128874 markings/sec, 555 secs
lola: 77056225 markings, 134891288 edges, 147382 markings/sec, 560 secs
lola: 77931606 markings, 136256972 edges, 175076 markings/sec, 565 secs
lola: 78688441 markings, 137478792 edges, 151367 markings/sec, 570 secs
lola: 79535358 markings, 138762555 edges, 169383 markings/sec, 575 secs
lola: 80321597 markings, 140054058 edges, 157248 markings/sec, 580 secs
lola: 81084479 markings, 141329236 edges, 152576 markings/sec, 585 secs
lola: 81967929 markings, 142651051 edges, 176690 markings/sec, 590 secs
lola: 82847870 markings, 143978695 edges, 175988 markings/sec, 595 secs
lola: 83703564 markings, 145272712 edges, 171139 markings/sec, 600 secs
lola: 84597659 markings, 146619221 edges, 178819 markings/sec, 605 secs
lola: 85175697 markings, 147601437 edges, 115608 markings/sec, 610 secs
lola: 85957741 markings, 148826084 edges, 156409 markings/sec, 615 secs
lola: 86666450 markings, 149935918 edges, 141742 markings/sec, 620 secs
lola: 87271287 markings, 150904289 edges, 120967 markings/sec, 625 secs
lola: 87927911 markings, 151928212 edges, 131325 markings/sec, 630 secs
lola: 88619409 markings, 153025132 edges, 138300 markings/sec, 635 secs
lola: 89311774 markings, 154113174 edges, 138473 markings/sec, 640 secs
lola: 89984019 markings, 155164244 edges, 134449 markings/sec, 645 secs
lola: 90791490 markings, 156371208 edges, 161494 markings/sec, 650 secs
lola: 91396193 markings, 157307330 edges, 120941 markings/sec, 655 secs
lola: 92166504 markings, 158448422 edges, 154062 markings/sec, 660 secs
lola: 92821898 markings, 159447669 edges, 131079 markings/sec, 665 secs
lola: 93314047 markings, 160336042 edges, 98430 markings/sec, 670 secs
lola: 93932725 markings, 161355741 edges, 123736 markings/sec, 675 secs
lola: 94571288 markings, 162416501 edges, 127713 markings/sec, 680 secs
lola: 95249274 markings, 163547370 edges, 135597 markings/sec, 685 secs
lola: 95670303 markings, 164340939 edges, 84206 markings/sec, 690 secs
lola: 95993069 markings, 164963503 edges, 64553 markings/sec, 695 secs
lola: 96549884 markings, 165963312 edges, 111363 markings/sec, 700 secs
lola: 97137021 markings, 166968103 edges, 117427 markings/sec, 705 secs
lola: 97844199 markings, 168102399 edges, 141436 markings/sec, 710 secs
lola: 98594031 markings, 169210547 edges, 149966 markings/sec, 715 secs
lola: 99336285 markings, 170392965 edges, 148451 markings/sec, 720 secs
lola: 100083156 markings, 171559144 edges, 149374 markings/sec, 725 secs
lola: 100521704 markings, 172402756 edges, 87710 markings/sec, 730 secs
lola: 101277226 markings, 173597097 edges, 151104 markings/sec, 735 secs
lola: 102006763 markings, 174785470 edges, 145907 markings/sec, 740 secs
lola: 102554144 markings, 175649042 edges, 109476 markings/sec, 745 secs
lola: 103267895 markings, 176828161 edges, 142750 markings/sec, 750 secs
lola: 104030419 markings, 178035837 edges, 152505 markings/sec, 755 secs
lola: 104856642 markings, 179287151 edges, 165245 markings/sec, 760 secs
lola: 105690531 markings, 180519348 edges, 166778 markings/sec, 765 secs
lola: 106491114 markings, 181725774 edges, 160117 markings/sec, 770 secs
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: RESULT
lola:
SUMMARY: unknown no unknown no no yes unknown no yes unknown no
lola:
preliminary result: unknown no unknown no no yes unknown no yes unknown no
lola: memory consumption: 4008 KB
lola: time consumption: 1929 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="RefineWMG-PT-100100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is RefineWMG-PT-100100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432900345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;