Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-100101, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 218K Mar 24 05:38 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 n0-CTLCardinality-00
FORMULA_NAME n0-CTLCardinality-01
FORMULA_NAME n0-CTLCardinality-02
FORMULA_NAME n0-CTLCardinality-03
FORMULA_NAME n0-CTLCardinality-04
FORMULA_NAME n0-CTLCardinality-05
FORMULA_NAME n0-CTLCardinality-06
FORMULA_NAME n0-CTLCardinality-07
FORMULA_NAME n0-CTLCardinality-08
FORMULA_NAME n0-CTLCardinality-09
FORMULA_NAME n0-CTLCardinality-10
FORMULA_NAME n0-CTLCardinality-11
FORMULA_NAME n0-CTLCardinality-12
FORMULA_NAME n0-CTLCardinality-13
FORMULA_NAME n0-CTLCardinality-14
FORMULA_NAME n0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591228158494

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:49:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:49:19] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-06-03 23:49:19] [INFO ] Transformed 504 places.
[2020-06-03 23:49:19] [INFO ] Transformed 403 transitions.
[2020-06-03 23:49:19] [INFO ] Parsed PT model containing 504 places and 403 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100091 steps, including 0 resets, run finished after 348 ms. (steps per millisecond=287 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1]
// Phase 1: matrix 403 rows 504 cols
[2020-06-03 23:49:20] [INFO ] Computed 202 place invariants in 10 ms
[2020-06-03 23:49:21] [INFO ] [Real]Absence check using 202 positive place invariants in 94 ms returned sat
[2020-06-03 23:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:22] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2020-06-03 23:49:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:22] [INFO ] [Nat]Absence check using 202 positive place invariants in 116 ms returned sat
[2020-06-03 23:49:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:23] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2020-06-03 23:49:24] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 24 ms.
[2020-06-03 23:49:25] [INFO ] Added : 252 causal constraints over 51 iterations in 1547 ms. Result :sat
[2020-06-03 23:49:26] [INFO ] [Real]Absence check using 202 positive place invariants in 105 ms returned sat
[2020-06-03 23:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:26] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2020-06-03 23:49:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:26] [INFO ] [Nat]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:27] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2020-06-03 23:49:27] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2020-06-03 23:49:27] [INFO ] Added : 101 causal constraints over 21 iterations in 505 ms. Result :sat
[2020-06-03 23:49:27] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:28] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-03 23:49:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:28] [INFO ] [Nat]Absence check using 202 positive place invariants in 190 ms returned sat
[2020-06-03 23:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:29] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2020-06-03 23:49:29] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 21 ms.
[2020-06-03 23:49:29] [INFO ] Added : 75 causal constraints over 15 iterations in 439 ms. Result :sat
[2020-06-03 23:49:29] [INFO ] [Real]Absence check using 202 positive place invariants in 71 ms returned sat
[2020-06-03 23:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:30] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2020-06-03 23:49:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:31] [INFO ] [Nat]Absence check using 202 positive place invariants in 513 ms returned sat
[2020-06-03 23:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:31] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-06-03 23:49:31] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 12 ms.
[2020-06-03 23:49:32] [INFO ] Added : 202 causal constraints over 41 iterations in 1058 ms. Result :sat
[2020-06-03 23:49:32] [INFO ] [Real]Absence check using 202 positive place invariants in 63 ms returned sat
[2020-06-03 23:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:33] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2020-06-03 23:49:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:33] [INFO ] [Nat]Absence check using 202 positive place invariants in 65 ms returned sat
[2020-06-03 23:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:33] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2020-06-03 23:49:33] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 23 ms.
[2020-06-03 23:49:34] [INFO ] Added : 20 causal constraints over 4 iterations in 132 ms. Result :sat
[2020-06-03 23:49:34] [INFO ] [Real]Absence check using 202 positive place invariants in 67 ms returned sat
[2020-06-03 23:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:34] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-06-03 23:49:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:34] [INFO ] [Nat]Absence check using 202 positive place invariants in 67 ms returned sat
[2020-06-03 23:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:35] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2020-06-03 23:49:35] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:49:35] [INFO ] Added : 100 causal constraints over 20 iterations in 569 ms. Result :sat
[2020-06-03 23:49:36] [INFO ] [Real]Absence check using 202 positive place invariants in 112 ms returned sat
[2020-06-03 23:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:36] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2020-06-03 23:49:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:36] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:37] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-06-03 23:49:37] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:49:38] [INFO ] Added : 204 causal constraints over 41 iterations in 1064 ms. Result :sat
[2020-06-03 23:49:38] [INFO ] [Real]Absence check using 202 positive place invariants in 144 ms returned sat
[2020-06-03 23:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:39] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2020-06-03 23:49:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:39] [INFO ] [Nat]Absence check using 202 positive place invariants in 61 ms returned sat
[2020-06-03 23:49:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:39] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2020-06-03 23:49:39] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 28 ms.
[2020-06-03 23:49:40] [INFO ] Added : 165 causal constraints over 33 iterations in 810 ms. Result :sat
[2020-06-03 23:49:40] [INFO ] [Real]Absence check using 202 positive place invariants in 90 ms returned sat
[2020-06-03 23:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:41] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-06-03 23:49:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:41] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:42] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2020-06-03 23:49:42] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 13 ms.
[2020-06-03 23:49:43] [INFO ] Added : 203 causal constraints over 41 iterations in 1065 ms. Result :sat
[2020-06-03 23:49:43] [INFO ] [Real]Absence check using 202 positive place invariants in 144 ms returned sat
[2020-06-03 23:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:43] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2020-06-03 23:49:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:43] [INFO ] [Nat]Absence check using 202 positive place invariants in 64 ms returned sat
[2020-06-03 23:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:44] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2020-06-03 23:49:44] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 18 ms.
[2020-06-03 23:49:45] [INFO ] Added : 145 causal constraints over 29 iterations in 676 ms. Result :sat
[2020-06-03 23:49:45] [INFO ] [Real]Absence check using 202 positive place invariants in 62 ms returned sat
[2020-06-03 23:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:45] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2020-06-03 23:49:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:45] [INFO ] [Nat]Absence check using 202 positive place invariants in 77 ms returned sat
[2020-06-03 23:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:46] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2020-06-03 23:49:46] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 17 ms.
[2020-06-03 23:49:46] [INFO ] Added : 117 causal constraints over 24 iterations in 568 ms. Result :sat
[2020-06-03 23:49:47] [INFO ] [Real]Absence check using 202 positive place invariants in 118 ms returned sat
[2020-06-03 23:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:48] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2020-06-03 23:49:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:48] [INFO ] [Nat]Absence check using 202 positive place invariants in 171 ms returned sat
[2020-06-03 23:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:49] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-06-03 23:49:49] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 65 ms.
[2020-06-03 23:49:49] [INFO ] Added : 152 causal constraints over 31 iterations in 867 ms. Result :sat
[2020-06-03 23:49:50] [INFO ] [Real]Absence check using 202 positive place invariants in 240 ms returned sat
[2020-06-03 23:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:50] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2020-06-03 23:49:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:50] [INFO ] [Nat]Absence check using 202 positive place invariants in 81 ms returned sat
[2020-06-03 23:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:51] [INFO ] [Nat]Absence check using state equation in 1018 ms returned sat
[2020-06-03 23:49:51] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 34 ms.
[2020-06-03 23:49:52] [INFO ] Added : 104 causal constraints over 21 iterations in 576 ms. Result :sat
[2020-06-03 23:49:53] [INFO ] [Real]Absence check using 202 positive place invariants in 1228 ms returned sat
[2020-06-03 23:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:56] [INFO ] [Real]Absence check using state equation in 2394 ms returned sat
[2020-06-03 23:49:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:49:56] [INFO ] [Nat]Absence check using 202 positive place invariants in 465 ms returned sat
[2020-06-03 23:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:49:57] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2020-06-03 23:49:57] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 26 ms.
[2020-06-03 23:49:59] [INFO ] Added : 202 causal constraints over 41 iterations in 1600 ms. Result :sat
[2020-06-03 23:49:59] [INFO ] [Real]Absence check using 202 positive place invariants in 209 ms returned sat
[2020-06-03 23:49:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:01] [INFO ] [Real]Absence check using state equation in 1715 ms returned sat
[2020-06-03 23:50:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:50:01] [INFO ] [Nat]Absence check using 202 positive place invariants in 134 ms returned sat
[2020-06-03 23:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:50:01] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2020-06-03 23:50:01] [INFO ] Computed and/alt/rep : 302/402/302 causal constraints in 16 ms.
[2020-06-03 23:50:02] [INFO ] Added : 152 causal constraints over 31 iterations in 971 ms. Result :sat
[2020-06-03 23:50:03] [INFO ] Flatten gal took : 143 ms
[2020-06-03 23:50:03] [INFO ] Flatten gal took : 38 ms
[2020-06-03 23:50:03] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2020-06-03 23:50:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-100101 @ 3570 seconds

FORMULA n0-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1764
rslt: Output for CTLCardinality @ RefineWMG-PT-100101

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"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": "(2 <= p214)",
"processed_size": 11,
"rewrites": 10
},
"result":
{
"edges": 117,
"markings": 118,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 239
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((1 <= p475)))",
"processed_size": 19,
"rewrites": 9
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 261
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= p408)))",
"processed_size": 19,
"rewrites": 9
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 287
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((p118 <= p301)))",
"processed_size": 22,
"rewrites": 10
},
"result":
{
"edges": 224,
"markings": 184,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (G ((p89 <= p216)))",
"processed_size": 21,
"rewrites": 10
},
"result":
{
"edges": 9595,
"markings": 9596,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p460 + 1 <= p191) AND ((1 <= p151) OR (2 <= p106) OR (1 <= p163) OR (1 <= p254)))))",
"processed_size": 94,
"rewrites": 10
},
"result":
{
"edges": 4990,
"markings": 4991,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 479
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p288) AND ((p95 <= p108) OR (p424 <= p117) OR (p472 + 1 <= p67)))))",
"processed_size": 82,
"rewrites": 9
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((p172 <= 1) OR ((p221 + 1 <= p127) AND ((p125 <= p221) OR (2 <= p129))) OR ((p429 <= p293) AND (p402 <= p378)))))",
"processed_size": 123,
"rewrites": 9
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1244
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p144 <= p333)",
"processed_size": 14,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2488
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p121 + 1 <= p95) AND (p23 <= p184))",
"processed_size": 37,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p121 + 1 <= p95) AND (p23 <= p184))",
"processed_size": 37,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 21,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= p255)))",
"processed_size": 19,
"rewrites": 9
},
"result":
{
"edges": 152,
"markings": 153,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3836,
"runtime": 1806.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(E(X(**)))) : A(G(**)) : E(G(E((** U **)))) : A(X((** OR E(F(**))))) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E((E(F(**)) U **)) : E(F(**)) : E(X((A(G(**)) AND E(G(**))))) : (E(X(E(F(**)))) OR E(X(E(F(**))))) : (** AND E(F(*))) : (E(F(*)) OR **) : E(F(**))"
},
"net":
{
"arcs": 1208,
"conflict_clusters": 303,
"places": 504,
"places_significant": 302,
"singleton_clusters": 0,
"transitions": 403
},
"result":
{
"preliminary_value": "yes unknown no unknown unknown no yes yes no unknown yes unknown yes yes yes yes ",
"value": "yes unknown no unknown unknown no yes yes no unknown yes unknown yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 CTLCardinality.xml
lola: E (F (((p172 <= 1) OR ((p221 + 1 <= p127) AND ((p125 <= p221) OR (2 <= p129))) OR ((p429 <= p293) AND (p402 <= p378))))) : A (G (E (X (((p266 <= p11) AND (p278 <= p265)))))) : A (G ((p89 <= p216))) : E (G (E (((2 <= p417) U (1 <= p254))))) : A (X (((2 <= p330) OR E (F ((p426 <= p172)))))) : A (G (((p460 + 1 <= p191) AND ((1 <= p151) OR (2 <= p106) OR (1 <= p163) OR (1 <= p254))))) : E (F ((1 <= p475))) : E (F (((3 <= p288) AND ((p95 <= p108) OR (p424 <= p117) OR (p472 + 1 <= p67))))) : A (G ((p118 <= p301))) : E ((E (F ((p442 <= p466))) U ((p262 + 1 <= p104) AND (p496 <= p112) AND (p402 <= p362)))) : E (F (((p405 <= 2) AND (p168 <= 0) AND (p53 + 1 <= p415) AND (p251 <= 2)))) : E (X ((A (G ((p338 <= p488))) AND E (G ((p443 <= p438)))))) : E (X ((E (F ((1 <= p144))) OR E (F ((2 <= p214)))))) : ((p144 <= p333) AND NOT(A (G ((p195 + 1 <= p392))))) : (NOT(A (G ((p255 <= 2)))) OR ((p121 + 1 <= p95) AND (p23 <= p184))) : A (((p423 <= p146) U E (F ((3 <= p408)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p266 <= p11) AND (p278 <= p265))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p266 <= p11) AND (p278 <= p265))))
lola: processed formula length: 42
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1203724 markings, 1811444 edges, 240745 markings/sec, 0 secs
lola: 2354175 markings, 3542883 edges, 230090 markings/sec, 5 secs
lola: 3518326 markings, 5294829 edges, 232830 markings/sec, 10 secs
lola: 4643632 markings, 6988387 edges, 225061 markings/sec, 15 secs
lola: 5774072 markings, 8689582 edges, 226088 markings/sec, 20 secs
lola: 6895161 markings, 10376790 edges, 224218 markings/sec, 25 secs
lola: 8020256 markings, 12070014 edges, 225019 markings/sec, 30 secs
lola: 9155821 markings, 13778970 edges, 227113 markings/sec, 35 secs
lola: 10305566 markings, 15509269 edges, 229949 markings/sec, 40 secs
lola: 11444063 markings, 17222664 edges, 227699 markings/sec, 45 secs
lola: 12583517 markings, 18937519 edges, 227891 markings/sec, 50 secs
lola: 13722243 markings, 20651182 edges, 227745 markings/sec, 55 secs
lola: 14864554 markings, 22370326 edges, 228462 markings/sec, 60 secs
lola: 15531427 markings, 23375198 edges, 133375 markings/sec, 65 secs
lola: 15629560 markings, 23522613 edges, 19627 markings/sec, 70 secs
lola: 15906727 markings, 23938982 edges, 55433 markings/sec, 75 secs
lola: 16294264 markings, 24522151 edges, 77507 markings/sec, 80 secs
lola: 16313706 markings, 24551264 edges, 3888 markings/sec, 85 secs
lola: 16388476 markings, 24663732 edges, 14954 markings/sec, 90 secs
lola: 16434423 markings, 24732926 edges, 9189 markings/sec, 95 secs
lola: 16486836 markings, 24811788 edges, 10483 markings/sec, 100 secs
lola: 16486836 markings, 24811788 edges, 0 markings/sec, 105 secs
lola: 16568336 markings, 24934438 edges, 16300 markings/sec, 110 secs
lola: 16646400 markings, 25051984 edges, 15613 markings/sec, 115 secs
lola: 16702539 markings, 25136422 edges, 11228 markings/sec, 120 secs
lola: 16758876 markings, 25221182 edges, 11267 markings/sec, 125 secs
lola: 16780258 markings, 25253378 edges, 4276 markings/sec, 130 secs
lola: 16943724 markings, 25499378 edges, 32693 markings/sec, 135 secs
lola: 16943724 markings, 25499378 edges, 0 markings/sec, 140 secs
lola: 16943724 markings, 25499378 edges, 0 markings/sec, 145 secs
lola: 16943724 markings, 25499378 edges, 0 markings/sec, 150 secs
lola: 16955340 markings, 25516878 edges, 2323 markings/sec, 155 secs
lola: 17278566 markings, 26003310 edges, 64645 markings/sec, 160 secs
lola: 17278566 markings, 26003310 edges, 0 markings/sec, 165 secs
lola: 17278566 markings, 26003310 edges, 0 markings/sec, 170 secs
lola: 17278566 markings, 26003310 edges, 0 markings/sec, 175 secs
lola: 17283994 markings, 26011447 edges, 1086 markings/sec, 180 secs
lola: 17420701 markings, 26217198 edges, 27341 markings/sec, 185 secs
lola: 17420701 markings, 26217198 edges, 0 markings/sec, 190 secs
lola: 17420701 markings, 26217198 edges, 0 markings/sec, 195 secs
lola: 17420701 markings, 26217198 edges, 0 markings/sec, 200 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p330) OR E (F ((p426 <= p172))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((2 <= p330) OR EF((p426 <= p172))))
lola: processed formula length: 39
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1362332 markings, 2050098 edges, 272466 markings/sec, 0 secs
lola: 2678562 markings, 4031001 edges, 263246 markings/sec, 5 secs
lola: 3996848 markings, 6014995 edges, 263657 markings/sec, 10 secs
lola: 5315477 markings, 7999390 edges, 263726 markings/sec, 15 secs
lola: 6615785 markings, 9956371 edges, 260062 markings/sec, 20 secs
lola: 7881618 markings, 11861348 edges, 253167 markings/sec, 25 secs
lola: 9156158 markings, 13779472 edges, 254908 markings/sec, 30 secs
lola: 10451313 markings, 15728593 edges, 259031 markings/sec, 35 secs
lola: 11743351 markings, 17673025 edges, 258408 markings/sec, 40 secs
lola: 12983801 markings, 19539899 edges, 248090 markings/sec, 45 secs
lola: 14276575 markings, 21485448 edges, 258555 markings/sec, 50 secs
lola: 15535303 markings, 23379735 edges, 251746 markings/sec, 55 secs
lola: 16770061 markings, 25238038 edges, 246952 markings/sec, 60 secs
lola: 18035045 markings, 27141705 edges, 252997 markings/sec, 65 secs
lola: 19313568 markings, 29065889 edges, 255705 markings/sec, 70 secs
lola: 20566292 markings, 30951120 edges, 250545 markings/sec, 75 secs
lola: 21795655 markings, 32801251 edges, 245873 markings/sec, 80 secs
lola: 23051168 markings, 34690745 edges, 251103 markings/sec, 85 secs
lola: 24295100 markings, 36562758 edges, 248786 markings/sec, 90 secs
lola: 25556680 markings, 38461418 edges, 252316 markings/sec, 95 secs
lola: 26621849 markings, 40064525 edges, 213034 markings/sec, 100 secs
lola: 27202064 markings, 40937678 edges, 116043 markings/sec, 105 secs
lola: 27584580 markings, 41513324 edges, 76503 markings/sec, 110 secs
lola: 28137108 markings, 42344824 edges, 110506 markings/sec, 115 secs
lola: 28456043 markings, 42824792 edges, 63787 markings/sec, 120 secs
lola: 28564372 markings, 42987835 edges, 21666 markings/sec, 125 secs
lola: 28570216 markings, 42996636 edges, 1169 markings/sec, 130 secs
lola: 28605172 markings, 43049231 edges, 6991 markings/sec, 135 secs
lola: 28774066 markings, 43303432 edges, 33779 markings/sec, 140 secs
lola: 28911394 markings, 43510065 edges, 27466 markings/sec, 145 secs
lola: 28955839 markings, 43576969 edges, 8889 markings/sec, 150 secs
lola: 29120832 markings, 43825266 edges, 32999 markings/sec, 155 secs
lola: 29146519 markings, 43863940 edges, 5137 markings/sec, 160 secs
lola: 29146519 markings, 43863940 edges, 0 markings/sec, 165 secs
lola: 29299577 markings, 44094330 edges, 30612 markings/sec, 170 secs
lola: 29307804 markings, 44106637 edges, 1645 markings/sec, 175 secs
lola: 29808695 markings, 44860483 edges, 100178 markings/sec, 180 secs
lola: 29808695 markings, 44860483 edges, 0 markings/sec, 185 secs
lola: 30067778 markings, 45250424 edges, 51817 markings/sec, 190 secs
lola: 30501095 markings, 45902517 edges, 86663 markings/sec, 195 secs
lola: 30662768 markings, 46145775 edges, 32335 markings/sec, 200 secs
lola: 30662768 markings, 46145775 edges, 0 markings/sec, 205 secs
lola: 30662768 markings, 46145775 edges, 0 markings/sec, 210 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p338 <= p488))) AND E (G ((p443 <= p438))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((AG((p338 <= p488)) AND EG((p443 <= p438))))
lola: processed formula length: 47
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1375218 markings, 2069562 edges, 275044 markings/sec, 0 secs
lola: 2717990 markings, 4090322 edges, 268554 markings/sec, 5 secs
lola: 4029519 markings, 6064132 edges, 262306 markings/sec, 10 secs
lola: 5346922 markings, 8046754 edges, 263481 markings/sec, 15 secs
lola: 6652490 markings, 10011595 edges, 261114 markings/sec, 20 secs
lola: 7951601 markings, 11966676 edges, 259822 markings/sec, 25 secs
lola: 9259772 markings, 13935451 edges, 261634 markings/sec, 30 secs
lola: 10557824 markings, 15888949 edges, 259610 markings/sec, 35 secs
lola: 11882530 markings, 17882537 edges, 264941 markings/sec, 40 secs
lola: 13180951 markings, 19836554 edges, 259684 markings/sec, 45 secs
lola: 14502697 markings, 21825779 edges, 264349 markings/sec, 50 secs
lola: 15792400 markings, 23766696 edges, 257941 markings/sec, 55 secs
lola: 17095027 markings, 25727095 edges, 260525 markings/sec, 60 secs
lola: 18382918 markings, 27665255 edges, 257578 markings/sec, 65 secs
lola: 19666925 markings, 29597646 edges, 256801 markings/sec, 70 secs
lola: 20946033 markings, 31522645 edges, 255822 markings/sec, 75 secs
lola: 22236304 markings, 33464389 edges, 258054 markings/sec, 80 secs
lola: 23522440 markings, 35400033 edges, 257227 markings/sec, 85 secs
lola: 24824859 markings, 37360086 edges, 260484 markings/sec, 90 secs
lola: 26103810 markings, 39284832 edges, 255790 markings/sec, 95 secs
lola: 26994060 markings, 40624647 edges, 178050 markings/sec, 100 secs
lola: 27502507 markings, 41389844 edges, 101689 markings/sec, 105 secs
lola: 27844725 markings, 41904863 edges, 68444 markings/sec, 110 secs
lola: 27898427 markings, 41985699 edges, 10740 markings/sec, 115 secs
lola: 28185653 markings, 42417922 edges, 57445 markings/sec, 120 secs
lola: 29025855 markings, 43682380 edges, 168040 markings/sec, 125 secs
lola: 29313311 markings, 44114993 edges, 57491 markings/sec, 130 secs
lola: 29328640 markings, 44138051 edges, 3066 markings/sec, 135 secs
lola: 29541227 markings, 44458025 edges, 42517 markings/sec, 140 secs
lola: 29700996 markings, 44698461 edges, 31954 markings/sec, 145 secs
lola: 29879194 markings, 44966642 edges, 35640 markings/sec, 150 secs
lola: 29950395 markings, 45073763 edges, 14240 markings/sec, 155 secs
lola: 30213750 markings, 45470119 edges, 52671 markings/sec, 160 secs
lola: 30326556 markings, 45639833 edges, 22561 markings/sec, 165 secs
lola: 30705303 markings, 46209842 edges, 75749 markings/sec, 170 secs
lola: 30901264 markings, 46504785 edges, 39192 markings/sec, 175 secs
lola: 31152082 markings, 46882251 edges, 50164 markings/sec, 180 secs
lola: 31642309 markings, 47620014 edges, 98045 markings/sec, 185 secs
lola: 32108546 markings, 48321717 edges, 93247 markings/sec, 190 secs
lola: 32136977 markings, 48364462 edges, 5686 markings/sec, 195 secs
lola: 32136977 markings, 48364462 edges, 0 markings/sec, 200 secs
lola: 32230080 markings, 48504590 edges, 18621 markings/sec, 205 secs
lola: 32247655 markings, 48531038 edges, 3515 markings/sec, 210 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((1 <= p144))))) OR E (X (E (F ((2 <= p214))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= p214)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (2 <= p214)
lola: processed formula length: 11
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p214)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 118 markings, 117 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p475)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p475)))
lola: processed formula length: 19
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p475)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p408)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p408)))
lola: processed formula length: 19
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p408)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p118 <= p301)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p118 <= p301)))
lola: processed formula length: 22
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p301 + 1 <= p118)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 184 markings, 224 edges
lola: ========================================
lola: subprocess 7 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p89 <= p216)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p89 <= p216)))
lola: processed formula length: 21
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p216 + 1 <= p89)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9596 markings, 9595 edges
lola: ========================================
lola: subprocess 8 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p405 <= 2) AND (p168 <= 0) AND (p53 + 1 <= p415) AND (p251 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p405 <= 2) AND (p168 <= 0) AND (p53 + 1 <= p415) AND (p251 <= 2))))
lola: processed formula length: 75
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p405 <= 2) AND (p168 <= 0) AND (p53 + 1 <= p415) AND (p251 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10016 markings, 10033 edges
lola: ========================================
lola: subprocess 9 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p460 + 1 <= p191) AND ((1 <= p151) OR (2 <= p106) OR (1 <= p163) OR (1 <= p254)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p460 + 1 <= p191) AND ((1 <= p151) OR (2 <= p106) OR (1 <= p163) OR (1 <= p254)))))
lola: processed formula length: 94
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p191 <= p460) OR ((p151 <= 0) AND (p106 <= 1) AND (p163 <= 0) AND (p254 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4991 markings, 4990 edges
lola: ========================================
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p288) AND ((p95 <= p108) OR (p424 <= p117) OR (p472 + 1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p288) AND ((p95 <= p108) OR (p424 <= p117) OR (p472 + 1 <= p67)))))
lola: processed formula length: 82
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p288) AND ((p95 <= p108) OR (p424 <= p117) OR (p472 + 1 <= p67)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p172 <= 1) OR ((p221 + 1 <= p127) AND ((p125 <= p221) OR (2 <= p129))) OR ((p429 <= p293) AND (p402 <= p378)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p172 <= 1) OR ((p221 + 1 <= p127) AND ((p125 <= p221) OR (2 <= p129))) OR ((p429 <= p293) AND (p402 <= p378)))))
lola: processed formula length: 123
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p172 <= 1) OR ((p221 + 1 <= p127) AND ((p125 <= p221) OR (2 <= p129))) OR ((p429 <= p293) AND (p402 <= p378)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-11-0.sara.
lola: ...considering subproblem: E (G (E (((2 <= p417) U (1 <= p254)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((2 <= p417) U (1 <= p254)))
lola: processed formula length: 32
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 1325351 markings, 1994497 edges, 265070 markings/sec, 0 secs
lola: 2645272 markings, 3980962 edges, 263984 markings/sec, 5 secs
lola: 3934555 markings, 5921282 edges, 257857 markings/sec, 10 secs
lola: 5252394 markings, 7904496 edges, 263568 markings/sec, 15 secs
lola: 6542952 markings, 9846733 edges, 258112 markings/sec, 20 secs
lola: 7799455 markings, 11737701 edges, 251301 markings/sec, 25 secs
lola: 9013961 markings, 13565508 edges, 242901 markings/sec, 30 secs
lola: 10327200 markings, 15541827 edges, 262648 markings/sec, 35 secs
lola: 11610644 markings, 17473381 edges, 256689 markings/sec, 40 secs
lola: 12906616 markings, 19423749 edges, 259194 markings/sec, 45 secs
lola: 14170472 markings, 21325809 edges, 252771 markings/sec, 50 secs
lola: 15450950 markings, 23252828 edges, 256096 markings/sec, 55 secs
lola: 16721069 markings, 25164317 edges, 254024 markings/sec, 60 secs
lola: 18018319 markings, 27116603 edges, 259450 markings/sec, 65 secs
lola: 19300375 markings, 29046012 edges, 256411 markings/sec, 70 secs
lola: 20635917 markings, 31055921 edges, 267108 markings/sec, 75 secs
lola: 21964699 markings, 33055687 edges, 265756 markings/sec, 80 secs
lola: 23273022 markings, 35024639 edges, 261665 markings/sec, 85 secs
lola: 24594979 markings, 37014133 edges, 264391 markings/sec, 90 secs
lola: 25892821 markings, 38967301 edges, 259568 markings/sec, 95 secs
lola: 26274948 markings, 39542392 edges, 76425 markings/sec, 100 secs
lola: 26325891 markings, 39619041 edges, 10189 markings/sec, 105 secs
lola: 26912469 markings, 40501874 edges, 117316 markings/sec, 110 secs
lola: 27057975 markings, 40720824 edges, 29101 markings/sec, 115 secs
lola: 27057975 markings, 40720824 edges, 0 markings/sec, 120 secs
lola: 27248428 markings, 41007427 edges, 38091 markings/sec, 125 secs
lola: 27365387 markings, 41183510 edges, 23392 markings/sec, 130 secs
lola: 27705802 markings, 41695765 edges, 68083 markings/sec, 135 secs
lola: 27805885 markings, 41846390 edges, 20017 markings/sec, 140 secs
lola: 28225882 markings, 42478445 edges, 83999 markings/sec, 145 secs
lola: 28673126 markings, 43151522 edges, 89449 markings/sec, 150 secs
lola: 29457794 markings, 44332459 edges, 156934 markings/sec, 155 secs
lola: 29836816 markings, 44902890 edges, 75804 markings/sec, 160 secs
lola: 30312666 markings, 45618946 edges, 95170 markings/sec, 165 secs
lola: 30816997 markings, 46377959 edges, 100866 markings/sec, 170 secs
lola: 31138648 markings, 46861982 edges, 64330 markings/sec, 175 secs
lola: 31578671 markings, 47524229 edges, 88005 markings/sec, 180 secs
lola: 32192541 markings, 48448093 edges, 122774 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p442 <= p466))) U ((p262 + 1 <= p104) AND (p496 <= p112) AND (p402 <= p362))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((p442 <= p466)) U ((p262 + 1 <= p104) AND (p496 <= p112) AND (p402 <= p362)))
lola: processed formula length: 82
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 967375 markings, 2423126 edges, 193475 markings/sec, 0 secs
lola: 1906108 markings, 4774619 edges, 187747 markings/sec, 5 secs
lola: 2840228 markings, 7114510 edges, 186824 markings/sec, 10 secs
lola: 3769029 markings, 9441153 edges, 185760 markings/sec, 15 secs
lola: 4693125 markings, 11755924 edges, 184819 markings/sec, 20 secs
lola: 5636169 markings, 14118242 edges, 188609 markings/sec, 25 secs
lola: 6556965 markings, 16424846 edges, 184159 markings/sec, 30 secs
lola: 7487598 markings, 18755984 edges, 186127 markings/sec, 35 secs
lola: 8411495 markings, 21070326 edges, 184779 markings/sec, 40 secs
lola: 9345835 markings, 23410784 edges, 186868 markings/sec, 45 secs
lola: 10281786 markings, 25755321 edges, 187190 markings/sec, 50 secs
lola: 11206467 markings, 28071530 edges, 184936 markings/sec, 55 secs
lola: 12150917 markings, 30437373 edges, 188890 markings/sec, 60 secs
lola: 13080312 markings, 32765454 edges, 185879 markings/sec, 65 secs
lola: 14014125 markings, 35104558 edges, 186763 markings/sec, 70 secs
lola: 14933763 markings, 37408264 edges, 183928 markings/sec, 75 secs
lola: 15849196 markings, 39701349 edges, 183087 markings/sec, 80 secs
lola: 16765439 markings, 41996496 edges, 183249 markings/sec, 85 secs
lola: 17690238 markings, 44313094 edges, 184960 markings/sec, 90 secs
lola: 18616341 markings, 46632901 edges, 185221 markings/sec, 95 secs
lola: 19535574 markings, 48935559 edges, 183847 markings/sec, 100 secs
lola: 20460274 markings, 51251850 edges, 184940 markings/sec, 105 secs
lola: 21375502 markings, 53544514 edges, 183046 markings/sec, 110 secs
lola: 22283530 markings, 55819067 edges, 181606 markings/sec, 115 secs
lola: 23198982 markings, 58112222 edges, 183090 markings/sec, 120 secs
lola: 24109713 markings, 60393541 edges, 182146 markings/sec, 125 secs
lola: 25027276 markings, 62692000 edges, 183513 markings/sec, 130 secs
lola: 25940846 markings, 64980466 edges, 182714 markings/sec, 135 secs
lola: 26749286 markings, 67005764 edges, 161688 markings/sec, 140 secs
lola: 27354540 markings, 68522504 edges, 121051 markings/sec, 145 secs
lola: 28018056 markings, 70183899 edges, 132703 markings/sec, 150 secs
lola: 28785561 markings, 72106273 edges, 153501 markings/sec, 155 secs
lola: 29281146 markings, 73347761 edges, 99117 markings/sec, 160 secs
lola: 29982429 markings, 75104432 edges, 140257 markings/sec, 165 secs
lola: 30811421 markings, 77180954 edges, 165798 markings/sec, 170 secs
lola: 31493515 markings, 78889613 edges, 136419 markings/sec, 175 secs
lola: 32274780 markings, 80846650 edges, 156253 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p144 <= p333) AND E (F ((p392 <= p195))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p144 <= p333)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p144 <= p333)
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file CTLCardinality.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: subprocess 15 will run for 2488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p392 <= p195)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p392 <= p195)))
lola: processed formula length: 22
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p392 <= p195)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 101 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p255))) OR ((p121 + 1 <= p95) AND (p23 <= p184)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p121 + 1 <= p95) AND (p23 <= p184))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p121 + 1 <= p95) AND (p23 <= p184))
lola: processed formula length: 37
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p266 <= p11) AND (p278 <= p265))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p266 <= p11) AND (p278 <= p265))))
lola: processed formula length: 42
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1189729 markings, 1790419 edges, 237946 markings/sec, 0 secs
lola: 2339381 markings, 3520551 edges, 229930 markings/sec, 5 secs
lola: 3501586 markings, 5269608 edges, 232441 markings/sec, 10 secs
lola: 4652029 markings, 7001001 edges, 230089 markings/sec, 15 secs
lola: 5809526 markings, 8742992 edges, 231499 markings/sec, 20 secs
lola: 6941076 markings, 10445889 edges, 226310 markings/sec, 25 secs
lola: 8088395 markings, 12172578 edges, 229464 markings/sec, 30 secs
lola: 9237151 markings, 13901391 edges, 229751 markings/sec, 35 secs
lola: 10386052 markings, 15630462 edges, 229780 markings/sec, 40 secs
lola: 11523227 markings, 17341773 edges, 227435 markings/sec, 45 secs
lola: 12667492 markings, 19063868 edges, 228853 markings/sec, 50 secs
lola: 13805224 markings, 20776039 edges, 227546 markings/sec, 55 secs
lola: 14948501 markings, 22496698 edges, 228655 markings/sec, 60 secs
lola: 15639129 markings, 23536241 edges, 138126 markings/sec, 65 secs
lola: 15939496 markings, 23988146 edges, 60073 markings/sec, 70 secs
lola: 16564676 markings, 24929221 edges, 125036 markings/sec, 75 secs
lola: 16996322 markings, 25578667 edges, 86329 markings/sec, 80 secs
lola: 17553765 markings, 26417457 edges, 111489 markings/sec, 85 secs
lola: 18400287 markings, 27691506 edges, 169304 markings/sec, 90 secs
lola: 18879287 markings, 28412291 edges, 95800 markings/sec, 95 secs
lola: 19369661 markings, 29150312 edges, 98075 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p330) OR E (F ((p426 <= p172))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((2 <= p330) OR EF((p426 <= p172))))
lola: processed formula length: 39
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1369151 markings, 2060392 edges, 273830 markings/sec, 0 secs
lola: 2677790 markings, 4029838 edges, 261728 markings/sec, 5 secs
lola: 3985285 markings, 5997519 edges, 261499 markings/sec, 10 secs
lola: 5242764 markings, 7889961 edges, 251496 markings/sec, 15 secs
lola: 6525621 markings, 9820651 edges, 256571 markings/sec, 20 secs
lola: 7801991 markings, 11741504 edges, 255274 markings/sec, 25 secs
lola: 9119490 markings, 13724280 edges, 263500 markings/sec, 30 secs
lola: 10463976 markings, 15747959 edges, 268897 markings/sec, 35 secs
lola: 11806798 markings, 17768506 edges, 268564 markings/sec, 40 secs
lola: 13127606 markings, 19756293 edges, 264162 markings/sec, 45 secs
lola: 14468133 markings, 21773721 edges, 268105 markings/sec, 50 secs
lola: 15783469 markings, 23753166 edges, 263067 markings/sec, 55 secs
lola: 17105677 markings, 25743139 edges, 264442 markings/sec, 60 secs
lola: 18444449 markings, 27757828 edges, 267754 markings/sec, 65 secs
lola: 19747095 markings, 29718309 edges, 260529 markings/sec, 70 secs
lola: 21071591 markings, 31711593 edges, 264899 markings/sec, 75 secs
lola: 22395724 markings, 33704297 edges, 264827 markings/sec, 80 secs
lola: 23703255 markings, 35672138 edges, 261506 markings/sec, 85 secs
lola: 25014605 markings, 37645629 edges, 262270 markings/sec, 90 secs
lola: 26303531 markings, 39585703 edges, 257785 markings/sec, 95 secs
lola: 27180389 markings, 40905036 edges, 175372 markings/sec, 100 secs
lola: 27759698 markings, 41776870 edges, 115862 markings/sec, 105 secs
lola: 28747899 markings, 43264002 edges, 197640 markings/sec, 110 secs
lola: 29805835 markings, 44856182 edges, 211587 markings/sec, 115 secs
lola: 30380498 markings, 45721030 edges, 114933 markings/sec, 120 secs
lola: 30915108 markings, 46525552 edges, 106922 markings/sec, 125 secs
lola: 31954909 markings, 48090431 edges, 207960 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p338 <= p488))) AND E (G ((p443 <= p438))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((AG((p338 <= p488)) AND EG((p443 <= p438))))
lola: processed formula length: 47
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1418145 markings, 2134156 edges, 283629 markings/sec, 0 secs
lola: 2781642 markings, 4186118 edges, 272699 markings/sec, 5 secs
lola: 4156610 markings, 6255415 edges, 274994 markings/sec, 10 secs
lola: 5544461 markings, 8344021 edges, 277570 markings/sec, 15 secs
lola: 6903122 markings, 10388784 edges, 271732 markings/sec, 20 secs
lola: 8258855 markings, 12429099 edges, 271147 markings/sec, 25 secs
lola: 9631643 markings, 14495075 edges, 274558 markings/sec, 30 secs
lola: 10983071 markings, 16528895 edges, 270286 markings/sec, 35 secs
lola: 12322869 markings, 18545237 edges, 267960 markings/sec, 40 secs
lola: 13662257 markings, 20560912 edges, 267878 markings/sec, 45 secs
lola: 15020624 markings, 22605217 edges, 271673 markings/sec, 50 secs
lola: 16373353 markings, 24640988 edges, 270546 markings/sec, 55 secs
lola: 17718977 markings, 26666066 edges, 269125 markings/sec, 60 secs
lola: 19083515 markings, 28719685 edges, 272908 markings/sec, 65 secs
lola: 20443194 markings, 30765871 edges, 271936 markings/sec, 70 secs
lola: 21782559 markings, 32781593 edges, 267873 markings/sec, 75 secs
lola: 23137797 markings, 34821170 edges, 271048 markings/sec, 80 secs
lola: 24483762 markings, 36846709 edges, 269193 markings/sec, 85 secs
lola: 25813775 markings, 38848368 edges, 266003 markings/sec, 90 secs
lola: 26837010 markings, 40388352 edges, 204647 markings/sec, 95 secs
lola: 27308299 markings, 41097635 edges, 94258 markings/sec, 100 secs
lola: 27617807 markings, 41563349 edges, 61902 markings/sec, 105 secs
lola: 28616677 markings, 43066574 edges, 199774 markings/sec, 110 secs
lola: 29589020 markings, 44529968 edges, 194469 markings/sec, 115 secs
lola: 30109491 markings, 45313211 edges, 104094 markings/sec, 120 secs
lola: 31202956 markings, 46958781 edges, 218693 markings/sec, 125 secs
lola: 31808906 markings, 47870779 edges, 121190 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E (((2 <= p417) U (1 <= p254)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((2 <= p417) U (1 <= p254)))
lola: processed formula length: 32
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1407569 markings, 2118233 edges, 281514 markings/sec, 0 secs
lola: 2756079 markings, 4147666 edges, 269702 markings/sec, 5 secs
lola: 4115752 markings, 6193947 edges, 271935 markings/sec, 10 secs
lola: 5478447 markings, 8244704 edges, 272539 markings/sec, 15 secs
lola: 6813156 markings, 10253375 edges, 266942 markings/sec, 20 secs
lola: 8118185 markings, 12217427 edges, 261006 markings/sec, 25 secs
lola: 9455781 markings, 14230374 edges, 267519 markings/sec, 30 secs
lola: 10813969 markings, 16274407 edges, 271638 markings/sec, 35 secs
lola: 12173791 markings, 18320870 edges, 271964 markings/sec, 40 secs
lola: 13515331 markings, 20339773 edges, 268308 markings/sec, 45 secs
lola: 14861472 markings, 22365715 edges, 269228 markings/sec, 50 secs
lola: 16204463 markings, 24386809 edges, 268598 markings/sec, 55 secs
lola: 17517476 markings, 26362883 edges, 262603 markings/sec, 60 secs
lola: 18854539 markings, 28375094 edges, 267413 markings/sec, 65 secs
lola: 20174070 markings, 30360819 edges, 263906 markings/sec, 70 secs
lola: 21495779 markings, 32350007 edges, 264342 markings/sec, 75 secs
lola: 22841829 markings, 34375733 edges, 269210 markings/sec, 80 secs
lola: 24158659 markings, 36357511 edges, 263366 markings/sec, 85 secs
lola: 25441665 markings, 38288397 edges, 256601 markings/sec, 90 secs
lola: 26576642 markings, 40000322 edges, 226995 markings/sec, 95 secs
lola: 27354074 markings, 41166599 edges, 155486 markings/sec, 100 secs
lola: 27988943 markings, 42122009 edges, 126974 markings/sec, 105 secs
lola: 29072098 markings, 43752017 edges, 216631 markings/sec, 110 secs
lola: 29884925 markings, 44975259 edges, 162565 markings/sec, 115 secs
lola: 29884925 markings, 44975259 edges, 0 markings/sec, 120 secs
lola: 30717442 markings, 46228113 edges, 166503 markings/sec, 125 secs
lola: 31816694 markings, 47882509 edges, 219850 markings/sec, 130 secs
lola: 32111831 markings, 48326655 edges, 59027 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p442 <= p466))) U ((p262 + 1 <= p104) AND (p496 <= p112) AND (p402 <= p362))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((p442 <= p466)) U ((p262 + 1 <= p104) AND (p496 <= p112) AND (p402 <= p362)))
lola: processed formula length: 82
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 883176 markings, 2212193 edges, 176635 markings/sec, 0 secs
lola: 1818808 markings, 4555937 edges, 187126 markings/sec, 5 secs
lola: 2741797 markings, 6867992 edges, 184598 markings/sec, 10 secs
lola: 3648255 markings, 9138592 edges, 181292 markings/sec, 15 secs
lola: 4561354 markings, 11425884 edges, 182620 markings/sec, 20 secs
lola: 5468772 markings, 13698906 edges, 181484 markings/sec, 25 secs
lola: 6385852 markings, 15996208 edges, 183416 markings/sec, 30 secs
lola: 7302733 markings, 18292902 edges, 183376 markings/sec, 35 secs
lola: 8219826 markings, 20590210 edges, 183419 markings/sec, 40 secs
lola: 9135453 markings, 22883781 edges, 183125 markings/sec, 45 secs
lola: 10057634 markings, 25193793 edges, 184436 markings/sec, 50 secs
lola: 10971045 markings, 27481839 edges, 182682 markings/sec, 55 secs
lola: 11886209 markings, 29774265 edges, 183033 markings/sec, 60 secs
lola: 12789492 markings, 32036956 edges, 180657 markings/sec, 65 secs
lola: 13701536 markings, 34321527 edges, 182409 markings/sec, 70 secs
lola: 14617539 markings, 36616099 edges, 183201 markings/sec, 75 secs
lola: 15512689 markings, 38858388 edges, 179030 markings/sec, 80 secs
lola: 16429106 markings, 41153998 edges, 183283 markings/sec, 85 secs
lola: 17340276 markings, 43436436 edges, 182234 markings/sec, 90 secs
lola: 18266951 markings, 45757733 edges, 185335 markings/sec, 95 secs
lola: 19180264 markings, 48045564 edges, 182663 markings/sec, 100 secs
lola: 20087831 markings, 50318900 edges, 181513 markings/sec, 105 secs
lola: 20995008 markings, 52591401 edges, 181435 markings/sec, 110 secs
lola: 21902843 markings, 54865441 edges, 181567 markings/sec, 115 secs
lola: 22818212 markings, 57158410 edges, 183074 markings/sec, 120 secs
lola: 23720779 markings, 59419311 edges, 180513 markings/sec, 125 secs
lola: 24628327 markings, 61692637 edges, 181510 markings/sec, 130 secs
lola: 25527045 markings, 63943904 edges, 179744 markings/sec, 135 secs
lola: 26401197 markings, 66133745 edges, 174830 markings/sec, 140 secs
lola: 27093543 markings, 67867977 edges, 138469 markings/sec, 145 secs
lola: 27649078 markings, 69259501 edges, 111107 markings/sec, 150 secs
lola: 28398415 markings, 71136539 edges, 149867 markings/sec, 155 secs
lola: 29153211 markings, 73027293 edges, 150959 markings/sec, 160 secs
lola: 29988247 markings, 75119006 edges, 167007 markings/sec, 165 secs
lola: 30825281 markings, 77215663 edges, 167407 markings/sec, 170 secs
lola: 31593021 markings, 79138867 edges, 153548 markings/sec, 175 secs
lola: 32364906 markings, 81072355 edges, 154377 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p255))) OR ((p121 + 1 <= p95) AND (p23 <= p184)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p121 + 1 <= p95) AND (p23 <= p184))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p121 + 1 <= p95) AND (p23 <= p184))
lola: processed formula length: 37
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p255)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p255)))
lola: processed formula length: 19
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p255)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-22-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-22-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 153 markings, 152 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no unknown unknown no yes yes no unknown yes unknown yes yes yes yes
lola:
preliminary result: yes unknown no unknown unknown no yes yes no unknown yes unknown yes yes yes yes
lola: memory consumption: 3836 KB
lola: time consumption: 1806 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-100101"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RefineWMG-PT-100101, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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