About the Execution of 2020-gold for RefineWMG-PT-050051
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16256.735 | 3600000.00 | 1273950.00 | 77184.70 | T?T?F?TTFFF?FTFT | normal |
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-162089432900341.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-050051, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900341
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.5K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-050051-00
FORMULA_NAME RefineWMG-PT-050051-01
FORMULA_NAME RefineWMG-PT-050051-02
FORMULA_NAME RefineWMG-PT-050051-03
FORMULA_NAME RefineWMG-PT-050051-04
FORMULA_NAME RefineWMG-PT-050051-05
FORMULA_NAME RefineWMG-PT-050051-06
FORMULA_NAME RefineWMG-PT-050051-07
FORMULA_NAME RefineWMG-PT-050051-08
FORMULA_NAME RefineWMG-PT-050051-09
FORMULA_NAME RefineWMG-PT-050051-10
FORMULA_NAME RefineWMG-PT-050051-11
FORMULA_NAME RefineWMG-PT-050051-12
FORMULA_NAME RefineWMG-PT-050051-13
FORMULA_NAME RefineWMG-PT-050051-14
FORMULA_NAME RefineWMG-PT-050051-15
=== Now, execution of the tool begins
BK_START 1621429388757
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:03:10] [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:03:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:03:10] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-19 13:03:10] [INFO ] Transformed 254 places.
[2021-05-19 13:03:10] [INFO ] Transformed 203 transitions.
[2021-05-19 13:03:10] [INFO ] Parsed PT model containing 254 places and 203 transitions in 86 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 100037 steps, including 0 resets, run finished after 217 ms. (steps per millisecond=461 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
// Phase 1: matrix 203 rows 254 cols
[2021-05-19 13:03:10] [INFO ] Computed 102 place invariants in 7 ms
[2021-05-19 13:03:10] [INFO ] [Real]Absence check using 102 positive place invariants in 44 ms returned sat
[2021-05-19 13:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:11] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-19 13:03:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:11] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-19 13:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:11] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-19 13:03:11] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 22 ms.
[2021-05-19 13:03:11] [INFO ] Added : 75 causal constraints over 15 iterations in 230 ms. Result :sat
[2021-05-19 13:03:11] [INFO ] [Real]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:11] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-19 13:03:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:11] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-19 13:03:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:12] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2021-05-19 13:03:12] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2021-05-19 13:03:12] [INFO ] Added : 86 causal constraints over 18 iterations in 222 ms. Result :sat
[2021-05-19 13:03:12] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-19 13:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:12] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-19 13:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-19 13:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:12] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-19 13:03:12] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2021-05-19 13:03:12] [INFO ] Added : 106 causal constraints over 22 iterations in 245 ms. Result :sat
[2021-05-19 13:03:12] [INFO ] [Real]Absence check using 102 positive place invariants in 27 ms returned sat
[2021-05-19 13:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:13] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-19 13:03:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:13] [INFO ] [Nat]Absence check using 102 positive place invariants in 31 ms returned sat
[2021-05-19 13:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:13] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-19 13:03:13] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:03:13] [INFO ] Added : 96 causal constraints over 20 iterations in 194 ms. Result :sat
[2021-05-19 13:03:13] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2021-05-19 13:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:13] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-19 13:03:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:13] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2021-05-19 13:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:13] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-19 13:03:13] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:03:14] [INFO ] Added : 99 causal constraints over 20 iterations in 194 ms. Result :sat
[2021-05-19 13:03:14] [INFO ] [Real]Absence check using 102 positive place invariants in 42 ms returned sat
[2021-05-19 13:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:14] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-19 13:03:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:14] [INFO ] [Nat]Absence check using 102 positive place invariants in 28 ms returned sat
[2021-05-19 13:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:14] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-19 13:03:14] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2021-05-19 13:03:14] [INFO ] Added : 100 causal constraints over 20 iterations in 309 ms. Result :sat
[2021-05-19 13:03:15] [INFO ] [Real]Absence check using 102 positive place invariants in 33 ms returned sat
[2021-05-19 13:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:15] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-19 13:03:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:15] [INFO ] [Nat]Absence check using 102 positive place invariants in 29 ms returned sat
[2021-05-19 13:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:15] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-19 13:03:15] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2021-05-19 13:03:15] [INFO ] Added : 100 causal constraints over 20 iterations in 259 ms. Result :sat
[2021-05-19 13:03:15] [INFO ] [Real]Absence check using 102 positive place invariants in 5 ms returned unsat
[2021-05-19 13:03:15] [INFO ] [Real]Absence check using 102 positive place invariants in 39 ms returned sat
[2021-05-19 13:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:16] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-19 13:03:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:16] [INFO ] [Nat]Absence check using 102 positive place invariants in 26 ms returned sat
[2021-05-19 13:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:16] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-19 13:03:16] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2021-05-19 13:03:16] [INFO ] Added : 116 causal constraints over 24 iterations in 333 ms. Result :sat
[2021-05-19 13:03:16] [INFO ] [Real]Absence check using 102 positive place invariants in 4 ms returned unsat
[2021-05-19 13:03:16] [INFO ] [Real]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:16] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-19 13:03:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:16] [INFO ] [Nat]Absence check using 102 positive place invariants in 32 ms returned sat
[2021-05-19 13:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:17] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-19 13:03:17] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2021-05-19 13:03:17] [INFO ] Added : 75 causal constraints over 15 iterations in 148 ms. Result :sat
[2021-05-19 13:03:17] [INFO ] [Real]Absence check using 102 positive place invariants in 33 ms returned sat
[2021-05-19 13:03:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:17] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-19 13:03:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:17] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2021-05-19 13:03:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:17] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-19 13:03:17] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:03:17] [INFO ] Added : 38 causal constraints over 8 iterations in 98 ms. Result :sat
[2021-05-19 13:03:17] [INFO ] [Real]Absence check using 102 positive place invariants in 40 ms returned sat
[2021-05-19 13:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:18] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-19 13:03:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:18] [INFO ] [Nat]Absence check using 102 positive place invariants in 43 ms returned sat
[2021-05-19 13:03:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:18] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2021-05-19 13:03:18] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 15 ms.
[2021-05-19 13:03:18] [INFO ] Added : 98 causal constraints over 20 iterations in 295 ms. Result :sat
[2021-05-19 13:03:18] [INFO ] [Real]Absence check using 102 positive place invariants in 46 ms returned sat
[2021-05-19 13:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:19] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-19 13:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 35 ms returned sat
[2021-05-19 13:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:19] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-19 13:03:19] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 13 ms.
[2021-05-19 13:03:19] [INFO ] Added : 117 causal constraints over 24 iterations in 309 ms. Result :sat
[2021-05-19 13:03:19] [INFO ] [Real]Absence check using 102 positive place invariants in 44 ms returned sat
[2021-05-19 13:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:19] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2021-05-19 13:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 36 ms returned sat
[2021-05-19 13:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:20] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-19 13:03:20] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2021-05-19 13:03:20] [INFO ] Added : 74 causal constraints over 15 iterations in 187 ms. Result :sat
[2021-05-19 13:03:20] [INFO ] [Real]Absence check using 102 positive place invariants in 30 ms returned sat
[2021-05-19 13:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:20] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2021-05-19 13:03:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:03:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 64 ms returned sat
[2021-05-19 13:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:03:21] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2021-05-19 13:03:21] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2021-05-19 13:03:21] [INFO ] Added : 94 causal constraints over 19 iterations in 217 ms. Result :sat
[2021-05-19 13:03:21] [INFO ] [Real]Absence check using 102 positive place invariants in 3 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-19 13:03:21] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-19 13:03:21] [INFO ] Flatten gal took : 64 ms
FORMULA RefineWMG-PT-050051-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:03:21] [INFO ] Flatten gal took : 22 ms
[2021-05-19 13:03:21] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 13:03:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-050051 @ 3570 seconds
FORMULA RefineWMG-PT-050051-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RefineWMG-PT-050051-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2365
rslt: Output for LTLCardinality @ RefineWMG-PT-050051
{
"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:03:22 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"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": "(p189 <= p114)",
"processed_size": 14,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p200 <= p174))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(1 <= p154)",
"processed_size": 11,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p59 <= 2)",
"processed_size": 10,
"rewrites": 39
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"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": "((p42 <= p217) U X (X (X ((3 <= p4)))))",
"processed_size": 39,
"rewrites": 37
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 741
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 741
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p204 <= 2))",
"processed_size": 13,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 988
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"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": "((p133 <= p247) U X (F ((3 <= p204))))",
"processed_size": 38,
"rewrites": 37
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 988
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (G (((p102 + 1 <= p69) AND (2 <= p141)))) OR ((p208 <= p127) AND (3 <= p196))))",
"processed_size": 85,
"rewrites": 37
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 1482
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p41 + 1 <= p207)))",
"processed_size": 25,
"rewrites": 37
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2965
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p156 + 1 <= p179)))",
"processed_size": 26,
"rewrites": 37
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3352,
"runtime": 1205.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(((F(**) U X(X(F(*)))) OR X(**)))) : G(F((X(X(**)) OR G(**)))) : G(((X(X(*)) AND (F(*) OR X(X(G(*))))) OR **)) : (F((X(F(**)) OR **)) OR (X(**) AND **)) : (X(G(*)) AND (F(**) OR **)) : (** U X(X(X(**)))) : F(G(*)) : X((X(G(**)) AND G(**))) : ((** U X(F(**))) AND **) : X((X(G(**)) OR **)) : (F(G(*)) AND X(F(**)))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"preliminary_value": "unknown unknown unknown yes no no no unknown no yes no ",
"value": "unknown unknown unknown yes no no no unknown no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: G (F (G (((F ((p221 <= p139)) U X (F (NOT(X (G ((p220 <= p122))))))) OR X ((p43 <= p169)))))) : G (F ((X ((2 <= p23)) U ((p212 <= p83) U (X (X ((p212 <= p83))) OR G ((2 <= p171))))))) : G ((NOT((G ((p223 <= p40)) U X (X (((p223 <= p40) OR (p146 <= p232)))))) OR (p153 + 1 <= p131))) : (F ((F (X (F ((p200 <= p174)))) OR (p114 + 1 <= p189))) OR (X ((p200 <= p174)) AND (p189 <= p114))) : (NOT(F (X ((3 <= p208)))) AND (F ((3 <= p59)) OR (1 <= p154))) : ((p42 <= p217) U X (X (X ((3 <= p4))))) : F ((F ((p179 <= p156)) U NOT(F ((p179 <= p156))))) : X ((X (G (((p137 <= p123)))) AND G ((p128 <= p207)))) : (((p133 <= p247) U X (F ((3 <= p204)))) AND ((p204 <= 2))) : X ((G (X (((p102 + 1 <= p69) AND (2 <= p141)))) OR ((p208 <= p127) AND (3 <= p196)))) : (F (NOT(F ((p207 <= p41)))) AND X (F ((NOT(X ((p207 <= p41))) U (p217 <= p231)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((F ((p221 <= p139)) U X (X (F ((p122 + 1 <= p220))))) OR X ((p43 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((F ((p221 <= p139)) U X (X (F ((p122 + 1 <= p220))))) OR X ((p43 <= p169)))))
lola: processed formula length: 84
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 2330255 markings, 2932104 edges, 466051 markings/sec, 0 secs
lola: 4705072 markings, 5920326 edges, 474963 markings/sec, 5 secs
lola: 7248735 markings, 9121020 edges, 508733 markings/sec, 10 secs
lola: 9793434 markings, 12323007 edges, 508940 markings/sec, 15 secs
lola: 12339078 markings, 15526200 edges, 509129 markings/sec, 20 secs
lola: 14850433 markings, 18686232 edges, 502271 markings/sec, 25 secs
lola: 17124892 markings, 21548160 edges, 454892 markings/sec, 30 secs
lola: 19260769 markings, 24235771 edges, 427175 markings/sec, 35 secs
lola: 21368167 markings, 26887496 edges, 421480 markings/sec, 40 secs
lola: 23542692 markings, 29623702 edges, 434905 markings/sec, 45 secs
lola: 25810142 markings, 32476850 edges, 453490 markings/sec, 50 secs
lola: 27980857 markings, 35208253 edges, 434143 markings/sec, 55 secs
lola: 30078521 markings, 37847781 edges, 419533 markings/sec, 60 secs
lola: 32233248 markings, 40559091 edges, 430945 markings/sec, 65 secs
lola: 34423209 markings, 43314661 edges, 437992 markings/sec, 70 secs
lola: 36727383 markings, 46214013 edges, 460835 markings/sec, 75 secs
lola: 38933564 markings, 48990041 edges, 441236 markings/sec, 80 secs
lola: 41144786 markings, 51772427 edges, 442244 markings/sec, 85 secs
lola: 43480836 markings, 54711877 edges, 467210 markings/sec, 90 secs
lola: 45893179 markings, 57748102 edges, 482469 markings/sec, 95 secs
lola: 47530969 markings, 59809343 edges, 327558 markings/sec, 100 secs
lola: 48927586 markings, 61566560 edges, 279323 markings/sec, 105 secs
lola: 50608138 markings, 63680133 edges, 336110 markings/sec, 110 secs
lola: 52078703 markings, 65530578 edges, 294113 markings/sec, 115 secs
lola: 53429274 markings, 67230000 edges, 270114 markings/sec, 120 secs
lola: 54735928 markings, 68874209 edges, 261331 markings/sec, 125 secs
lola: 55960112 markings, 70414596 edges, 244837 markings/sec, 130 secs
lola: 56826021 markings, 71504126 edges, 173182 markings/sec, 135 secs
lola: 57003371 markings, 71727306 edges, 35470 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X ((p212 <= p83))) OR G ((2 <= p171)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X ((p212 <= p83))) OR G ((2 <= p171)))))
lola: processed formula length: 50
lola: 37 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: 1997534 markings, 3015850 edges, 399507 markings/sec, 0 secs
lola: 3913999 markings, 5909317 edges, 383293 markings/sec, 5 secs
lola: 5852022 markings, 8835345 edges, 387605 markings/sec, 10 secs
lola: 7800680 markings, 11777410 edges, 389732 markings/sec, 15 secs
lola: 9726825 markings, 14685529 edges, 385229 markings/sec, 20 secs
lola: 11800962 markings, 17817107 edges, 414827 markings/sec, 25 secs
lola: 14056937 markings, 21223190 edges, 451195 markings/sec, 30 secs
lola: 16195960 markings, 24452665 edges, 427805 markings/sec, 35 secs
lola: 18331753 markings, 27677307 edges, 427159 markings/sec, 40 secs
lola: 20464613 markings, 30897505 edges, 426572 markings/sec, 45 secs
lola: 22619990 markings, 34151679 edges, 431075 markings/sec, 50 secs
lola: 24728929 markings, 37335785 edges, 421788 markings/sec, 55 secs
lola: 26814010 markings, 40483856 edges, 417016 markings/sec, 60 secs
lola: 28877367 markings, 43599127 edges, 412671 markings/sec, 65 secs
lola: 31017027 markings, 46829564 edges, 427932 markings/sec, 70 secs
lola: 33202913 markings, 50129834 edges, 437177 markings/sec, 75 secs
lola: 35387916 markings, 53428739 edges, 437001 markings/sec, 80 secs
lola: 37582478 markings, 56742105 edges, 438912 markings/sec, 85 secs
lola: 39733528 markings, 59989786 edges, 430210 markings/sec, 90 secs
lola: 41856397 markings, 63194898 edges, 424574 markings/sec, 95 secs
lola: 43504282 markings, 65683795 edges, 329577 markings/sec, 100 secs
lola: 44531911 markings, 67235537 edges, 205526 markings/sec, 105 secs
lola: 45031958 markings, 67989656 edges, 100009 markings/sec, 110 secs
lola: 46780417 markings, 70630698 edges, 349692 markings/sec, 115 secs
lola: 48042797 markings, 72535155 edges, 252476 markings/sec, 120 secs
lola: 49341128 markings, 74495363 edges, 259666 markings/sec, 125 secs
lola: 50365526 markings, 76042038 edges, 204880 markings/sec, 130 secs
lola: 51874971 markings, 78320958 edges, 301889 markings/sec, 135 secs
lola: 52780878 markings, 79688700 edges, 181181 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (X (((p40 + 1 <= p223) AND (p232 + 1 <= p146)))) AND (F ((p40 + 1 <= p223)) OR X (X (G (((p40 + 1 <= p223) AND (p232 + 1 <= p146))))))) OR (p153 + 1 <= p131)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X (((p40 + 1 <= p223) AND (p232 + 1 <= p146)))) AND (F ((p40 + 1 <= p223)) OR X (X (G (((p40 + 1 <= p223) AND (p232 + 1 <= p146))))))) OR (p153 + 1 <= p131)))
lola: processed formula length: 166
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1998329 markings, 3017030 edges, 399666 markings/sec, 0 secs
lola: 4163374 markings, 6285820 edges, 433009 markings/sec, 5 secs
lola: 6341885 markings, 9574920 edges, 435702 markings/sec, 10 secs
lola: 8511652 markings, 12850872 edges, 433953 markings/sec, 15 secs
lola: 10528599 markings, 15896049 edges, 403389 markings/sec, 20 secs
lola: 12661413 markings, 19116211 edges, 426563 markings/sec, 25 secs
lola: 14802410 markings, 22348701 edges, 428199 markings/sec, 30 secs
lola: 17015693 markings, 25690282 edges, 442657 markings/sec, 35 secs
lola: 19217040 markings, 29013892 edges, 440269 markings/sec, 40 secs
lola: 21422695 markings, 32343994 edges, 441131 markings/sec, 45 secs
lola: 23627281 markings, 35672515 edges, 440917 markings/sec, 50 secs
lola: 25782722 markings, 38926787 edges, 431088 markings/sec, 55 secs
lola: 27910668 markings, 42139605 edges, 425589 markings/sec, 60 secs
lola: 30067196 markings, 45395530 edges, 431306 markings/sec, 65 secs
lola: 32256705 markings, 48701231 edges, 437902 markings/sec, 70 secs
lola: 34446633 markings, 52007572 edges, 437986 markings/sec, 75 secs
lola: 36650292 markings, 55334687 edges, 440732 markings/sec, 80 secs
lola: 38830881 markings, 58626969 edges, 436118 markings/sec, 85 secs
lola: 40970404 markings, 61857230 edges, 427905 markings/sec, 90 secs
lola: 42836188 markings, 64674191 edges, 373157 markings/sec, 95 secs
lola: 43959746 markings, 66371161 edges, 224712 markings/sec, 100 secs
lola: 44628223 markings, 67379804 edges, 133695 markings/sec, 105 secs
lola: 45579312 markings, 68815783 edges, 190218 markings/sec, 110 secs
lola: 46471885 markings, 70163396 edges, 178515 markings/sec, 115 secs
lola: 47503989 markings, 71721681 edges, 206421 markings/sec, 120 secs
lola: 48236625 markings, 72827767 edges, 146527 markings/sec, 125 secs
lola: 49604566 markings, 74893100 edges, 273588 markings/sec, 130 secs
lola: 51234829 markings, 77354478 edges, 326053 markings/sec, 135 secs
lola: 52451124 markings, 79190836 edges, 243259 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (F ((p200 <= p174))) OR (p114 + 1 <= p189))) OR (X ((p200 <= p174)) AND (p189 <= p114)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p189 <= p114)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p189 <= p114)
lola: processed formula length: 14
lola: 37 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: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p200 <= p174))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p200 <= p174))
lola: processed formula length: 18
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 52 markings, 51 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p208 <= 2))) AND (F ((3 <= p59)) OR (1 <= p154)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p154)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p154)
lola: processed formula length: 11
lola: 37 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 5 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p59))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p59 <= 2)
lola: processed formula length: 10
lola: 39 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 5 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p42 <= p217) U X (X (X ((3 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p42 <= p217) U X (X (X ((3 <= p4)))))
lola: processed formula length: 39
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 6 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p137 <= p123)))) AND G ((p128 <= p207))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p137 <= p123)))) AND G ((p128 <= p207))))
lola: processed formula length: 53
lola: 37 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: 2028969 markings, 3063303 edges, 405794 markings/sec, 0 secs
lola: 4261871 markings, 6434537 edges, 446580 markings/sec, 5 secs
lola: 6414831 markings, 9685090 edges, 430592 markings/sec, 10 secs
lola: 8421063 markings, 12714106 edges, 401246 markings/sec, 15 secs
lola: 10372615 markings, 15660574 edges, 390310 markings/sec, 20 secs
lola: 12363249 markings, 18666044 edges, 398127 markings/sec, 25 secs
lola: 14399921 markings, 21741016 edges, 407334 markings/sec, 30 secs
lola: 16635090 markings, 25115695 edges, 447034 markings/sec, 35 secs
lola: 18855594 markings, 28468197 edges, 444101 markings/sec, 40 secs
lola: 21071245 markings, 31813397 edges, 443130 markings/sec, 45 secs
lola: 23188119 markings, 35009435 edges, 423375 markings/sec, 50 secs
lola: 25097650 markings, 37892469 edges, 381906 markings/sec, 55 secs
lola: 27058909 markings, 40853590 edges, 392252 markings/sec, 60 secs
lola: 29048029 markings, 43856791 edges, 397824 markings/sec, 65 secs
lola: 30989126 markings, 46787454 edges, 388219 markings/sec, 70 secs
lola: 32917866 markings, 49699494 edges, 385748 markings/sec, 75 secs
lola: 34853000 markings, 52621154 edges, 387027 markings/sec, 80 secs
lola: 36882632 markings, 55685490 edges, 405926 markings/sec, 85 secs
lola: 38847739 markings, 58652418 edges, 393021 markings/sec, 90 secs
lola: 40746094 markings, 61518551 edges, 379671 markings/sec, 95 secs
lola: 42602497 markings, 64321344 edges, 371281 markings/sec, 100 secs
lola: 43660209 markings, 65926626 edges, 211542 markings/sec, 105 secs
lola: 44898985 markings, 67789369 edges, 247755 markings/sec, 110 secs
lola: 46025266 markings, 69489058 edges, 225256 markings/sec, 115 secs
lola: 47081003 markings, 71083034 edges, 211147 markings/sec, 120 secs
lola: 48455373 markings, 73158070 edges, 274874 markings/sec, 125 secs
lola: 49743223 markings, 75102467 edges, 257570 markings/sec, 130 secs
lola: 51408620 markings, 77616877 edges, 333079 markings/sec, 135 secs
lola: 52521475 markings, 79297071 edges, 222571 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p133 <= p247) U X (F ((3 <= p204)))) AND ((p204 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p204 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p204 <= 2))
lola: processed formula length: 13
lola: 37 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: subprocess 8 will run for 988 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p133 <= p247) U X (F ((3 <= p204))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p133 <= p247) U X (F ((3 <= p204))))
lola: processed formula length: 38
lola: 37 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: 52 markings, 52 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 988 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p102 + 1 <= p69) AND (2 <= p141)))) OR ((p208 <= p127) AND (3 <= p196))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p102 + 1 <= p69) AND (2 <= p141)))) OR ((p208 <= p127) AND (3 <= p196))))
lola: processed formula length: 85
lola: 37 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: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 9 will run for 1482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p41 + 1 <= p207))) AND X (F ((p217 <= p231))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p41 + 1 <= p207)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p41 + 1 <= p207)))
lola: processed formula length: 25
lola: 37 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: add low 201
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: 8 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 2965 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p156 + 1 <= p179)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p156 + 1 <= p179)))
lola: processed formula length: 26
lola: 37 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: add low 201
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: 8 markings, 9 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((F ((p221 <= p139)) U X (X (F ((p122 + 1 <= p220))))) OR X ((p43 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((F ((p221 <= p139)) U X (X (F ((p122 + 1 <= p220))))) OR X ((p43 <= p169)))))
lola: processed formula length: 84
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 2054890 markings, 2585616 edges, 410978 markings/sec, 0 secs
lola: 4344045 markings, 5466025 edges, 457831 markings/sec, 5 secs
lola: 6448464 markings, 8114024 edges, 420884 markings/sec, 10 secs
lola: 8663940 markings, 10901778 edges, 443095 markings/sec, 15 secs
lola: 10775922 markings, 13559282 edges, 422396 markings/sec, 20 secs
lola: 12902391 markings, 16235013 edges, 425294 markings/sec, 25 secs
lola: 14986322 markings, 18857162 edges, 416786 markings/sec, 30 secs
lola: 17141280 markings, 21568790 edges, 430992 markings/sec, 35 secs
lola: 19376272 markings, 24381075 edges, 446998 markings/sec, 40 secs
lola: 21663626 markings, 27259271 edges, 457471 markings/sec, 45 secs
lola: 23780667 markings, 29923145 edges, 423408 markings/sec, 50 secs
lola: 25896461 markings, 32585483 edges, 423159 markings/sec, 55 secs
lola: 27862823 markings, 35059761 edges, 393272 markings/sec, 60 secs
lola: 30049731 markings, 37811555 edges, 437382 markings/sec, 65 secs
lola: 32206640 markings, 40525575 edges, 431382 markings/sec, 70 secs
lola: 34528717 markings, 43447455 edges, 464415 markings/sec, 75 secs
lola: 36666374 markings, 46137265 edges, 427531 markings/sec, 80 secs
lola: 38856281 markings, 48892789 edges, 437981 markings/sec, 85 secs
lola: 41307832 markings, 51977598 edges, 490310 markings/sec, 90 secs
lola: 43754996 markings, 55056835 edges, 489433 markings/sec, 95 secs
lola: 45887720 markings, 57740732 edges, 426545 markings/sec, 100 secs
lola: 46799914 markings, 58891345 edges, 182439 markings/sec, 105 secs
lola: 47552486 markings, 59835469 edges, 150514 markings/sec, 110 secs
lola: 48363050 markings, 60855146 edges, 162113 markings/sec, 115 secs
lola: 49662852 markings, 62490708 edges, 259960 markings/sec, 120 secs
lola: 51040270 markings, 64223926 edges, 275484 markings/sec, 125 secs
lola: 52571180 markings, 66150308 edges, 306182 markings/sec, 130 secs
lola: 54014722 markings, 67966662 edges, 288708 markings/sec, 135 secs
lola: 55470456 markings, 69798430 edges, 291147 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((X (X ((p212 <= p83))) OR G ((2 <= p171)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X ((p212 <= p83))) OR G ((2 <= p171)))))
lola: processed formula length: 50
lola: 37 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: 1847829 markings, 2789791 edges, 369566 markings/sec, 0 secs
lola: 4039127 markings, 6098237 edges, 438260 markings/sec, 5 secs
lola: 6222701 markings, 9394993 edges, 436715 markings/sec, 10 secs
lola: 8434532 markings, 12734432 edges, 442366 markings/sec, 15 secs
lola: 10601269 markings, 16005776 edges, 433347 markings/sec, 20 secs
lola: 12716763 markings, 19199752 edges, 423099 markings/sec, 25 secs
lola: 14837699 markings, 22401973 edges, 424187 markings/sec, 30 secs
lola: 17050784 markings, 25743295 edges, 442617 markings/sec, 35 secs
lola: 19254748 markings, 29070820 edges, 440793 markings/sec, 40 secs
lola: 21459723 markings, 32399899 edges, 440995 markings/sec, 45 secs
lola: 23656281 markings, 35716289 edges, 439312 markings/sec, 50 secs
lola: 25799862 markings, 38952667 edges, 428716 markings/sec, 55 secs
lola: 27919805 markings, 42153373 edges, 423989 markings/sec, 60 secs
lola: 30063863 markings, 45390500 edges, 428812 markings/sec, 65 secs
lola: 32246021 markings, 48685113 edges, 436432 markings/sec, 70 secs
lola: 34274325 markings, 51747458 edges, 405661 markings/sec, 75 secs
lola: 36194870 markings, 54647083 edges, 384109 markings/sec, 80 secs
lola: 38210682 markings, 57690564 edges, 403162 markings/sec, 85 secs
lola: 40125751 markings, 60581942 edges, 383014 markings/sec, 90 secs
lola: 42055607 markings, 63495655 edges, 385971 markings/sec, 95 secs
lola: 43335641 markings, 65428336 edges, 256007 markings/sec, 100 secs
lola: 44495940 markings, 67186852 edges, 232060 markings/sec, 105 secs
lola: 45640231 markings, 68907735 edges, 228858 markings/sec, 110 secs
lola: 46914370 markings, 70831460 edges, 254828 markings/sec, 115 secs
lola: 48269143 markings, 72876858 edges, 270955 markings/sec, 120 secs
lola: 49380483 markings, 74554784 edges, 222268 markings/sec, 125 secs
lola: 50649603 markings, 76470898 edges, 253824 markings/sec, 130 secs
lola: 51782597 markings, 78181502 edges, 226599 markings/sec, 135 secs
lola: 53009177 markings, 80041281 edges, 245316 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (((X (X (((p40 + 1 <= p223) AND (p232 + 1 <= p146)))) AND (F ((p40 + 1 <= p223)) OR X (X (G (((p40 + 1 <= p223) AND (p232 + 1 <= p146))))))) OR (p153 + 1 <= p131)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X (((p40 + 1 <= p223) AND (p232 + 1 <= p146)))) AND (F ((p40 + 1 <= p223)) OR X (X (G (((p40 + 1 <= p223) AND (p232 + 1 <= p146))))))) OR (p153 + 1 <= p131)))
lola: processed formula length: 166
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 1826964 markings, 2758312 edges, 365393 markings/sec, 0 secs
lola: 3758057 markings, 5673883 edges, 386219 markings/sec, 5 secs
lola: 5629441 markings, 8499315 edges, 374277 markings/sec, 10 secs
lola: 7622232 markings, 11508004 edges, 398558 markings/sec, 15 secs
lola: 9515868 markings, 14367031 edges, 378727 markings/sec, 20 secs
lola: 11448051 markings, 17284255 edges, 386437 markings/sec, 25 secs
lola: 13435739 markings, 20285281 edges, 397538 markings/sec, 30 secs
lola: 15362129 markings, 23193747 edges, 385278 markings/sec, 35 secs
lola: 17330507 markings, 26165590 edges, 393676 markings/sec, 40 secs
lola: 19299592 markings, 29138547 edges, 393817 markings/sec, 45 secs
lola: 21270075 markings, 32113590 edges, 394097 markings/sec, 50 secs
lola: 23264258 markings, 35124409 edges, 398837 markings/sec, 55 secs
lola: 25173791 markings, 38007424 edges, 381907 markings/sec, 60 secs
lola: 27205439 markings, 41074821 edges, 406330 markings/sec, 65 secs
lola: 29148798 markings, 44008937 edges, 388672 markings/sec, 70 secs
lola: 31283070 markings, 47231245 edges, 426854 markings/sec, 75 secs
lola: 33452532 markings, 50506726 edges, 433892 markings/sec, 80 secs
lola: 35629407 markings, 53793339 edges, 435375 markings/sec, 85 secs
lola: 37816980 markings, 57096151 edges, 437515 markings/sec, 90 secs
lola: 39957823 markings, 60328429 edges, 428169 markings/sec, 95 secs
lola: 42072842 markings, 63521674 edges, 423004 markings/sec, 100 secs
lola: 43597216 markings, 65828631 edges, 304875 markings/sec, 105 secs
lola: 45129150 markings, 68136409 edges, 306387 markings/sec, 110 secs
lola: 46474707 markings, 70168541 edges, 269111 markings/sec, 115 secs
lola: 47953920 markings, 72401056 edges, 295843 markings/sec, 120 secs
lola: 49254400 markings, 74364437 edges, 260096 markings/sec, 125 secs
lola: 50714304 markings, 76568565 edges, 291981 markings/sec, 130 secs
lola: 51946352 markings, 78428732 edges, 246410 markings/sec, 135 secs
lola: 53126406 markings, 80210401 edges, 236011 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p137 <= p123)))) AND G ((p128 <= p207))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p137 <= p123)))) AND G ((p128 <= p207))))
lola: processed formula length: 53
lola: 37 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: 1884998 markings, 2845929 edges, 377000 markings/sec, 0 secs
lola: 4009799 markings, 6053969 edges, 424960 markings/sec, 5 secs
lola: 5977473 markings, 9024746 edges, 393535 markings/sec, 10 secs
lola: 7984688 markings, 12055235 edges, 401443 markings/sec, 15 secs
lola: 9904565 markings, 14953887 edges, 383975 markings/sec, 20 secs
lola: 11810032 markings, 17830810 edges, 381093 markings/sec, 25 secs
lola: 13661911 markings, 20626741 edges, 370376 markings/sec, 30 secs
lola: 15679828 markings, 23673405 edges, 403583 markings/sec, 35 secs
lola: 17831689 markings, 26922281 edges, 430372 markings/sec, 40 secs
lola: 20028393 markings, 30238874 edges, 439341 markings/sec, 45 secs
lola: 22222322 markings, 33551304 edges, 438786 markings/sec, 50 secs
lola: 24406628 markings, 36849183 edges, 436861 markings/sec, 55 secs
lola: 26406951 markings, 39869294 edges, 400065 markings/sec, 60 secs
lola: 28475490 markings, 42992352 edges, 413708 markings/sec, 65 secs
lola: 30589071 markings, 46183449 edges, 422716 markings/sec, 70 secs
lola: 32714035 markings, 49391735 edges, 424993 markings/sec, 75 secs
lola: 34842811 markings, 52605773 edges, 425755 markings/sec, 80 secs
lola: 37004321 markings, 55869182 edges, 432302 markings/sec, 85 secs
lola: 39110962 markings, 59049852 edges, 421328 markings/sec, 90 secs
lola: 41208036 markings, 62216002 edges, 419415 markings/sec, 95 secs
lola: 43024045 markings, 64958471 edges, 363202 markings/sec, 100 secs
lola: 44198451 markings, 66732004 edges, 234881 markings/sec, 105 secs
lola: 45611217 markings, 68865754 edges, 282553 markings/sec, 110 secs
lola: 47252890 markings, 71342543 edges, 328335 markings/sec, 115 secs
lola: 48623823 markings, 73412394 edges, 274187 markings/sec, 120 secs
lola: 50015544 markings, 75513591 edges, 278344 markings/sec, 125 secs
lola: 51643834 markings, 77971973 edges, 325658 markings/sec, 130 secs
lola: 52701957 markings, 79569542 edges, 211625 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown unknown yes no no no unknown no yes no
lola:
preliminary result: unknown unknown unknown yes no no no unknown no yes no
lola: memory consumption: 3352 KB
lola: time consumption: 1205 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-050051"
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-050051, 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-162089432900341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050051.tgz
mv RefineWMG-PT-050051 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 '
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 ;