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

About the Execution of 2020-gold for MAPK-PT-00160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.348 3600000.00 716984.00 48274.20 F?TFFFFFTTFTTFFF 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.r132-tall-162075428600365.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 MAPK-PT-00160, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-00160-00
FORMULA_NAME MAPK-PT-00160-01
FORMULA_NAME MAPK-PT-00160-02
FORMULA_NAME MAPK-PT-00160-03
FORMULA_NAME MAPK-PT-00160-04
FORMULA_NAME MAPK-PT-00160-05
FORMULA_NAME MAPK-PT-00160-06
FORMULA_NAME MAPK-PT-00160-07
FORMULA_NAME MAPK-PT-00160-08
FORMULA_NAME MAPK-PT-00160-09
FORMULA_NAME MAPK-PT-00160-10
FORMULA_NAME MAPK-PT-00160-11
FORMULA_NAME MAPK-PT-00160-12
FORMULA_NAME MAPK-PT-00160-13
FORMULA_NAME MAPK-PT-00160-14
FORMULA_NAME MAPK-PT-00160-15

=== Now, execution of the tool begins

BK_START 1620935638637

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:54:00] [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-13 19:54:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:54:00] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-13 19:54:00] [INFO ] Transformed 22 places.
[2021-05-13 19:54:00] [INFO ] Transformed 30 transitions.
[2021-05-13 19:54:00] [INFO ] Parsed PT model containing 22 places and 30 transitions in 63 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 100000 steps, including 0 resets, run finished after 59 ms. (steps per millisecond=1694 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 19:54:00] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 19:54:00] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2021-05-13 19:54:00] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 19:54:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 19:54:00] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 19:54:00] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 19:54:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2021-05-13 19:54:00] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 19:54:00] [INFO ] Flatten gal took : 24 ms
FORMULA MAPK-PT-00160-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00160-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 19:54:00] [INFO ] Flatten gal took : 6 ms
[2021-05-13 19:54:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 19:54:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-00160 @ 3570 seconds

FORMULA MAPK-PT-00160-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00160-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2803
rslt: Output for LTLCardinality @ MAPK-PT-00160

{
"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": "Thu May 13 19:54:01 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((p10 + 1 <= p5)))",
"processed_size": 23,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((p18 + 1 <= p13)) R (X (X ((p13 <= 0))) OR (p16 + 1 <= p19)))))",
"processed_size": 73,
"rewrites": 33
},
"result":
{
"edges": 263,
"markings": 131,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((2 <= p11)) AND (X (X ((F ((((1 <= p7) U (p0 <= p11)) AND (1 <= p7))) U X (G ((3 <= p7)))))) OR (2 <= p11))))",
"processed_size": 116,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((3 <= p11)))",
"processed_size": 18,
"rewrites": 33
},
"result":
{
"edges": 322,
"markings": 322,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1598
},
"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": "(p17 + 1 <= p6)",
"processed_size": 15,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3197
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p4 + 1 <= p9)",
"processed_size": 14,
"rewrites": 35
},
"result":
{
"edges": 322,
"markings": 322,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p4 + 1 <= p9)",
"processed_size": 14,
"rewrites": 35
},
"result":
{
"edges": 322,
"markings": 322,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (G ((1 <= p5))) AND F (G ((p8 <= p18)))))",
"processed_size": 47,
"rewrites": 33
},
"result":
{
"edges": 324,
"markings": 323,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3752,
"runtime": 767.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : (F(*) U (G(**) OR **)) : X(G(*)) : G(F(*)) : (G(**) OR **) : (F(**) OR G((F(G(**)) AND F(G(**))))) : ((** OR (G(*) AND **)) U **) : X(F((G(*) R (X(X(*)) OR *)))) : F((G((F(**) AND (** OR **))) AND **)) : G((F(**) AND (X(X((F(((** U **) AND **)) U X(G(**))))) OR **)))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no unknown no no no no no no no no ",
"value": "no unknown no no no 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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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: X (G (NOT(F (G (NOT(F ((3 <= p11)))))))) : (NOT(G (((p17 <= 1) AND (p1 <= 0)))) U (G ((p17 <= 1)) OR (1 <= p1))) : X (NOT(((p5 <= 1) U F ((p5 <= p10))))) : G (NOT(G (((p3 <= 1) AND (2 <= p18))))) : (G ((p4 <= p14)) OR (p17 + 1 <= p6)) : (F ((p9 <= p4)) OR G ((X (G (F (G ((1 <= p5))))) AND F (X (G ((p8 <= p18))))))) : (((p19 <= p1) OR (NOT(F ((p1 + 1 <= p19))) AND (p20 + 1 <= p5))) U (1 <= p5)) : X (F (NOT((F ((p13 <= p18)) U (X (X ((1 <= p13))) AND (p19 <= p16)))))) : F ((G (((2 <= p1) U (3 <= p16))) AND (2 <= p1))) : G ((X (X ((F ((((1 <= p7) U (p0 <= p11)) AND (1 <= p7))) U X (G ((3 <= p7)))))) U (2 <= p11)))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p10 + 1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p10 + 1 <= p5)))
lola: processed formula length: 23
lola: 33 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p18 + 1 <= p13)) R (X (X ((p13 <= 0))) OR (p16 + 1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p18 + 1 <= p13)) R (X (X ((p13 <= 0))) OR (p16 + 1 <= p19)))))
lola: processed formula length: 73
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 131 markings, 263 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((2 <= p11)) AND (X (X ((F ((((1 <= p7) U (p0 <= p11)) AND (1 <= p7))) U X (G ((3 <= p7)))))) OR (2 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((2 <= p11)) AND (X (X ((F ((((1 <= p7) U (p0 <= p11)) AND (1 <= p7))) U X (G ((3 <= p7)))))) OR (2 <= p11))))
lola: processed formula length: 116
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((3 <= p11)))
lola: processed formula length: 18
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 322 markings, 322 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((2 <= p3) OR (p18 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((2 <= p3) OR (p18 <= 1))))
lola: processed formula length: 34
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 638 markings, 874 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((3 <= p16)) AND ((2 <= p1) OR (3 <= p16)))) AND (2 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((3 <= p16)) AND ((2 <= p1) OR (3 <= p16)))) AND (2 <= p1)))
lola: processed formula length: 70
lola: 33 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: 44 markings, 44 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((2 <= p17) OR (1 <= p1))) U (G ((p17 <= 1)) OR (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((2 <= p17) OR (1 <= p1))) U (G ((p17 <= 1)) OR (1 <= p1)))
lola: processed formula length: 64
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3048465 markings, 6722047 edges, 609693 markings/sec, 0 secs
lola: 5732430 markings, 12714856 edges, 536793 markings/sec, 5 secs
lola: 8248751 markings, 18312822 edges, 503264 markings/sec, 10 secs
lola: 10642645 markings, 23618864 edges, 478779 markings/sec, 15 secs
lola: 12927088 markings, 28690038 edges, 456889 markings/sec, 20 secs
lola: 15150550 markings, 33665719 edges, 444692 markings/sec, 25 secs
lola: 17332475 markings, 38522625 edges, 436385 markings/sec, 30 secs
lola: 19496618 markings, 43369076 edges, 432829 markings/sec, 35 secs
lola: 21582785 markings, 48003702 edges, 417233 markings/sec, 40 secs
lola: 23641913 markings, 52597094 edges, 411826 markings/sec, 45 secs
lola: 25648046 markings, 57088373 edges, 401227 markings/sec, 50 secs
lola: 27641917 markings, 61543604 edges, 398774 markings/sec, 55 secs
lola: 29600651 markings, 65918863 edges, 391747 markings/sec, 60 secs
lola: 31596153 markings, 70375297 edges, 399100 markings/sec, 65 secs
lola: 33537465 markings, 74717833 edges, 388262 markings/sec, 70 secs
lola: 35445121 markings, 78993351 edges, 381531 markings/sec, 75 secs
lola: 37416021 markings, 83421885 edges, 394180 markings/sec, 80 secs
lola: 39413412 markings, 87857084 edges, 399478 markings/sec, 85 secs
lola: 41334890 markings, 92144276 edges, 384296 markings/sec, 90 secs
lola: 43216932 markings, 96334773 edges, 376408 markings/sec, 95 secs
lola: 45148340 markings, 100631511 edges, 386282 markings/sec, 100 secs
lola: 47123942 markings, 105005671 edges, 395120 markings/sec, 105 secs
lola: 49048319 markings, 109275433 edges, 384875 markings/sec, 110 secs
lola: 50902337 markings, 113427972 edges, 370804 markings/sec, 115 secs
lola: 52772765 markings, 117595693 edges, 374086 markings/sec, 120 secs
lola: 54560570 markings, 121623918 edges, 357561 markings/sec, 125 secs
lola: 56407575 markings, 125759818 edges, 369401 markings/sec, 130 secs
lola: 58259485 markings, 129904537 edges, 370382 markings/sec, 135 secs
lola: 60107303 markings, 134044524 edges, 369564 markings/sec, 140 secs
lola: 61961626 markings, 138172587 edges, 370865 markings/sec, 145 secs
lola: 63793144 markings, 142264171 edges, 366304 markings/sec, 150 secs
lola: 65665637 markings, 146443298 edges, 374499 markings/sec, 155 secs
lola: 67567579 markings, 150647813 edges, 380388 markings/sec, 160 secs
lola: 69436687 markings, 154798788 edges, 373822 markings/sec, 165 secs
lola: 71256570 markings, 158856645 edges, 363977 markings/sec, 170 secs
lola: 73049141 markings, 162867776 edges, 358514 markings/sec, 175 secs
lola: 74830835 markings, 166860045 edges, 356339 markings/sec, 180 secs
lola: 76644749 markings, 170900760 edges, 362783 markings/sec, 185 secs
lola: 78398569 markings, 174841352 edges, 350764 markings/sec, 190 secs
lola: 80126775 markings, 178730204 edges, 345641 markings/sec, 195 secs
lola: 81910403 markings, 182736713 edges, 356726 markings/sec, 200 secs
lola: 83662881 markings, 186664804 edges, 350496 markings/sec, 205 secs
lola: 85467429 markings, 190717053 edges, 360910 markings/sec, 210 secs
lola: 87252797 markings, 194719958 edges, 357074 markings/sec, 215 secs
lola: 89025122 markings, 198701657 edges, 354465 markings/sec, 220 secs
lola: 90788180 markings, 202671692 edges, 352612 markings/sec, 225 secs
lola: 92518354 markings, 206576942 edges, 346035 markings/sec, 230 secs
lola: 94280895 markings, 210550124 edges, 352508 markings/sec, 235 secs
lola: 95989779 markings, 214411595 edges, 341777 markings/sec, 240 secs
lola: 97734916 markings, 218366558 edges, 349027 markings/sec, 245 secs
lola: 99476084 markings, 222295867 edges, 348234 markings/sec, 250 secs
lola: 101178270 markings, 226149050 edges, 340437 markings/sec, 255 secs
lola: 102819099 markings, 229857704 edges, 328166 markings/sec, 260 secs
lola: 104246986 markings, 233068127 edges, 285577 markings/sec, 265 secs
lola: 105628808 markings, 236144936 edges, 276364 markings/sec, 270 secs
lola: 106999142 markings, 239217987 edges, 274067 markings/sec, 275 secs
lola: 108119035 markings, 241720235 edges, 223979 markings/sec, 280 secs
lola: 109606122 markings, 245039394 edges, 297417 markings/sec, 285 secs
lola: 111126364 markings, 248410538 edges, 304048 markings/sec, 290 secs
lola: 112501485 markings, 251437367 edges, 275024 markings/sec, 295 secs
lola: 113971478 markings, 254689191 edges, 293999 markings/sec, 300 secs
lola: 115202494 markings, 257420742 edges, 246203 markings/sec, 305 secs
lola: 116494122 markings, 260278804 edges, 258326 markings/sec, 310 secs
lola: 117865250 markings, 263346922 edges, 274226 markings/sec, 315 secs
lola: 118954505 markings, 265769953 edges, 217851 markings/sec, 320 secs
lola: 120074536 markings, 268262198 edges, 224006 markings/sec, 325 secs
lola: 121275420 markings, 270952265 edges, 240177 markings/sec, 330 secs
lola: 122381954 markings, 273431908 edges, 221307 markings/sec, 335 secs
lola: 123794702 markings, 276578960 edges, 282550 markings/sec, 340 secs
lola: 125123647 markings, 279561663 edges, 265789 markings/sec, 345 secs
lola: 126335728 markings, 282249190 edges, 242416 markings/sec, 350 secs
lola: 127480641 markings, 284822866 edges, 228983 markings/sec, 355 secs
lola: 128523154 markings, 287138316 edges, 208503 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 1066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p19 <= p1) OR (G ((p19 <= p1)) AND (p20 + 1 <= p5))) U (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p19 <= p1) OR (G ((p19 <= p1)) AND (p20 + 1 <= p5))) U (1 <= p5))
lola: processed formula length: 68
lola: 33 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: 326 markings, 326 edges
lola: ========================================
lola: subprocess 8 will run for 1598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p4 <= p14)) OR (p17 + 1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p17 + 1 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 + 1 <= p6)
lola: processed formula length: 15
lola: 33 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 9 will run for 3197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p4 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p4 <= p14))
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28494 markings, 56457 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p9 <= p4)) OR G ((F (G ((1 <= p5))) AND F (G ((p8 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p9 <= p4))
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: (p4 + 1 <= p9)
lola: processed formula length: 14
lola: 35 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: 322 markings, 322 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (((2 <= p17) OR (1 <= p1))) U (G ((p17 <= 1)) OR (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((2 <= p17) OR (1 <= p1))) U (G ((p17 <= 1)) OR (1 <= p1)))
lola: processed formula length: 64
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3044474 markings, 6712968 edges, 608895 markings/sec, 0 secs
lola: 5731475 markings, 12712690 edges, 537400 markings/sec, 5 secs
lola: 8239765 markings, 18293716 edges, 501658 markings/sec, 10 secs
lola: 10627244 markings, 23583890 edges, 477496 markings/sec, 15 secs
lola: 12932334 markings, 28701625 edges, 461018 markings/sec, 20 secs
lola: 15157238 markings, 33680914 edges, 444981 markings/sec, 25 secs
lola: 17337997 markings, 38535170 edges, 436152 markings/sec, 30 secs
lola: 19499403 markings, 43375097 edges, 432281 markings/sec, 35 secs
lola: 21596925 markings, 48035264 edges, 419504 markings/sec, 40 secs
lola: 23643521 markings, 52600635 edges, 409319 markings/sec, 45 secs
lola: 25634104 markings, 57056934 edges, 398117 markings/sec, 50 secs
lola: 27619474 markings, 61496289 edges, 397074 markings/sec, 55 secs
lola: 29600509 markings, 65918541 edges, 396207 markings/sec, 60 secs
lola: 31582419 markings, 70345242 edges, 396382 markings/sec, 65 secs
lola: 33527880 markings, 74696070 edges, 389092 markings/sec, 70 secs
lola: 35465265 markings, 79037725 edges, 387477 markings/sec, 75 secs
lola: 37412968 markings, 83415192 edges, 389541 markings/sec, 80 secs
lola: 39421345 markings, 87874804 edges, 401675 markings/sec, 85 secs
lola: 41352833 markings, 92184258 edges, 386298 markings/sec, 90 secs
lola: 43251363 markings, 96412298 edges, 379706 markings/sec, 95 secs
lola: 45179252 markings, 100700406 edges, 385578 markings/sec, 100 secs
lola: 47148382 markings, 105057586 edges, 393826 markings/sec, 105 secs
lola: 49092815 markings, 109372161 edges, 388887 markings/sec, 110 secs
lola: 50941539 markings, 113514759 edges, 369745 markings/sec, 115 secs
lola: 52808993 markings, 117677807 edges, 373491 markings/sec, 120 secs
lola: 54611198 markings, 121738600 edges, 360441 markings/sec, 125 secs
lola: 56449853 markings, 125854847 edges, 367731 markings/sec, 130 secs
lola: 58304206 markings, 130005934 edges, 370871 markings/sec, 135 secs
lola: 60165817 markings, 134173834 edges, 372322 markings/sec, 140 secs
lola: 62007700 markings, 138275314 edges, 368377 markings/sec, 145 secs
lola: 63824290 markings, 142333887 edges, 363318 markings/sec, 150 secs
lola: 65697994 markings, 146515838 edges, 374741 markings/sec, 155 secs
lola: 67603953 markings, 150727519 edges, 381192 markings/sec, 160 secs
lola: 69464535 markings, 154860146 edges, 372116 markings/sec, 165 secs
lola: 71275783 markings, 158900198 edges, 362250 markings/sec, 170 secs
lola: 73054836 markings, 162880719 edges, 355811 markings/sec, 175 secs
lola: 74818439 markings, 166831857 edges, 352721 markings/sec, 180 secs
lola: 76624948 markings, 170857502 edges, 361302 markings/sec, 185 secs
lola: 78394060 markings, 174831148 edges, 353822 markings/sec, 190 secs
lola: 80154447 markings, 178791963 edges, 352077 markings/sec, 195 secs
lola: 81947689 markings, 182819938 edges, 358648 markings/sec, 200 secs
lola: 83689967 markings, 186724984 edges, 348456 markings/sec, 205 secs
lola: 85487239 markings, 190761469 edges, 359454 markings/sec, 210 secs
lola: 87240712 markings, 194693262 edges, 350695 markings/sec, 215 secs
lola: 88986286 markings, 198614217 edges, 349115 markings/sec, 220 secs
lola: 90725692 markings, 202530209 edges, 347881 markings/sec, 225 secs
lola: 92431519 markings, 206381023 edges, 341165 markings/sec, 230 secs
lola: 94150860 markings, 210255669 edges, 343868 markings/sec, 235 secs
lola: 95832709 markings, 214056580 edges, 336370 markings/sec, 240 secs
lola: 97539234 markings, 217923094 edges, 341305 markings/sec, 245 secs
lola: 99264057 markings, 221815340 edges, 344965 markings/sec, 250 secs
lola: 100930176 markings, 225587222 edges, 333224 markings/sec, 255 secs
lola: 102590727 markings, 229340181 edges, 332110 markings/sec, 260 secs
lola: 103847177 markings, 232167412 edges, 251290 markings/sec, 265 secs
lola: 104315177 markings, 233217342 edges, 93600 markings/sec, 270 secs
lola: 105764430 markings, 236450290 edges, 289851 markings/sec, 275 secs
lola: 106517803 markings, 238152959 edges, 150675 markings/sec, 280 secs
lola: 107158961 markings, 239574263 edges, 128232 markings/sec, 285 secs
lola: 108004030 markings, 241466499 edges, 169014 markings/sec, 290 secs
lola: 109095642 markings, 243909546 edges, 218322 markings/sec, 295 secs
lola: 110207010 markings, 246371393 edges, 222274 markings/sec, 300 secs
lola: 111248772 markings, 248672577 edges, 208352 markings/sec, 305 secs
lola: 111757134 markings, 249791895 edges, 101672 markings/sec, 310 secs
lola: 113346486 markings, 253309738 edges, 317870 markings/sec, 315 secs
lola: 114482241 markings, 255829328 edges, 227151 markings/sec, 320 secs
lola: 115885982 markings, 258921639 edges, 280748 markings/sec, 325 secs
lola: 116988076 markings, 261384000 edges, 220419 markings/sec, 330 secs
lola: 118253921 markings, 264214863 edges, 253169 markings/sec, 335 secs
lola: 119518152 markings, 267019975 edges, 252846 markings/sec, 340 secs
lola: 120672683 markings, 269606158 edges, 230906 markings/sec, 345 secs
lola: 121711931 markings, 271936193 edges, 207850 markings/sec, 350 secs
lola: 122794018 markings, 274344282 edges, 216417 markings/sec, 355 secs
lola: 124098463 markings, 277262641 edges, 260889 markings/sec, 360 secs
lola: 125124141 markings, 279562808 edges, 205136 markings/sec, 365 secs
lola: 126447227 markings, 282498405 edges, 264617 markings/sec, 370 secs
lola: 127295149 markings, 284410595 edges, 169584 markings/sec, 375 secs
lola: 128346056 markings, 286750741 edges, 210181 markings/sec, 380 secs
lola: 128346156 markings, 286750961 edges, 20 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((p9 <= p4)) OR G ((F (G ((1 <= p5))) AND F (G ((p8 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p9 <= p4))
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: (p4 + 1 <= p9)
lola: processed formula length: 14
lola: 35 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: 322 markings, 322 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (G ((1 <= p5))) AND F (G ((p8 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((1 <= p5))) AND F (G ((p8 <= p18)))))
lola: processed formula length: 47
lola: 33 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 29
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: 323 markings, 324 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no no no no no
lola:
preliminary result: no unknown no no no no no no no no
lola: memory consumption: 3752 KB
lola: time consumption: 767 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="MAPK-PT-00160"
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 MAPK-PT-00160, 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 r132-tall-162075428600365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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