Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-050050-00
FORMULA_NAME RefineWMG-PT-050050-01
FORMULA_NAME RefineWMG-PT-050050-02
FORMULA_NAME RefineWMG-PT-050050-03
FORMULA_NAME RefineWMG-PT-050050-04
FORMULA_NAME RefineWMG-PT-050050-05
FORMULA_NAME RefineWMG-PT-050050-06
FORMULA_NAME RefineWMG-PT-050050-07
FORMULA_NAME RefineWMG-PT-050050-08
FORMULA_NAME RefineWMG-PT-050050-09
FORMULA_NAME RefineWMG-PT-050050-10
FORMULA_NAME RefineWMG-PT-050050-11
FORMULA_NAME RefineWMG-PT-050050-12
FORMULA_NAME RefineWMG-PT-050050-13
FORMULA_NAME RefineWMG-PT-050050-14
FORMULA_NAME RefineWMG-PT-050050-15

=== Now, execution of the tool begins

BK_START 1621429343218

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 13:02:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:02:26] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-19 13:02:26] [INFO ] Transformed 254 places.
[2021-05-19 13:02:26] [INFO ] Transformed 203 transitions.
[2021-05-19 13:02:26] [INFO ] Parsed PT model containing 254 places and 203 transitions in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100041 steps, including 0 resets, run finished after 327 ms. (steps per millisecond=305 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1]
// Phase 1: matrix 203 rows 254 cols
[2021-05-19 13:02:26] [INFO ] Computed 102 place invariants in 11 ms
[2021-05-19 13:02:26] [INFO ] [Real]Absence check using 102 positive place invariants in 63 ms returned sat
[2021-05-19 13:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:26] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2021-05-19 13:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 42 ms returned sat
[2021-05-19 13:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:27] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2021-05-19 13:02:27] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2021-05-19 13:02:27] [INFO ] Added : 106 causal constraints over 22 iterations in 340 ms. Result :sat
[2021-05-19 13:02:27] [INFO ] [Real]Absence check using 102 positive place invariants in 37 ms returned sat
[2021-05-19 13:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:27] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-19 13:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:28] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-19 13:02:28] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2021-05-19 13:02:28] [INFO ] Added : 99 causal constraints over 20 iterations in 245 ms. Result :sat
[2021-05-19 13:02:28] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:28] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-19 13:02:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:28] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2021-05-19 13:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:28] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-19 13:02:28] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2021-05-19 13:02:29] [INFO ] Added : 96 causal constraints over 20 iterations in 228 ms. Result :sat
[2021-05-19 13:02:29] [INFO ] [Real]Absence check using 102 positive place invariants in 34 ms returned sat
[2021-05-19 13:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:29] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-19 13:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:29] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:30] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2021-05-19 13:02:30] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2021-05-19 13:02:30] [INFO ] Added : 102 causal constraints over 21 iterations in 300 ms. Result :sat
[2021-05-19 13:02:30] [INFO ] [Real]Absence check using 102 positive place invariants in 37 ms returned sat
[2021-05-19 13:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:30] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-19 13:02:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:31] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-19 13:02:31] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2021-05-19 13:02:31] [INFO ] Added : 116 causal constraints over 24 iterations in 310 ms. Result :sat
[2021-05-19 13:02:31] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-19 13:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:31] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-19 13:02:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:31] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:32] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-19 13:02:32] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2021-05-19 13:02:32] [INFO ] Added : 107 causal constraints over 22 iterations in 290 ms. Result :sat
[2021-05-19 13:02:32] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-19 13:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:32] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-19 13:02:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2021-05-19 13:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:32] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-19 13:02:32] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2021-05-19 13:02:33] [INFO ] Added : 107 causal constraints over 22 iterations in 272 ms. Result :sat
[2021-05-19 13:02:33] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:33] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-19 13:02:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 41 ms returned sat
[2021-05-19 13:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:33] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-19 13:02:33] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:02:33] [INFO ] Added : 91 causal constraints over 19 iterations in 222 ms. Result :sat
[2021-05-19 13:02:33] [INFO ] [Real]Absence check using 102 positive place invariants in 2 ms returned unsat
[2021-05-19 13:02:33] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2021-05-19 13:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:34] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-19 13:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:34] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-19 13:02:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:02:34] [INFO ] Added : 38 causal constraints over 8 iterations in 98 ms. Result :sat
[2021-05-19 13:02:34] [INFO ] [Real]Absence check using 102 positive place invariants in 29 ms returned sat
[2021-05-19 13:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:34] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-19 13:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2021-05-19 13:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:35] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2021-05-19 13:02:35] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:02:35] [INFO ] Added : 121 causal constraints over 25 iterations in 291 ms. Result :sat
[2021-05-19 13:02:35] [INFO ] [Real]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:35] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2021-05-19 13:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2021-05-19 13:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:36] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-19 13:02:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:02:36] [INFO ] Added : 117 causal constraints over 24 iterations in 234 ms. Result :sat
[2021-05-19 13:02:36] [INFO ] [Real]Absence check using 102 positive place invariants in 41 ms returned sat
[2021-05-19 13:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:36] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-19 13:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:36] [INFO ] [Nat]Absence check using 102 positive place invariants in 33 ms returned sat
[2021-05-19 13:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:36] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-19 13:02:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2021-05-19 13:02:36] [INFO ] Added : 45 causal constraints over 9 iterations in 142 ms. Result :sat
[2021-05-19 13:02:36] [INFO ] [Real]Absence check using 102 positive place invariants in 4 ms returned unsat
[2021-05-19 13:02:36] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-19 13:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:37] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-19 13:02:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2021-05-19 13:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:37] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-19 13:02:37] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:02:37] [INFO ] Added : 69 causal constraints over 14 iterations in 136 ms. Result :sat
[2021-05-19 13:02:37] [INFO ] [Real]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:37] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2021-05-19 13:02:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 39 ms returned sat
[2021-05-19 13:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:38] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2021-05-19 13:02:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2021-05-19 13:02:38] [INFO ] Added : 100 causal constraints over 20 iterations in 235 ms. Result :sat
[2021-05-19 13:02:38] [INFO ] [Real]Absence check using 102 positive place invariants in 44 ms returned sat
[2021-05-19 13:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:38] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-19 13:02:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:02:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 44 ms returned sat
[2021-05-19 13:02:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:02:38] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-19 13:02:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:02:39] [INFO ] Added : 100 causal constraints over 20 iterations in 231 ms. Result :sat
[2021-05-19 13:02:39] [INFO ] [Real]Absence check using 102 positive place invariants in 3 ms returned unsat
[2021-05-19 13:02:39] [INFO ] [Real]Absence check using 102 positive place invariants in 5 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-19 13:02:39] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 13:02:39] [INFO ] Flatten gal took : 49 ms
FORMULA RefineWMG-PT-050050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:02:39] [INFO ] Flatten gal took : 17 ms
[2021-05-19 13:02:39] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 13:02:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-050050 @ 3570 seconds

FORMULA RefineWMG-PT-050050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-050050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-050050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-050050-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-050050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2975
rslt: Output for LTLCardinality @ RefineWMG-PT-050050

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:02:39 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p156 <= p72))",
"processed_size": 17,
"rewrites": 73
},
"result":
{
"edges": 1506,
"markings": 1082,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "(p11 <= p155)",
"processed_size": 13,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p156 <= p72))",
"processed_size": 17,
"rewrites": 73
},
"result":
{
"edges": 1506,
"markings": 1082,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((G ((p138 + 1 <= p67)) OR G ((p17 <= 2)))))",
"processed_size": 49,
"rewrites": 73
},
"result":
{
"edges": 8395,
"markings": 3241,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((p139 + 1 <= p221)) AND (p71 <= 1))))",
"processed_size": 47,
"rewrites": 73
},
"result":
{
"edges": 3265874,
"markings": 2154451,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((F ((p83 + 1 <= p212)) AND ((1 <= p127) OR (p83 + 1 <= p212)))) AND (1 <= p203)))",
"processed_size": 88,
"rewrites": 73
},
"result":
{
"edges": 1098,
"markings": 650,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p56 + 1 <= p154) U (G ((p234 <= 1)) AND (p179 <= p156)))",
"processed_size": 58,
"rewrites": 73
},
"result":
{
"edges": 119,
"markings": 93,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1634
},
"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": "(p216 + 1 <= p10)",
"processed_size": 17,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3268
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p97) OR (p174 <= p111))",
"processed_size": 31,
"rewrites": 75
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3268
},
"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": "(p192 <= p111)",
"processed_size": 14,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((G ((1 <= p127)) OR (1 <= p127))) U (p247 + 1 <= p133))",
"processed_size": 59,
"rewrites": 73
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3612,
"runtime": 595.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((G(*) OR G(*)))) : G(F((G(*) AND **))) : (G(**) AND ((F((X(*) AND *)) OR G(**)) AND F(*))) : F((G((F(**) AND (** OR **))) AND **)) : (F(*) OR (G(*) AND **)) : X(G((X(G(*)) OR *))) : F((F(**) AND **)) : G((F(**) OR **)) : X((F(*) AND F(**))) : (** U (G(**) AND **)) : ((F((G(**) OR **)) U **) AND **) : X(X(G((X(G(*)) OR **))))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "no no no no no unknown no no no no no unknown ",
"value": "no no no no no unknown no no no no no unknown "
},
"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: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: F (NOT(X (F (X ((F ((p67 <= p138)) AND F ((3 <= p17)))))))) : G (NOT(X (NOT(F ((NOT(F ((p221 <= p139))) AND (p71 <= 1))))))) : (NOT((G ((X ((p29 <= p92)) OR (p11 <= p155))) U NOT(G ((p156 <= p72))))) AND NOT(G ((p11 <= p155)))) : F ((G (((1 <= p127) U (p83 + 1 <= p212))) AND (1 <= p203))) : (NOT(G (((1 <= p97) OR (p174 <= p111)))) OR (NOT(F ((p10 <= p216))) AND (p216 + 1 <= p10))) : G (NOT(X ((X (((p223 <= p40) U F ((p131 <= p153)))) AND (p157 <= 0))))) : F ((F (((2 <= p204) AND (p189 <= p114))) AND (2 <= p204))) : G ((F ((3 <= p238)) OR (1 <= p20))) : ((X (X (((2 <= p32) U (p237 <= p188)))) U F (X (NOT(G ((2 <= p32)))))) AND F (X ((p219 <= p14)))) : ((p56 + 1 <= p154) U (G ((p234 <= 1)) AND (p179 <= p156))) : ((F ((G ((1 <= p127)) OR (1 <= p127))) U (p247 + 1 <= p133)) AND (p192 <= p111)) : G (X (X ((G (NOT(X ((3 <= p196)))) OR (2 <= p141)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p156 <= p72)) AND ((F ((X ((p92 + 1 <= p29)) AND (p155 + 1 <= p11))) OR G ((p156 <= p72))) AND F ((p155 + 1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p156 <= p72))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p156 <= p72))
lola: processed formula length: 17
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1082 markings, 1506 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p155 + 1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p11 <= p155)
lola: processed formula length: 13
lola: 75 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p156 <= p72))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p156 <= p72))
lola: processed formula length: 17
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1082 markings, 1506 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((p153 + 1 <= p131))) OR (1 <= p157))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((p153 + 1 <= p131))) OR (1 <= p157))))
lola: processed formula length: 51
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2072761 markings, 3129818 edges, 414552 markings/sec, 0 secs
lola: 4209898 markings, 6356882 edges, 427427 markings/sec, 5 secs
lola: 6120350 markings, 9241655 edges, 382090 markings/sec, 10 secs
lola: 8017891 markings, 12106954 edges, 379508 markings/sec, 15 secs
lola: 9946004 markings, 15018414 edges, 385623 markings/sec, 20 secs
lola: 11855172 markings, 17901283 edges, 381834 markings/sec, 25 secs
lola: 13970109 markings, 21094812 edges, 422987 markings/sec, 30 secs
lola: 15910127 markings, 24024236 edges, 388004 markings/sec, 35 secs
lola: 17904556 markings, 27035822 edges, 398886 markings/sec, 40 secs
lola: 20000759 markings, 30201089 edges, 419241 markings/sec, 45 secs
lola: 22145229 markings, 33439251 edges, 428894 markings/sec, 50 secs
lola: 24260373 markings, 36633099 edges, 423029 markings/sec, 55 secs
lola: 26353113 markings, 39793167 edges, 418548 markings/sec, 60 secs
lola: 28511648 markings, 43052548 edges, 431707 markings/sec, 65 secs
lola: 30633985 markings, 46257261 edges, 424467 markings/sec, 70 secs
lola: 32532789 markings, 49124456 edges, 379761 markings/sec, 75 secs
lola: 34475616 markings, 52058119 edges, 388565 markings/sec, 80 secs
lola: 36503792 markings, 55120656 edges, 405635 markings/sec, 85 secs
lola: 38608021 markings, 58298064 edges, 420846 markings/sec, 90 secs
lola: 40675553 markings, 61420050 edges, 413506 markings/sec, 95 secs
lola: 42607009 markings, 64337038 edges, 386291 markings/sec, 100 secs
lola: 44104163 markings, 66597369 edges, 299431 markings/sec, 105 secs
lola: 45419396 markings, 68583240 edges, 263047 markings/sec, 110 secs
lola: 46782762 markings, 70641890 edges, 272673 markings/sec, 115 secs
lola: 48064964 markings, 72578038 edges, 256440 markings/sec, 120 secs
lola: 49446605 markings, 74664297 edges, 276328 markings/sec, 125 secs
lola: 50910639 markings, 76875024 edges, 292807 markings/sec, 130 secs
lola: 52545477 markings, 79343641 edges, 326968 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p32 <= 1)) AND F ((p219 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p32 <= 1)) AND F ((p219 <= p14))))
lola: processed formula length: 42
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (G ((p196 <= 2))) OR (2 <= p141)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (G ((p196 <= 2))) OR (2 <= p141)))))
lola: processed formula length: 48
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2073762 markings, 3131343 edges, 414752 markings/sec, 0 secs
lola: 4301408 markings, 6495075 edges, 445529 markings/sec, 5 secs
lola: 6542298 markings, 9878804 edges, 448178 markings/sec, 10 secs
lola: 8746803 markings, 13207629 edges, 440901 markings/sec, 15 secs
lola: 10906757 markings, 16469166 edges, 431991 markings/sec, 20 secs
lola: 13042526 markings, 19694187 edges, 427154 markings/sec, 25 secs
lola: 15239694 markings, 23011873 edges, 439434 markings/sec, 30 secs
lola: 17429010 markings, 26317732 edges, 437863 markings/sec, 35 secs
lola: 19624798 markings, 29633394 edges, 439158 markings/sec, 40 secs
lola: 21770417 markings, 32873281 edges, 429124 markings/sec, 45 secs
lola: 23800295 markings, 35938393 edges, 405976 markings/sec, 50 secs
lola: 25795343 markings, 38950910 edges, 399010 markings/sec, 55 secs
lola: 27751475 markings, 41904675 edges, 391226 markings/sec, 60 secs
lola: 29785250 markings, 44975674 edges, 406755 markings/sec, 65 secs
lola: 31893546 markings, 48159212 edges, 421659 markings/sec, 70 secs
lola: 34097741 markings, 51487502 edges, 440839 markings/sec, 75 secs
lola: 36291764 markings, 54800489 edges, 438805 markings/sec, 80 secs
lola: 38440208 markings, 58044660 edges, 429689 markings/sec, 85 secs
lola: 40581032 markings, 61277336 edges, 428165 markings/sec, 90 secs
lola: 42679197 markings, 64446470 edges, 419633 markings/sec, 95 secs
lola: 43643553 markings, 65902871 edges, 192871 markings/sec, 100 secs
lola: 45144440 markings, 68170483 edges, 300177 markings/sec, 105 secs
lola: 46418211 markings, 70092569 edges, 254754 markings/sec, 110 secs
lola: 47672570 markings, 71985515 edges, 250872 markings/sec, 115 secs
lola: 49107139 markings, 74151726 edges, 286914 markings/sec, 120 secs
lola: 50442389 markings, 76167964 edges, 267050 markings/sec, 125 secs
lola: 52043386 markings, 78585454 edges, 320199 markings/sec, 130 secs
lola: 53165406 markings, 80279701 edges, 224404 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((3 <= p238)) OR (1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((3 <= p238)) OR (1 <= p20)))
lola: processed formula length: 35
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((p138 + 1 <= p67)) OR G ((p17 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((p138 + 1 <= p67)) OR G ((p17 <= 2)))))
lola: processed formula length: 49
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3241 markings, 8395 edges
lola: ========================================
lola: subprocess 6 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p139 + 1 <= p221)) AND (p71 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p139 + 1 <= p221)) AND (p71 <= 1))))
lola: processed formula length: 47
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1588988 markings, 2406226 edges, 317798 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2154451 markings, 3265874 edges
lola: ========================================
lola: subprocess 7 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((2 <= p204) AND (p189 <= p114))) AND (2 <= p204)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((2 <= p204) AND (p189 <= p114))) AND (2 <= p204)))
lola: processed formula length: 58
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: subprocess 8 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((p83 + 1 <= p212)) AND ((1 <= p127) OR (p83 + 1 <= p212)))) AND (1 <= p203)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((p83 + 1 <= p212)) AND ((1 <= p127) OR (p83 + 1 <= p212)))) AND (1 <= p203)))
lola: processed formula length: 88
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 650 markings, 1098 edges
lola: ========================================
lola: subprocess 9 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p56 + 1 <= p154) U (G ((p234 <= 1)) AND (p179 <= p156)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p56 + 1 <= p154) U (G ((p234 <= 1)) AND (p179 <= p156)))
lola: processed formula length: 58
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 93 markings, 119 edges
lola: ========================================
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p97 <= 0) AND (p111 + 1 <= p174))) OR (G ((p216 + 1 <= p10)) AND (p216 + 1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p216 + 1 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p216 + 1 <= p10)
lola: processed formula length: 17
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p97 <= 0) AND (p111 + 1 <= p174)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p97) OR (p174 <= p111))
lola: processed formula length: 31
lola: 75 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((G ((1 <= p127)) OR (1 <= p127))) U (p247 + 1 <= p133)) AND (p192 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p192 <= p111)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p192 <= p111)
lola: processed formula length: 14
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((p153 + 1 <= p131))) OR (1 <= p157))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((p153 + 1 <= p131))) OR (1 <= p157))))
lola: processed formula length: 51
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2201068 markings, 3323577 edges, 440214 markings/sec, 0 secs
lola: 4425105 markings, 6681836 edges, 444807 markings/sec, 5 secs
lola: 6656197 markings, 10050794 edges, 446218 markings/sec, 10 secs
lola: 8855937 markings, 13372400 edges, 439948 markings/sec, 15 secs
lola: 11018203 markings, 16637428 edges, 432453 markings/sec, 20 secs
lola: 13151557 markings, 19858810 edges, 426671 markings/sec, 25 secs
lola: 15352414 markings, 23182108 edges, 440171 markings/sec, 30 secs
lola: 17536714 markings, 26480388 edges, 436860 markings/sec, 35 secs
lola: 19730774 markings, 29793418 edges, 438812 markings/sec, 40 secs
lola: 21933771 markings, 33119931 edges, 440599 markings/sec, 45 secs
lola: 24094865 markings, 36383205 edges, 432219 markings/sec, 50 secs
lola: 26234633 markings, 39614259 edges, 427954 markings/sec, 55 secs
lola: 28283076 markings, 42707411 edges, 409689 markings/sec, 60 secs
lola: 30469683 markings, 46009163 edges, 437321 markings/sec, 65 secs
lola: 32659295 markings, 49315487 edges, 437922 markings/sec, 70 secs
lola: 34876083 markings, 52662799 edges, 443358 markings/sec, 75 secs
lola: 37053677 markings, 55950997 edges, 435519 markings/sec, 80 secs
lola: 39205796 markings, 59200690 edges, 430424 markings/sec, 85 secs
lola: 41374237 markings, 62475052 edges, 433688 markings/sec, 90 secs
lola: 43408511 markings, 65547124 edges, 406855 markings/sec, 95 secs
lola: 44641241 markings, 67408716 edges, 246546 markings/sec, 100 secs
lola: 45716209 markings, 69032134 edges, 214994 markings/sec, 105 secs
lola: 47320512 markings, 71453887 edges, 320861 markings/sec, 110 secs
lola: 48712602 markings, 73555953 edges, 278418 markings/sec, 115 secs
lola: 49457942 markings, 74681411 edges, 149068 markings/sec, 120 secs
lola: 50642280 markings, 76469810 edges, 236868 markings/sec, 125 secs
lola: 51889296 markings, 78352773 edges, 249403 markings/sec, 130 secs
lola: 53131333 markings, 80228249 edges, 248407 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (G ((p196 <= 2))) OR (2 <= p141)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (G ((p196 <= 2))) OR (2 <= p141)))))
lola: processed formula length: 48
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2055767 markings, 3104156 edges, 411153 markings/sec, 0 secs
lola: 4249517 markings, 6416744 edges, 438750 markings/sec, 5 secs
lola: 6416713 markings, 9689173 edges, 433439 markings/sec, 10 secs
lola: 8434266 markings, 12735685 edges, 403511 markings/sec, 15 secs
lola: 10497990 markings, 15851903 edges, 412745 markings/sec, 20 secs
lola: 12608461 markings, 19038715 edges, 422094 markings/sec, 25 secs
lola: 14784911 markings, 22325182 edges, 435290 markings/sec, 30 secs
lola: 16839191 markings, 25427131 edges, 410856 markings/sec, 35 secs
lola: 19017848 markings, 28716879 edges, 435731 markings/sec, 40 secs
lola: 21197117 markings, 32007599 edges, 435854 markings/sec, 45 secs
lola: 23348859 markings, 35256719 edges, 430348 markings/sec, 50 secs
lola: 25480452 markings, 38475443 edges, 426319 markings/sec, 55 secs
lola: 27356613 markings, 41308465 edges, 375232 markings/sec, 60 secs
lola: 29204891 markings, 44099338 edges, 369656 markings/sec, 65 secs
lola: 31369694 markings, 47368190 edges, 432961 markings/sec, 70 secs
lola: 33560023 markings, 50675555 edges, 438066 markings/sec, 75 secs
lola: 35762624 markings, 54001515 edges, 440520 markings/sec, 80 secs
lola: 37919303 markings, 57258103 edges, 431336 markings/sec, 85 secs
lola: 40055711 markings, 60484111 edges, 427282 markings/sec, 90 secs
lola: 42244992 markings, 63789891 edges, 437856 markings/sec, 95 secs
lola: 43793158 markings, 66128672 edges, 309633 markings/sec, 100 secs
lola: 44685099 markings, 67475411 edges, 178388 markings/sec, 105 secs
lola: 46182526 markings, 69736421 edges, 299485 markings/sec, 110 secs
lola: 47563596 markings, 71822138 edges, 276214 markings/sec, 115 secs
lola: 48809846 markings, 73702830 edges, 249250 markings/sec, 120 secs
lola: 49965076 markings, 75447208 edges, 231046 markings/sec, 125 secs
lola: 51229849 markings, 77357025 edges, 252955 markings/sec, 130 secs
lola: 52273344 markings, 78932707 edges, 208699 markings/sec, 135 secs
lola: 52904713 markings, 79886065 edges, 126274 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((F ((G ((1 <= p127)) OR (1 <= p127))) U (p247 + 1 <= p133)) AND (p192 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p192 <= p111)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p192 <= p111)
lola: processed formula length: 14
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((G ((1 <= p127)) OR (1 <= p127))) U (p247 + 1 <= p133))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((G ((1 <= p127)) OR (1 <= p127))) U (p247 + 1 <= p133))
lola: processed formula length: 59
lola: 73 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no no no no unknown
lola:
preliminary result: no no no no no unknown no no no no no unknown
lola: ========================================
lola: memory consumption: 3612 KB
lola: time consumption: 595 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-050050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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