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.r075-tall-162039097000009.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 DES-PT-01a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097000009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K 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 DES-PT-01a-00
FORMULA_NAME DES-PT-01a-01
FORMULA_NAME DES-PT-01a-02
FORMULA_NAME DES-PT-01a-03
FORMULA_NAME DES-PT-01a-04
FORMULA_NAME DES-PT-01a-05
FORMULA_NAME DES-PT-01a-06
FORMULA_NAME DES-PT-01a-07
FORMULA_NAME DES-PT-01a-08
FORMULA_NAME DES-PT-01a-09
FORMULA_NAME DES-PT-01a-10
FORMULA_NAME DES-PT-01a-11
FORMULA_NAME DES-PT-01a-12
FORMULA_NAME DES-PT-01a-13
FORMULA_NAME DES-PT-01a-14
FORMULA_NAME DES-PT-01a-15

=== Now, execution of the tool begins

BK_START 1620498833041

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 18:33:54] [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-08 18:33:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 18:33:54] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-08 18:33:54] [INFO ] Transformed 119 places.
[2021-05-08 18:33:54] [INFO ] Transformed 76 transitions.
[2021-05-08 18:33:54] [INFO ] Found NUPN structural information;
[2021-05-08 18:33:54] [INFO ] Parsed PT model containing 119 places and 76 transitions in 87 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3991 resets, run finished after 350 ms. (steps per millisecond=285 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 62 rows 119 cols
[2021-05-08 18:33:55] [INFO ] Computed 59 place invariants in 7 ms
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2021-05-08 18:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-08 18:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned unsat
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2021-05-08 18:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-08 18:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned unsat
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 7 ms returned sat
[2021-05-08 18:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 18:33:55] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 18:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 18:33:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-08 18:33:55] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-08 18:33:55] [INFO ] Flatten gal took : 36 ms
FORMULA DES-PT-01a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 18:33:55] [INFO ] Applying decomposition
[2021-05-08 18:33:55] [INFO ] Flatten gal took : 11 ms
[2021-05-08 18:33:55] [INFO ] Decomposing Gal with order
[2021-05-08 18:33:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 18:33:55] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-08 18:33:55] [INFO ] Flatten gal took : 40 ms
[2021-05-08 18:33:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2021-05-08 18:33:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-08 18:33:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DES-PT-01a @ 3570 seconds

FORMULA DES-PT-01a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3385
rslt: Output for LTLCardinality @ DES-PT-01a

{
"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": "Sat May 8 18:33:56 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((X ((((p23 <= 0)) OR ((1 <= p11)))) AND (((p23 <= 0)) OR ((1 <= p11)))) U G ((((p1 <= 0)) OR ((1 <= p92))))) AND G ((((p23 <= 0)) OR ((1 <= p11))))))",
"processed_size": 158,
"rewrites": 54
},
"result":
{
"edges": 186659634,
"markings": 21148594,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 423
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 423
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 5,
"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 (((1 <= p54))) OR (((p6 <= 0)) OR ((1 <= p71)))) U (((p43 <= 0)) OR ((1 <= p60))))",
"processed_size": 87,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 483
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p54) AND (((p27 <= 0)) OR ((1 <= p87)))))))",
"processed_size": 60,
"rewrites": 54
},
"result":
{
"edges": 4393,
"markings": 1257,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 483
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (F (((p5 <= 0)))) OR (((1 <= p0)) AND ((p55 <= 0)))))",
"processed_size": 59,
"rewrites": 54
},
"result":
{
"edges": 138,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((G ((((1 <= p62)) AND ((p53 <= 0)))) AND (X ((((p50 <= 0)) OR ((1 <= p44)))) OR (((p48 <= 0)) OR ((1 <= p50)))))))",
"processed_size": 121,
"rewrites": 54
},
"result":
{
"edges": 20332,
"markings": 5267,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"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": 677
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (X ((((p91 <= 0)) OR ((1 <= p88))))) AND F (((p60 <= 0))))))",
"processed_size": 70,
"rewrites": 54
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 846
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F (((1 <= p87))))",
"processed_size": 20,
"rewrites": 54
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1128
},
"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 ((((p98 <= 0)) OR ((1 <= p7)))))",
"processed_size": 38,
"rewrites": 54
},
"result":
{
"edges": 18146,
"markings": 4880,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 ((((p72 <= 0)) OR ((1 <= p17))))",
"processed_size": 35,
"rewrites": 54
},
"result":
{
"edges": 137,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"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 ((F (G ((((p6 <= 0)) OR ((1 <= p62))))) AND (((p64 <= 0)) OR ((1 <= p94)))))",
"processed_size": 80,
"rewrites": 54
},
"result":
{
"edges": 11421,
"markings": 2636,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 31456,
"runtime": 185.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((((X(**) AND **) U G(**)) AND G(**))) : (((X(**) OR (** OR **)) U **) AND X(X(G(**)))) : G((X(F(*)) OR **)) : X(G((G(*) AND (X(**) OR (** OR **))))) : X(F((X(X(*)) AND F(*)))) : F(G(**)) : G(*) : G((F(G(**)) AND **)) : G(F(**))"
},
"net":
{
"arcs": 317,
"conflict_clusters": 46,
"places": 119,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no no no no no no no no no ",
"value": "no 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: 181/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 119
lola: finding significant places
lola: 119 places, 62 transitions, 60 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: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: X ((((X ((((p23 <= 0)) OR ((1 <= p11)))) AND (((p23 <= 0)) OR ((1 <= p11)))) U G ((((p1 <= 0)) OR ((1 <= p92))))) AND G (((1 <= 0) U (((p23 <= 0)) OR ((1 <= p11))))))) : ((((X (((1 <= p54))) OR ((p6 <= 0))) OR ((1 <= p71))) U (((p43 <= 0)) OR ((1 <= p60)))) AND G (X (X (((1 <= p54) AND (((p27 <= 0)) OR ((1 <= p87)))))))) : G ((F ((G (((1 <= p113))) U (1 <= 0))) U G ((F (NOT(X (((1 <= p5))))) OR (((1 <= p0)) AND ((p55 <= 0))))))) : X (G ((NOT(F ((((p62 <= 0)) OR ((1 <= p53))))) AND ((X ((((p50 <= 0)) OR ((1 <= p44)))) OR ((p48 <= 0))) OR ((1 <= p50)))))) : X (NOT(G ((X (X ((((1 <= p91)) AND ((p88 <= 0))))) OR G (((1 <= p60))))))) : G (F (G (X ((((p98 <= 0)) OR ((1 <= p7))))))) : NOT(F ((((1 <= p72)) AND ((p17 <= 0))))) : G ((NOT(F (G (NOT(X (G ((((p6 <= 0)) OR ((1 <= p62))))))))) AND (((p64 <= 0)) OR ((1 <= p94))))) : NOT(G (NOT(X (X (F (G (((0 <= 0) U F (((1 <= p87)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((X ((((p23 <= 0)) OR ((1 <= p11)))) AND (((p23 <= 0)) OR ((1 <= p11)))) U G ((((p1 <= 0)) OR ((1 <= p92))))) AND G ((((p23 <= 0)) OR ((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((X ((((p23 <= 0)) OR ((1 <= p11)))) AND (((p23 <= 0)) OR ((1 <= p11)))) U G ((((p1 <= 0)) OR ((1 <= p92))))) AND G ((((p23 <= 0)) OR ((1 <= p11))))))
lola: processed formula length: 158
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 721957 markings, 5471806 edges, 144391 markings/sec, 0 secs
lola: 1417165 markings, 10834937 edges, 139042 markings/sec, 5 secs
lola: 2067685 markings, 16076865 edges, 130104 markings/sec, 10 secs
lola: 2670449 markings, 21331476 edges, 120553 markings/sec, 15 secs
lola: 3275772 markings, 26609248 edges, 121065 markings/sec, 20 secs
lola: 3855884 markings, 31709677 edges, 116022 markings/sec, 25 secs
lola: 4496778 markings, 37040112 edges, 128179 markings/sec, 30 secs
lola: 5135012 markings, 42221594 edges, 127647 markings/sec, 35 secs
lola: 5730500 markings, 47439973 edges, 119098 markings/sec, 40 secs
lola: 6298501 markings, 52469469 edges, 113600 markings/sec, 45 secs
lola: 6879368 markings, 57646062 edges, 116173 markings/sec, 50 secs
lola: 7506165 markings, 62883320 edges, 125359 markings/sec, 55 secs
lola: 8134289 markings, 67963593 edges, 125625 markings/sec, 60 secs
lola: 8727886 markings, 73150748 edges, 118719 markings/sec, 65 secs
lola: 9293207 markings, 78131374 edges, 113064 markings/sec, 70 secs
lola: 9856572 markings, 83261817 edges, 112673 markings/sec, 75 secs
lola: 10410623 markings, 88476934 edges, 110810 markings/sec, 80 secs
lola: 10967252 markings, 93473404 edges, 111326 markings/sec, 85 secs
lola: 11521861 markings, 98639328 edges, 110922 markings/sec, 90 secs
lola: 12030529 markings, 103676826 edges, 101734 markings/sec, 95 secs
lola: 12516489 markings, 108607949 edges, 97192 markings/sec, 100 secs
lola: 13061327 markings, 113740245 edges, 108968 markings/sec, 105 secs
lola: 13627288 markings, 118959305 edges, 113192 markings/sec, 110 secs
lola: 14201284 markings, 123961894 edges, 114799 markings/sec, 115 secs
lola: 14771257 markings, 129096558 edges, 113995 markings/sec, 120 secs
lola: 15346062 markings, 134255118 edges, 114961 markings/sec, 125 secs
lola: 15845131 markings, 139451394 edges, 99814 markings/sec, 130 secs
lola: 16372637 markings, 144555012 edges, 105501 markings/sec, 135 secs
lola: 16858153 markings, 149390842 edges, 97103 markings/sec, 140 secs
lola: 17358442 markings, 154481451 edges, 100058 markings/sec, 145 secs
lola: 17869282 markings, 159622258 edges, 102168 markings/sec, 150 secs
lola: 18460721 markings, 164789231 edges, 118288 markings/sec, 155 secs
lola: 19110515 markings, 169788170 edges, 129959 markings/sec, 160 secs
lola: 19773700 markings, 174895113 edges, 132637 markings/sec, 165 secs
lola: 20358185 markings, 179858666 edges, 116897 markings/sec, 170 secs
lola: 20935328 markings, 184756016 edges, 115429 markings/sec, 175 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21148594 markings, 186659634 edges
lola: ========================================
lola: subprocess 1 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (((1 <= p54))) OR (((p6 <= 0)) OR ((1 <= p71)))) U (((p43 <= 0)) OR ((1 <= p60)))) AND X (X (G (((1 <= p54) AND (((p27 <= 0)) OR ((1 <= p87))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p54))) OR (((p6 <= 0)) OR ((1 <= p71)))) U (((p43 <= 0)) OR ((1 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((1 <= p54))) OR (((p6 <= 0)) OR ((1 <= p71)))) U (((p43 <= 0)) OR ((1 <= p60))))
lola: processed formula length: 87
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p54) AND (((p27 <= 0)) OR ((1 <= p87)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p54) AND (((p27 <= 0)) OR ((1 <= p87)))))))
lola: processed formula length: 60
lola: 54 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: 1257 markings, 4393 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((p5 <= 0)))) OR (((1 <= p0)) AND ((p55 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((p5 <= 0)))) OR (((1 <= p0)) AND ((p55 <= 0)))))
lola: processed formula length: 59
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 105 markings, 138 edges
lola: ========================================
lola: subprocess 3 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((((1 <= p62)) AND ((p53 <= 0)))) AND (X ((((p50 <= 0)) OR ((1 <= p44)))) OR (((p48 <= 0)) OR ((1 <= p50)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((((1 <= p62)) AND ((p53 <= 0)))) AND (X ((((p50 <= 0)) OR ((1 <= p44)))) OR (((p48 <= 0)) OR ((1 <= p50)))))))
lola: processed formula length: 121
lola: 54 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: 5267 markings, 20332 edges
lola: ========================================
lola: subprocess 4 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X ((((p91 <= 0)) OR ((1 <= p88))))) AND F (((p60 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X ((((p91 <= 0)) OR ((1 <= p88))))) AND F (((p60 <= 0))))))
lola: processed formula length: 70
lola: 54 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 5 will run for 846 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p87))))
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 (((1 <= p87))))
lola: processed formula length: 20
lola: 54 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 1128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p98 <= 0)) OR ((1 <= p7)))))
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 ((((p98 <= 0)) OR ((1 <= p7)))))
lola: processed formula length: 38
lola: 54 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 7
lola: add low 54
lola: add low 19
lola: add low 2
lola: add low 43
lola: add low 44
lola: add low 42
lola: add low 45
lola: add low 41
lola: add low 46
lola: add low 40
lola: add low 47
lola: add low 39
lola: add low 48
lola: add low 38
lola: add low 49
lola: add low 37
lola: add low 50
lola: add low 36
lola: add low 1
lola: add low 51
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: 4880 markings, 18146 edges
lola: ========================================
lola: subprocess 7 will run for 1692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p72 <= 0)) OR ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p72 <= 0)) OR ((1 <= p17))))
lola: processed formula length: 35
lola: 54 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: 127 markings, 137 edges
lola: ========================================
lola: subprocess 8 will run for 3385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((((p6 <= 0)) OR ((1 <= p62))))) AND (((p64 <= 0)) OR ((1 <= p94)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((((p6 <= 0)) OR ((1 <= p62))))) AND (((p64 <= 0)) OR ((1 <= p94)))))
lola: processed formula length: 80
lola: 54 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: 2636 markings, 11421 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no
lola:
preliminary result: no no no no no no no no no
lola: memory consumption: 31456 KB
lola: time consumption: 185 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="DES-PT-01a"
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 DES-PT-01a, 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 r075-tall-162039097000009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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