fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r094-tall-162048902300077
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Diffusion2D-PT-D30N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4328.852 3600000.00 1231374.00 4645.50 FFFFFFTFFTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902300077.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Diffusion2D-PT-D30N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902300077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 Diffusion2D-PT-D30N100-00
FORMULA_NAME Diffusion2D-PT-D30N100-01
FORMULA_NAME Diffusion2D-PT-D30N100-02
FORMULA_NAME Diffusion2D-PT-D30N100-03
FORMULA_NAME Diffusion2D-PT-D30N100-04
FORMULA_NAME Diffusion2D-PT-D30N100-05
FORMULA_NAME Diffusion2D-PT-D30N100-06
FORMULA_NAME Diffusion2D-PT-D30N100-07
FORMULA_NAME Diffusion2D-PT-D30N100-08
FORMULA_NAME Diffusion2D-PT-D30N100-09
FORMULA_NAME Diffusion2D-PT-D30N100-10
FORMULA_NAME Diffusion2D-PT-D30N100-11
FORMULA_NAME Diffusion2D-PT-D30N100-12
FORMULA_NAME Diffusion2D-PT-D30N100-13
FORMULA_NAME Diffusion2D-PT-D30N100-14
FORMULA_NAME Diffusion2D-PT-D30N100-15

=== Now, execution of the tool begins

BK_START 1620729658147

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 10:40:59] [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-11 10:41:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 10:41:00] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2021-05-11 10:41:00] [INFO ] Transformed 900 places.
[2021-05-11 10:41:00] [INFO ] Transformed 6844 transitions.
[2021-05-11 10:41:00] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100082 steps, including 0 resets, run finished after 114 ms. (steps per millisecond=877 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 6844 rows 900 cols
[2021-05-11 10:41:00] [INFO ] Computed 1 place invariants in 63 ms
[2021-05-11 10:41:00] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2021-05-11 10:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:41:07] [INFO ] [Real]Absence check using state equation in 6552 ms returned sat
[2021-05-11 10:41:08] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 500 ms.
[2021-05-11 10:41:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:41:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 39 ms returned sat
[2021-05-11 10:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:41:15] [INFO ] [Nat]Absence check using state equation in 6326 ms returned sat
[2021-05-11 10:41:16] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 414 ms.
[2021-05-11 10:41:29] [INFO ] Added : 280 causal constraints over 56 iterations in 13448 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned unsat
[2021-05-11 10:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:41:36] [INFO ] [Real]Absence check using state equation in 6657 ms returned sat
[2021-05-11 10:41:36] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 403 ms.
[2021-05-11 10:41:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:41:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:41:43] [INFO ] [Nat]Absence check using state equation in 6390 ms returned sat
[2021-05-11 10:41:44] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 327 ms.
[2021-05-11 10:41:57] [INFO ] Added : 285 causal constraints over 57 iterations in 13412 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:41:57] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:42:04] [INFO ] [Real]Absence check using state equation in 6651 ms returned sat
[2021-05-11 10:42:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 359 ms.
[2021-05-11 10:42:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:42:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2021-05-11 10:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:42:11] [INFO ] [Nat]Absence check using state equation in 6324 ms returned sat
[2021-05-11 10:42:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 345 ms.
[2021-05-11 10:42:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t161 0) (or (and (> t150 0) (< o150 o161)) (and (> t173 0) (< o173 o161)) (and (> t385 0) (< o385 o161)) (and (> t392 0) (< o392 o161)) (and (> t407 0) (< o407 o161)) (and (> t6761 0) (< o6761 o161)) (and (> t6768 0) (< o6768 o161)) (and (> t6783 0) (< o6783 o161))))") while checking expression at index 3
[2021-05-11 10:42:25] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned unsat
[2021-05-11 10:42:25] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:42:32] [INFO ] [Real]Absence check using state equation in 6382 ms returned sat
[2021-05-11 10:42:32] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 342 ms.
[2021-05-11 10:42:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2021-05-11 10:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:42:39] [INFO ] [Nat]Absence check using state equation in 6463 ms returned sat
[2021-05-11 10:42:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 349 ms.
[2021-05-11 10:42:53] [INFO ] Added : 285 causal constraints over 57 iterations in 13378 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:42:53] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:42:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:42:59] [INFO ] [Real]Absence check using state equation in 6494 ms returned sat
[2021-05-11 10:43:00] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 337 ms.
[2021-05-11 10:43:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:43:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2021-05-11 10:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:43:07] [INFO ] [Nat]Absence check using state equation in 6496 ms returned sat
[2021-05-11 10:43:08] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 376 ms.
[2021-05-11 10:43:21] [INFO ] Added : 280 causal constraints over 56 iterations in 13349 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:43:21] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
[2021-05-11 10:43:21] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned unsat
[2021-05-11 10:43:21] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:43:28] [INFO ] [Real]Absence check using state equation in 7236 ms returned sat
[2021-05-11 10:43:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:43:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 41 ms returned sat
[2021-05-11 10:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:43:36] [INFO ] [Nat]Absence check using state equation in 7402 ms returned sat
[2021-05-11 10:43:36] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 344 ms.
[2021-05-11 10:43:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t391 0) (or (and (> t153 0) (< o153 o391)) (and (> t160 0) (< o160 o391)) (and (> t174 0) (< o174 o391)) (and (> t387 0) (< o387 o391)) (and (> t409 0) (< o409 o391)) (and (> t619 0) (< o619 o391)) (and (> t626 0) (< o626 o391)) (and (> t641 0) (< o641 o391))))") while checking expression at index 9
[2021-05-11 10:43:48] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2021-05-11 10:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:43:55] [INFO ] [Real]Absence check using state equation in 6869 ms returned sat
[2021-05-11 10:43:56] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 339 ms.
[2021-05-11 10:43:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:43:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:44:03] [INFO ] [Nat]Absence check using state equation in 6747 ms returned sat
[2021-05-11 10:44:04] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 336 ms.
[2021-05-11 10:44:16] [INFO ] Added : 275 causal constraints over 55 iterations in 13069 ms. Result :(error "Failed to check-sat")
[2021-05-11 10:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2021-05-11 10:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 10:44:23] [INFO ] [Real]Absence check using state equation in 6319 ms returned sat
[2021-05-11 10:44:23] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 387 ms.
[2021-05-11 10:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 10:44:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2021-05-11 10:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 10:44:30] [INFO ] [Nat]Absence check using state equation in 6417 ms returned sat
[2021-05-11 10:44:31] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 350 ms.
[2021-05-11 10:44:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t190 0) (or (and (> t179 0) (< o179 o190)) (and (> t194 0) (< o194 o190)) (and (> t414 0) (< o414 o190)) (and (> t421 0) (< o421 o190)) (and (> t428 0) (< o428 o190)) (and (> t6790 0) (< o6790 o190)) (and (> t6797 0) (< o6797 o190)) (and (> t6804 0) (< o6804 o190))))") while checking expression at index 11
[2021-05-11 10:44:44] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned unsat
[2021-05-11 10:44:44] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-11 10:44:45] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-11 10:44:45] [INFO ] Flatten gal took : 370 ms
FORMULA Diffusion2D-PT-D30N100-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N100-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N100-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N100-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 10:44:45] [INFO ] Flatten gal took : 179 ms
[2021-05-11 10:44:45] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-11 10:44:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 39 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D30N100 @ 3570 seconds

FORMULA Diffusion2D-PT-D30N100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2588
rslt: Output for LTLCardinality @ Diffusion2D-PT-D30N100

{
"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": "Tue May 11 10:44:46 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X ((X (F ((p262 <= 0))) AND G ((3 <= p837)))))",
"processed_size": 49,
"rewrites": 83
},
"result":
{
"edges": 1501,
"markings": 1501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"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": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (X ((G ((p724 + 1 <= p53)) AND F ((p176 + 1 <= p857))))))",
"processed_size": 62,
"rewrites": 83
},
"result":
{
"edges": 1501,
"markings": 1501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"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": 394
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"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": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((p466 <= p34)) AND (p466 <= p34)))",
"processed_size": 41,
"rewrites": 83
},
"result":
{
"edges": 276617,
"markings": 103095,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 450
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p225 <= p618)))",
"processed_size": 22,
"rewrites": 83
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "F ((X (X (F ((p431 + 1 <= p395)))) AND (p806 <= p715)))",
"processed_size": 55,
"rewrites": 83
},
"result":
{
"edges": 1501,
"markings": 1501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 630
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((1 <= p203))))",
"processed_size": 23,
"rewrites": 83
},
"result":
{
"edges": 1501,
"markings": 1501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 787
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F ((X ((p125 <= p710)) AND G ((1 <= p277)))) AND (p125 <= p710))))",
"processed_size": 73,
"rewrites": 83
},
"result":
{
"edges": 3001,
"markings": 3000,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 1050
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((2 <= p375)) AND ((1 <= p458) OR X (X ((2 <= p375))))))",
"processed_size": 62,
"rewrites": 83
},
"result":
{
"edges": 1501,
"markings": 1501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1575
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((2 <= p33)) AND ((2 <= p835) OR (2 <= p33)))))",
"processed_size": 56,
"rewrites": 83
},
"result":
{
"edges": 420,
"markings": 419,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3150
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p65 <= p327) U ((p327 + 1 <= p65) OR ((G (((p776 <= p346) OR (p65 <= p327))) AND F ((p327 + 1 <= p65))) OR ((p65 <= p327) AND (1 <= p720)))))",
"processed_size": 144,
"rewrites": 83
},
"result":
{
"edges": 320,
"markings": 320,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F (G ((p349 <= 1))) OR (F ((p529 + 1 <= p727)) AND (F ((3 <= p242)) OR G (F ((p529 + 1 <= p727))))))))",
"processed_size": 109,
"rewrites": 83
},
"result":
{
"edges": 41724641,
"markings": 9839467,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 70568,
"runtime": 982.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) AND (** OR **)))) : X(X((X(F(**)) AND G(**)))) : X(X(X((G(*) AND F(*))))) : X(G((F(G(*)) OR (F(*) AND (F(**) OR G(F(*))))))) : (F(G((X(G(**)) AND **))) AND G((F(**) AND **))) : X(F(**)) : F((X(X(F(*))) AND **)) : (** U (** OR ((G(**) AND F(**)) OR **))) : X(X(G(**))) : X(G((F((X(**) AND G(**))) AND **))) : G((F(**) AND (** OR X(X(**)))))"
},
"net":
{
"arcs": 13688,
"conflict_clusters": 900,
"places": 900,
"places_significant": 899,
"singleton_clusters": 0,
"transitions": 6844
},
"result":
{
"preliminary_value": "no no no no no yes no no no no no ",
"value": "no no no no no yes no no no no 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: 7744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: NOT(X (G (NOT(G (((2 <= p835) U (2 <= p33))))))) : X (X ((X (((3 <= p260) U F ((p262 <= 0)))) AND G ((3 <= p837))))) : X (X (NOT(X ((((p857 <= p176) U F ((p53 <= p724))) OR G ((p857 <= p176))))))) : NOT(F (X ((G (F ((2 <= p349))) AND (NOT(F ((3 <= p242))) U G ((p727 <= p529))))))) : (F (G ((X (X (G ((3 <= p459)))) AND X ((2 <= p506))))) AND G ((F ((p466 <= p34)) AND (p466 <= p34)))) : F (X ((p225 <= p618))) : F ((X (X (F (((0 <= 0) U NOT(G ((p395 <= p431))))))) AND (p806 <= p715))) : ((p65 <= p327) U ((G (((p776 <= p346) OR (p65 <= p327))) U (p327 + 1 <= p65)) OR ((p65 <= p327) AND (1 <= p720)))) : NOT(X (F (NOT(G (X ((1 <= p203))))))) : G (X ((F (((3 <= p397) U (X ((p125 <= p710)) AND G ((1 <= p277))))) AND (p125 <= p710)))) : (G (((1 <= p458) U X (X ((2 <= p375))))) AND ((0 <= 0) U (0 <= 0)))
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:431
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F ((p262 <= 0))) AND G ((3 <= p837)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F ((p262 <= 0))) AND G ((3 <= p837)))))
lola: processed formula length: 49
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 1501 markings, 1501 edges
lola: ========================================
lola: subprocess 1 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((G ((p724 + 1 <= p53)) AND F ((p176 + 1 <= p857))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((G ((p724 + 1 <= p53)) AND F ((p176 + 1 <= p857))))))
lola: processed formula length: 62
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 1501 markings, 1501 edges
lola: ========================================
lola: subprocess 2 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((p349 <= 1))) OR (F ((p529 + 1 <= p727)) AND (F ((3 <= p242)) OR G (F ((p529 + 1 <= p727))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((p349 <= 1))) OR (F ((p529 + 1 <= p727)) AND (F ((3 <= p242)) OR G (F ((p529 + 1 <= p727))))))))
lola: processed formula length: 109
lola: 83 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: 147557 markings, 555770 edges, 29511 markings/sec, 0 secs
lola: 287543 markings, 1138622 edges, 27997 markings/sec, 5 secs
lola: 414423 markings, 1658395 edges, 25376 markings/sec, 10 secs
lola: 525526 markings, 2109041 edges, 22221 markings/sec, 15 secs
lola: 631777 markings, 2544136 edges, 21250 markings/sec, 20 secs
lola: 735202 markings, 2963924 edges, 20685 markings/sec, 25 secs
lola: 833371 markings, 3370008 edges, 19634 markings/sec, 30 secs
lola: 933263 markings, 3784371 edges, 19978 markings/sec, 35 secs
lola: 1029861 markings, 4195268 edges, 19320 markings/sec, 40 secs
lola: 1129068 markings, 4603216 edges, 19841 markings/sec, 45 secs
lola: 1228195 markings, 5012808 edges, 19825 markings/sec, 50 secs
lola: 1325287 markings, 5416891 edges, 19418 markings/sec, 55 secs
lola: 1422098 markings, 5820642 edges, 19362 markings/sec, 60 secs
lola: 1523079 markings, 6241190 edges, 20196 markings/sec, 65 secs
lola: 1625144 markings, 6667966 edges, 20413 markings/sec, 70 secs
lola: 1723955 markings, 7080410 edges, 19762 markings/sec, 75 secs
lola: 1821913 markings, 7494760 edges, 19592 markings/sec, 80 secs
lola: 1919569 markings, 7911547 edges, 19531 markings/sec, 85 secs
lola: 2023722 markings, 8354415 edges, 20831 markings/sec, 90 secs
lola: 2120944 markings, 8770293 edges, 19444 markings/sec, 95 secs
lola: 2222135 markings, 9196634 edges, 20238 markings/sec, 100 secs
lola: 2320226 markings, 9609746 edges, 19618 markings/sec, 105 secs
lola: 2418156 markings, 10025666 edges, 19586 markings/sec, 110 secs
lola: 2512404 markings, 10426330 edges, 18850 markings/sec, 115 secs
lola: 2611814 markings, 10850837 edges, 19882 markings/sec, 120 secs
lola: 2703905 markings, 11238640 edges, 18418 markings/sec, 125 secs
lola: 2799184 markings, 11643280 edges, 19056 markings/sec, 130 secs
lola: 2893257 markings, 12045413 edges, 18815 markings/sec, 135 secs
lola: 2991063 markings, 12465840 edges, 19561 markings/sec, 140 secs
lola: 3084340 markings, 12861649 edges, 18655 markings/sec, 145 secs
lola: 3179043 markings, 13269073 edges, 18941 markings/sec, 150 secs
lola: 3275258 markings, 13679255 edges, 19243 markings/sec, 155 secs
lola: 3364104 markings, 14059802 edges, 17769 markings/sec, 160 secs
lola: 3458842 markings, 14467606 edges, 18948 markings/sec, 165 secs
lola: 3551729 markings, 14867275 edges, 18577 markings/sec, 170 secs
lola: 3647213 markings, 15279510 edges, 19097 markings/sec, 175 secs
lola: 3741518 markings, 15686996 edges, 18861 markings/sec, 180 secs
lola: 3835983 markings, 16094581 edges, 18893 markings/sec, 185 secs
lola: 3921734 markings, 16462132 edges, 17150 markings/sec, 190 secs
lola: 4014417 markings, 16867974 edges, 18537 markings/sec, 195 secs
lola: 4105026 markings, 17263076 edges, 18122 markings/sec, 200 secs
lola: 4197033 markings, 17664150 edges, 18401 markings/sec, 205 secs
lola: 4289901 markings, 18068822 edges, 18574 markings/sec, 210 secs
lola: 4387037 markings, 18491962 edges, 19427 markings/sec, 215 secs
lola: 4478628 markings, 18891967 edges, 18318 markings/sec, 220 secs
lola: 4575577 markings, 19316863 edges, 19390 markings/sec, 225 secs
lola: 4667373 markings, 19720127 edges, 18359 markings/sec, 230 secs
lola: 4751014 markings, 20086046 edges, 16728 markings/sec, 235 secs
lola: 4839977 markings, 20461714 edges, 17793 markings/sec, 240 secs
lola: 4914110 markings, 20763974 edges, 14827 markings/sec, 245 secs
lola: 4991595 markings, 21084497 edges, 15497 markings/sec, 250 secs
lola: 5063408 markings, 21374892 edges, 14363 markings/sec, 255 secs
lola: 5139013 markings, 21685585 edges, 15121 markings/sec, 260 secs
lola: 5217627 markings, 22008710 edges, 15723 markings/sec, 265 secs
lola: 5289370 markings, 22299862 edges, 14349 markings/sec, 270 secs
lola: 5364778 markings, 22612512 edges, 15082 markings/sec, 275 secs
lola: 5440335 markings, 22926211 edges, 15111 markings/sec, 280 secs
lola: 5512013 markings, 23220703 edges, 14336 markings/sec, 285 secs
lola: 5586338 markings, 23528773 edges, 14865 markings/sec, 290 secs
lola: 5662806 markings, 23850917 edges, 15294 markings/sec, 295 secs
lola: 5738403 markings, 24161896 edges, 15119 markings/sec, 300 secs
lola: 5811368 markings, 24464252 edges, 14593 markings/sec, 305 secs
lola: 5888849 markings, 24790140 edges, 15496 markings/sec, 310 secs
lola: 5976187 markings, 25159424 edges, 17468 markings/sec, 315 secs
lola: 6053617 markings, 25489217 edges, 15486 markings/sec, 320 secs
lola: 6133853 markings, 25828955 edges, 16047 markings/sec, 325 secs
lola: 6216435 markings, 26180423 edges, 16516 markings/sec, 330 secs
lola: 6295830 markings, 26516721 edges, 15879 markings/sec, 335 secs
lola: 6372273 markings, 26839531 edges, 15289 markings/sec, 340 secs
lola: 6457519 markings, 27199663 edges, 17049 markings/sec, 345 secs
lola: 6533669 markings, 27522278 edges, 15230 markings/sec, 350 secs
lola: 6616302 markings, 27873300 edges, 16527 markings/sec, 355 secs
lola: 6709648 markings, 28274993 edges, 18669 markings/sec, 360 secs
lola: 6798258 markings, 28651670 edges, 17722 markings/sec, 365 secs
lola: 6874424 markings, 28972720 edges, 15233 markings/sec, 370 secs
lola: 6947999 markings, 29285268 edges, 14715 markings/sec, 375 secs
lola: 7028728 markings, 29631159 edges, 16146 markings/sec, 380 secs
lola: 7109344 markings, 29975080 edges, 16123 markings/sec, 385 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2427704 KB
lola: time consumption: 417 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((X (G ((3 <= p459))) AND (2 <= p506)))) AND G ((F ((p466 <= p34)) AND (p466 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p466 <= p34)) AND (p466 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p466 <= p34)) AND (p466 <= p34)))
lola: processed formula length: 41
lola: 83 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: 103095 markings, 276617 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p225 <= p618)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p225 <= p618)))
lola: processed formula length: 22
lola: 83 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: 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((p431 + 1 <= p395)))) AND (p806 <= p715)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((p431 + 1 <= p395)))) AND (p806 <= p715)))
lola: processed formula length: 55
lola: 83 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: 1501 markings, 1501 edges
lola: ========================================
lola: subprocess 6 will run for 630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((1 <= p203))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((1 <= p203))))
lola: processed formula length: 23
lola: 83 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1501 markings, 1501 edges
lola: ========================================
lola: subprocess 7 will run for 787 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((X ((p125 <= p710)) AND G ((1 <= p277)))) AND (p125 <= p710))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((X ((p125 <= p710)) AND G ((1 <= p277)))) AND (p125 <= p710))))
lola: processed formula length: 73
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 3000 markings, 3001 edges
lola: ========================================
lola: subprocess 8 will run for 1050 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((2 <= p375)) AND ((1 <= p458) OR X (X ((2 <= p375))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((2 <= p375)) AND ((1 <= p458) OR X (X ((2 <= p375))))))
lola: processed formula length: 62
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1501 markings, 1501 edges
lola: ========================================
lola: subprocess 9 will run for 1575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((2 <= p33)) AND ((2 <= p835) OR (2 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((2 <= p33)) AND ((2 <= p835) OR (2 <= p33)))))
lola: processed formula length: 56
lola: 83 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: 419 markings, 420 edges
lola: ========================================
lola: subprocess 10 will run for 3150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p65 <= p327) U ((p327 + 1 <= p65) OR ((G (((p776 <= p346) OR (p65 <= p327))) AND F ((p327 + 1 <= p65))) OR ((p65 <= p327) AND (1 <= p720)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p65 <= p327) U ((p327 + 1 <= p65) OR ((G (((p776 <= p346) OR (p65 <= p327))) AND F ((p327 + 1 <= p65))) OR ((p65 <= p327) AND (1 <= p720)))))
lola: processed formula length: 144
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 320 markings, 320 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((p349 <= 1))) OR (F ((p529 + 1 <= p727)) AND (F ((3 <= p242)) OR G (F ((p529 + 1 <= p727))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((p349 <= 1))) OR (F ((p529 + 1 <= p727)) AND (F ((3 <= p242)) OR G (F ((p529 + 1 <= p727))))))))
lola: processed formula length: 109
lola: 83 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: 147755 markings, 556655 edges, 29551 markings/sec, 0 secs
lola: 287755 markings, 1139564 edges, 28000 markings/sec, 5 secs
lola: 414392 markings, 1658252 edges, 25327 markings/sec, 10 secs
lola: 525295 markings, 2108047 edges, 22181 markings/sec, 15 secs
lola: 631319 markings, 2542198 edges, 21205 markings/sec, 20 secs
lola: 735296 markings, 2964258 edges, 20795 markings/sec, 25 secs
lola: 835292 markings, 3378012 edges, 19999 markings/sec, 30 secs
lola: 934179 markings, 3788336 edges, 19777 markings/sec, 35 secs
lola: 1028816 markings, 4190977 edges, 18927 markings/sec, 40 secs
lola: 1127296 markings, 4595866 edges, 19696 markings/sec, 45 secs
lola: 1223638 markings, 4994896 edges, 19268 markings/sec, 50 secs
lola: 1315769 markings, 5377474 edges, 18426 markings/sec, 55 secs
lola: 1408830 markings, 5766632 edges, 18612 markings/sec, 60 secs
lola: 1506533 markings, 6174591 edges, 19541 markings/sec, 65 secs
lola: 1603030 markings, 6574070 edges, 19299 markings/sec, 70 secs
lola: 1701384 markings, 6986144 edges, 19671 markings/sec, 75 secs
lola: 1798989 markings, 7397962 edges, 19521 markings/sec, 80 secs
lola: 1893622 markings, 7799339 edges, 18927 markings/sec, 85 secs
lola: 1994396 markings, 8231596 edges, 20155 markings/sec, 90 secs
lola: 2092072 markings, 8645408 edges, 19535 markings/sec, 95 secs
lola: 2191108 markings, 9067566 edges, 19807 markings/sec, 100 secs
lola: 2287037 markings, 9469094 edges, 19186 markings/sec, 105 secs
lola: 2381163 markings, 9866918 edges, 18825 markings/sec, 110 secs
lola: 2477918 markings, 10279330 edges, 19351 markings/sec, 115 secs
lola: 2575910 markings, 10698593 edges, 19598 markings/sec, 120 secs
lola: 2669379 markings, 11091715 edges, 18694 markings/sec, 125 secs
lola: 2759700 markings, 11474373 edges, 18064 markings/sec, 130 secs
lola: 2855042 markings, 11883918 edges, 19068 markings/sec, 135 secs
lola: 2947246 markings, 12279453 edges, 18441 markings/sec, 140 secs
lola: 3044247 markings, 12695712 edges, 19400 markings/sec, 145 secs
lola: 3137129 markings, 13089262 edges, 18576 markings/sec, 150 secs
lola: 3231608 markings, 13492553 edges, 18896 markings/sec, 155 secs
lola: 3314541 markings, 13849536 edges, 16587 markings/sec, 160 secs
lola: 3409134 markings, 14255729 edges, 18919 markings/sec, 165 secs
lola: 3503270 markings, 14660520 edges, 18827 markings/sec, 170 secs
lola: 3597984 markings, 15066007 edges, 18943 markings/sec, 175 secs
lola: 3690807 markings, 15467898 edges, 18565 markings/sec, 180 secs
lola: 3791610 markings, 15905535 edges, 20161 markings/sec, 185 secs
lola: 3877894 markings, 16272948 edges, 17257 markings/sec, 190 secs
lola: 3969135 markings, 16669702 edges, 18248 markings/sec, 195 secs
lola: 4062046 markings, 17075352 edges, 18582 markings/sec, 200 secs
lola: 4153155 markings, 17472634 edges, 18222 markings/sec, 205 secs
lola: 4247276 markings, 17883045 edges, 18824 markings/sec, 210 secs
lola: 4344345 markings, 18306465 edges, 19414 markings/sec, 215 secs
lola: 4438423 markings, 18714866 edges, 18816 markings/sec, 220 secs
lola: 4531410 markings, 19124008 edges, 18597 markings/sec, 225 secs
lola: 4626018 markings, 19539331 edges, 18922 markings/sec, 230 secs
lola: 4706218 markings, 19889031 edges, 16040 markings/sec, 235 secs
lola: 4801524 markings, 20306175 edges, 19061 markings/sec, 240 secs
lola: 4877740 markings, 20615205 edges, 15243 markings/sec, 245 secs
lola: 4948673 markings, 20904132 edges, 14187 markings/sec, 250 secs
lola: 5023065 markings, 21206857 edges, 14878 markings/sec, 255 secs
lola: 5093567 markings, 21496693 edges, 14100 markings/sec, 260 secs
lola: 5166850 markings, 21796432 edges, 14657 markings/sec, 265 secs
lola: 5241796 markings, 22107212 edges, 14989 markings/sec, 270 secs
lola: 5312172 markings, 22395149 edges, 14075 markings/sec, 275 secs
lola: 5385646 markings, 22696002 edges, 14695 markings/sec, 280 secs
lola: 5458842 markings, 23001122 edges, 14639 markings/sec, 285 secs
lola: 5526939 markings, 23284523 edges, 13619 markings/sec, 290 secs
lola: 5596509 markings, 23572690 edges, 13914 markings/sec, 295 secs
lola: 5668477 markings, 23874513 edges, 14394 markings/sec, 300 secs
lola: 5739648 markings, 24167123 edges, 14234 markings/sec, 305 secs
lola: 5808684 markings, 24453386 edges, 13807 markings/sec, 310 secs
lola: 5880023 markings, 24753352 edges, 14268 markings/sec, 315 secs
lola: 5966453 markings, 25117894 edges, 17286 markings/sec, 320 secs
lola: 6034822 markings, 25409026 edges, 13674 markings/sec, 325 secs
lola: 6117114 markings, 25760406 edges, 16458 markings/sec, 330 secs
lola: 6194547 markings, 26087826 edges, 15487 markings/sec, 335 secs
lola: 6266813 markings, 26391583 edges, 14453 markings/sec, 340 secs
lola: 6340967 markings, 26701995 edges, 14831 markings/sec, 345 secs
lola: 6423299 markings, 27054164 edges, 16466 markings/sec, 350 secs
lola: 6496167 markings, 27364079 edges, 14574 markings/sec, 355 secs
lola: 6574429 markings, 27695096 edges, 15652 markings/sec, 360 secs
lola: 6654544 markings, 28038939 edges, 16023 markings/sec, 365 secs
lola: 6744051 markings, 28424202 edges, 17901 markings/sec, 370 secs
lola: 6840519 markings, 28829839 edges, 19294 markings/sec, 375 secs
lola: 6919969 markings, 29166355 edges, 15890 markings/sec, 380 secs
lola: 7002251 markings, 29519117 edges, 16456 markings/sec, 385 secs
lola: 7077273 markings, 29836782 edges, 15004 markings/sec, 390 secs
lola: 7159492 markings, 30190233 edges, 16444 markings/sec, 395 secs
lola: 7240233 markings, 30533519 edges, 16148 markings/sec, 400 secs
lola: 7322653 markings, 30883137 edges, 16484 markings/sec, 405 secs
lola: 7406269 markings, 31240448 edges, 16723 markings/sec, 410 secs
lola: 7488650 markings, 31591281 edges, 16476 markings/sec, 415 secs
lola: 7570608 markings, 31939128 edges, 16392 markings/sec, 420 secs
lola: 7657639 markings, 32312227 edges, 17406 markings/sec, 425 secs
lola: 7740260 markings, 32670563 edges, 16524 markings/sec, 430 secs
lola: 7824081 markings, 33026592 edges, 16764 markings/sec, 435 secs
lola: 7912726 markings, 33407490 edges, 17729 markings/sec, 440 secs
lola: 7998894 markings, 33775832 edges, 17234 markings/sec, 445 secs
lola: 8085150 markings, 34144320 edges, 17251 markings/sec, 450 secs
lola: 8165853 markings, 34490999 edges, 16141 markings/sec, 455 secs
lola: 8248759 markings, 34845312 edges, 16581 markings/sec, 460 secs
lola: 8334460 markings, 35216414 edges, 17140 markings/sec, 465 secs
lola: 8417444 markings, 35571470 edges, 16597 markings/sec, 470 secs
lola: 8505602 markings, 35955175 edges, 17632 markings/sec, 475 secs
lola: 8593016 markings, 36336615 edges, 17483 markings/sec, 480 secs
lola: 8683752 markings, 36731959 edges, 18147 markings/sec, 485 secs
lola: 8766798 markings, 37097667 edges, 16609 markings/sec, 490 secs
lola: 8842154 markings, 37418052 edges, 15071 markings/sec, 495 secs
lola: 8926114 markings, 37784290 edges, 16792 markings/sec, 500 secs
lola: 9009202 markings, 38151203 edges, 16618 markings/sec, 505 secs
lola: 9101524 markings, 38554733 edges, 18464 markings/sec, 510 secs
lola: 9195963 markings, 38967251 edges, 18888 markings/sec, 515 secs
lola: 9287360 markings, 39368840 edges, 18279 markings/sec, 520 secs
lola: 9370892 markings, 39736655 edges, 16706 markings/sec, 525 secs
lola: 9443571 markings, 40027601 edges, 14536 markings/sec, 530 secs
lola: 9520342 markings, 40354245 edges, 15354 markings/sec, 535 secs
lola: 9608331 markings, 40743859 edges, 17598 markings/sec, 540 secs
lola: 9686691 markings, 41072297 edges, 15672 markings/sec, 545 secs
lola: 9755556 markings, 41359724 edges, 13773 markings/sec, 550 secs
lola: 9838271 markings, 41719411 edges, 16543 markings/sec, 555 secs
lola: add low 4886
lola: add low 5428
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: 9839467 markings, 41724641 edges
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no no
lola:
preliminary result: no no no no no yes no no no no no
lola: ========================================
lola: memory consumption: 70568 KB
lola: time consumption: 982 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="Diffusion2D-PT-D30N100"
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 Diffusion2D-PT-D30N100, 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 r094-tall-162048902300077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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