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.r208-smll-162089471000073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is RwMutex-PT-r0010w0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471000073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 11 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 887K 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 RwMutex-PT-r0010w0500-00
FORMULA_NAME RwMutex-PT-r0010w0500-01
FORMULA_NAME RwMutex-PT-r0010w0500-02
FORMULA_NAME RwMutex-PT-r0010w0500-03
FORMULA_NAME RwMutex-PT-r0010w0500-04
FORMULA_NAME RwMutex-PT-r0010w0500-05
FORMULA_NAME RwMutex-PT-r0010w0500-06
FORMULA_NAME RwMutex-PT-r0010w0500-07
FORMULA_NAME RwMutex-PT-r0010w0500-08
FORMULA_NAME RwMutex-PT-r0010w0500-09
FORMULA_NAME RwMutex-PT-r0010w0500-10
FORMULA_NAME RwMutex-PT-r0010w0500-11
FORMULA_NAME RwMutex-PT-r0010w0500-12
FORMULA_NAME RwMutex-PT-r0010w0500-13
FORMULA_NAME RwMutex-PT-r0010w0500-14
FORMULA_NAME RwMutex-PT-r0010w0500-15

=== Now, execution of the tool begins

BK_START 1621034708618

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:25:12] [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-14 23:25:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:25:12] [INFO ] Load time of PNML (sax parser for PT used): 478 ms
[2021-05-14 23:25:12] [INFO ] Transformed 1030 places.
[2021-05-14 23:25:12] [INFO ] Transformed 1020 transitions.
[2021-05-14 23:25:12] [INFO ] Found NUPN structural information;
[2021-05-14 23:25:12] [INFO ] Parsed PT model containing 1030 places and 1020 transitions in 592 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 5076 ms. (steps per millisecond=19 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1020 rows 1030 cols
[2021-05-14 23:25:18] [INFO ] Computed 520 place invariants in 212 ms
[2021-05-14 23:25:19] [INFO ] [Real]Absence check using 520 positive place invariants in 682 ms returned sat
[2021-05-14 23:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:25:23] [INFO ] [Real]Absence check using state equation in 4376 ms returned sat
[2021-05-14 23:25:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:25:24] [INFO ] [Nat]Absence check using 520 positive place invariants in 125 ms returned unsat
[2021-05-14 23:25:25] [INFO ] [Real]Absence check using 520 positive place invariants in 712 ms returned sat
[2021-05-14 23:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:25:29] [INFO ] [Real]Absence check using state equation in 4211 ms returned sat
[2021-05-14 23:25:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:25:30] [INFO ] [Nat]Absence check using 520 positive place invariants in 337 ms returned unsat
[2021-05-14 23:25:31] [INFO ] [Real]Absence check using 520 positive place invariants in 807 ms returned sat
[2021-05-14 23:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:25:36] [INFO ] [Real]Absence check using state equation in 4754 ms returned sat
[2021-05-14 23:25:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:25:36] [INFO ] [Nat]Absence check using 520 positive place invariants in 238 ms returned unsat
[2021-05-14 23:25:37] [INFO ] [Real]Absence check using 520 positive place invariants in 680 ms returned sat
[2021-05-14 23:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:25:41] [INFO ] [Real]Absence check using state equation in 3743 ms returned sat
[2021-05-14 23:25:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:25:41] [INFO ] [Nat]Absence check using 520 positive place invariants in 31 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-14 23:25:42] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-14 23:25:42] [INFO ] Flatten gal took : 536 ms
FORMULA RwMutex-PT-r0010w0500-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:25:42] [INFO ] Applying decomposition
[2021-05-14 23:25:42] [INFO ] Flatten gal took : 333 ms
[2021-05-14 23:25:42] [INFO ] Decomposing Gal with order
[2021-05-14 23:25:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:25:44] [INFO ] Removed a total of 8990 redundant transitions.
[2021-05-14 23:25:45] [INFO ] Flatten gal took : 1923 ms
[2021-05-14 23:25:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 68 ms.
[2021-05-14 23:25:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2021-05-14 23:25:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 34 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RwMutex-PT-r0010w0500 @ 3570 seconds

FORMULA RwMutex-PT-r0010w0500-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3551
rslt: Output for LTLCardinality @ RwMutex-PT-r0010w0500

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 23:25:47 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"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": 1,
"visible_transitions": 0
},
"processed": "X (X ((F (((p92 <= 0))) AND ((1 <= p92)))))",
"processed_size": 43,
"rewrites": 34
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((G (F (((((p886 <= 0)) OR ((1 <= p487)) OR ((1 <= p754)))))) OR (((p301 <= 0)) OR ((1 <= p848))))))",
"processed_size": 107,
"rewrites": 34
},
"result":
{
"edges": 34230,
"markings": 3050,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"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 ((G ((((1 <= p150)) AND ((p154 <= 0)))) AND F ((((p157 <= 0)) OR ((1 <= p471))))))",
"processed_size": 85,
"rewrites": 34
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 710
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": "F (G ((((p335 <= 0)) OR ((1 <= p737)))))",
"processed_size": 41,
"rewrites": 34
},
"result":
{
"edges": 4,
"markings": 3,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 888
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p594))",
"processed_size": 13,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X ((((((1 <= p507)) AND ((p640 <= 0))) U (((p345 <= 0)) OR ((1 <= p387)))) AND ((1 <= p630)))) AND F ((((p345 <= 0)) OR ((1 <= p387))))))",
"processed_size": 143,
"rewrites": 34
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1184
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": "(((p469 <= 0)) OR ((1 <= p293)))",
"processed_size": 33,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1776
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"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": "G ((G ((((p154 <= 0)) OR ((1 <= p228)))) AND X ((((p469 <= 0)) OR ((1 <= p293))))))",
"processed_size": 85,
"rewrites": 34
},
"result":
{
"edges": 10801,
"markings": 1309,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": "(((1 <= p380)) AND ((p822 <= 0)))",
"processed_size": 33,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": "(((1 <= p380)) AND ((p822 <= 0)))",
"processed_size": 33,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"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": "G ((F (G ((((p237 <= 0)) OR ((1 <= p229))))) AND F ((((1 <= p380)) AND ((p822 <= 0))))))",
"processed_size": 89,
"rewrites": 34
},
"result":
{
"edges": 572,
"markings": 288,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47840,
"runtime": 19.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((F(*) AND *))) : X(G((G(F(**)) OR (** OR **)))) : X((G(**) AND F(**))) : (G((F(G(**)) AND F(*))) AND (** AND **)) : (X(F((F(*) AND *))) AND F(G(**))) : F(**) : (X((X(((** U **) AND **)) AND F(**))) OR **) : (X(X(**)) AND (G((G(**) AND X(**))) AND **))"
},
"net":
{
"arcs": 12060,
"conflict_clusters": 511,
"places": 1030,
"places_significant": 510,
"singleton_clusters": 0,
"transitions": 1020
},
"result":
{
"preliminary_value": "no yes no no no no no no ",
"value": "no yes 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: 2050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1030
lola: finding significant places
lola: 1030 places, 1020 transitions, 510 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: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p487 <= 1)
lola: LP says that atomic proposition is always true: (p754 <= 1)
lola: LP says that atomic proposition is always true: (p485 <= 1)
lola: LP says that atomic proposition is always true: (p848 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p471 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p822 <= 1)
lola: LP says that atomic proposition is always true: (p822 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p737 <= 1)
lola: LP says that atomic proposition is always true: (p736 <= 1)
lola: LP says that atomic proposition is always true: (p640 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p630 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p387 <= 1)
lola: LP says that atomic proposition is always true: (p594 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p470 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: LP says that atomic proposition is always true: (p293 <= 1)
lola: NOT(X (X ((G (((1 <= p92))) OR ((p92 <= 0)))))) : G (X (G (((G (F (((((p886 <= 0)) OR ((1 <= p487)) OR ((1 <= p754)))))) OR ((p301 <= 0))) OR ((1 <= p848)))))) : X ((G ((((1 <= p150)) AND ((p154 <= 0)))) AND F ((((p157 <= 0)) OR ((1 <= p471)))))) : ((NOT(F ((NOT(F (G (X ((((p237 <= 0)) OR ((1 <= p229))))))) OR G ((((p380 <= 0)) OR ((1 <= p822))))))) AND ((1 <= p380))) AND ((p822 <= 0))) : (F ((NOT(G (X ((((p47 <= 0)) OR ((1 <= p15)))))) AND NOT(X ((((p47 <= 0)) OR ((1 <= p15))))))) AND G (F (G ((((p335 <= 0)) OR ((1 <= p737))))))) : F (((1 <= p736))) : (X ((X ((((((1 <= p507)) AND ((p640 <= 0))) U (((p345 <= 0)) OR ((1 <= p387)))) AND ((1 <= p630)))) AND (((1 <= p594)) U F ((((p345 <= 0)) OR ((1 <= p387))))))) OR ((1 <= p594))) : ((X (X ((((p469 <= 0)) OR ((1 <= p293)) OR (((1 <= p245)) AND ((p470 <= 0)))))) AND G ((G ((((p154 <= 0)) OR ((1 <= p228)))) AND X ((((p469 <= 0)) OR ((1 <= p293))))))) AND (((p469 <= 0)) OR ((1 <= p293))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:332
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((p92 <= 0))) AND ((1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((p92 <= 0))) AND ((1 <= p92)))))
lola: processed formula length: 43
lola: 34 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F (((((p886 <= 0)) OR ((1 <= p487)) OR ((1 <= p754)))))) OR (((p301 <= 0)) OR ((1 <= p848))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F (((((p886 <= 0)) OR ((1 <= p487)) OR ((1 <= p754)))))) OR (((p301 <= 0)) OR ((1 <= p848))))))
lola: processed formula length: 107
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3050 markings, 34230 edges
lola: ========================================
lola: subprocess 2 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p150)) AND ((p154 <= 0)))) AND F ((((p157 <= 0)) OR ((1 <= p471))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p150)) AND ((p154 <= 0)))) AND F ((((p157 <= 0)) OR ((1 <= p471))))))
lola: processed formula length: 85
lola: 34 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F ((((1 <= p47)) AND ((p15 <= 0)))) AND (((1 <= p47)) AND ((p15 <= 0)))))) AND F (G ((((p335 <= 0)) OR ((1 <= p737))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p335 <= 0)) OR ((1 <= p737)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p335 <= 0)) OR ((1 <= p737)))))
lola: processed formula length: 41
lola: 34 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 876
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: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((((((1 <= p507)) AND ((p640 <= 0))) U (((p345 <= 0)) OR ((1 <= p387)))) AND ((1 <= p630)))) AND F ((((p345 <= 0)) OR ((1 <= p387)))))) OR ((1 <= p594)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p594))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p594))
lola: processed formula length: 13
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((((1 <= p507)) AND ((p640 <= 0))) U (((p345 <= 0)) OR ((1 <= p387)))) AND ((1 <= p630)))) AND F ((((p345 <= 0)) OR ((1 <= p387))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((((1 <= p507)) AND ((p640 <= 0))) U (((p345 <= 0)) OR ((1 <= p387)))) AND ((1 <= p630)))) AND F ((((p345 <= 0)) OR ((1 <= p387))))))
lola: processed formula length: 143
lola: 34 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((p469 <= 0)) OR ((1 <= p293)) OR (((1 <= p245)) AND ((p470 <= 0)))))) AND (G ((G ((((p154 <= 0)) OR ((1 <= p228)))) AND X ((((p469 <= 0)) OR ((1 <= p293)))))) AND (((p469 <= 0)) OR ((1 <= p293)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p469 <= 0)) OR ((1 <= p293)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p469 <= 0)) OR ((1 <= p293)))
lola: processed formula length: 33
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p154 <= 0)) OR ((1 <= p228)))) AND X ((((p469 <= 0)) OR ((1 <= p293))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p154 <= 0)) OR ((1 <= p228)))) AND X ((((p469 <= 0)) OR ((1 <= p293))))))
lola: processed formula length: 85
lola: 34 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: 1309 markings, 10801 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p736)))
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: ((p736 <= 0))
lola: processed formula length: 13
lola: 36 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (G ((((p237 <= 0)) OR ((1 <= p229))))) AND F ((((1 <= p380)) AND ((p822 <= 0)))))) AND (((1 <= p380)) AND ((p822 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p380)) AND ((p822 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p380)) AND ((p822 <= 0)))
lola: processed formula length: 33
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((F (G ((((p237 <= 0)) OR ((1 <= p229))))) AND F ((((1 <= p380)) AND ((p822 <= 0)))))) AND (((1 <= p380)) AND ((p822 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p380)) AND ((p822 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p380)) AND ((p822 <= 0)))
lola: processed formula length: 33
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (G ((((p237 <= 0)) OR ((1 <= p229))))) AND F ((((1 <= p380)) AND ((p822 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((((p237 <= 0)) OR ((1 <= p229))))) AND F ((((1 <= p380)) AND ((p822 <= 0))))))
lola: processed formula length: 89
lola: 34 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: 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: 288 markings, 572 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no yes no no no no no no
lola:
preliminary result: no yes no no no no no no
lola: ========================================
lola: memory consumption: 47840 KB
lola: time consumption: 19 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="RwMutex-PT-r0010w0500"
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 RwMutex-PT-r0010w0500, 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 r208-smll-162089471000073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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