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.r246-smll-162106594100006.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 ShieldRVs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594100006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 9.9K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K 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.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 13K May 5 16:52 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 ShieldRVs-PT-001B-00
FORMULA_NAME ShieldRVs-PT-001B-01
FORMULA_NAME ShieldRVs-PT-001B-02
FORMULA_NAME ShieldRVs-PT-001B-03
FORMULA_NAME ShieldRVs-PT-001B-04
FORMULA_NAME ShieldRVs-PT-001B-05
FORMULA_NAME ShieldRVs-PT-001B-06
FORMULA_NAME ShieldRVs-PT-001B-07
FORMULA_NAME ShieldRVs-PT-001B-08
FORMULA_NAME ShieldRVs-PT-001B-09
FORMULA_NAME ShieldRVs-PT-001B-10
FORMULA_NAME ShieldRVs-PT-001B-11
FORMULA_NAME ShieldRVs-PT-001B-12
FORMULA_NAME ShieldRVs-PT-001B-13
FORMULA_NAME ShieldRVs-PT-001B-14
FORMULA_NAME ShieldRVs-PT-001B-15

=== Now, execution of the tool begins

BK_START 1621273870093

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 17:51:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-17 17:51:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 17:51:13] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-17 17:51:13] [INFO ] Transformed 43 places.
[2021-05-17 17:51:13] [INFO ] Transformed 48 transitions.
[2021-05-17 17:51:13] [INFO ] Found NUPN structural information;
[2021-05-17 17:51:13] [INFO ] Parsed PT model containing 43 places and 48 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 225 resets, run finished after 166 ms. (steps per millisecond=602 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 48 rows 43 cols
[2021-05-17 17:51:13] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-17 17:51:14] [INFO ] [Real]Absence check using 5 positive place invariants in 32 ms returned sat
[2021-05-17 17:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 17:51:14] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 14 places in 175 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 10 places in 57 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 11 places in 50 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 17 places in 62 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 12 places in 40 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 17 places in 39 ms
[2021-05-17 17:51:14] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2021-05-17 17:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 632 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-17 17:51:15] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-17 17:51:15] [INFO ] Flatten gal took : 69 ms
FORMULA ShieldRVs-PT-001B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 17:51:15] [INFO ] Applying decomposition
[2021-05-17 17:51:15] [INFO ] Flatten gal took : 19 ms
[2021-05-17 17:51:15] [INFO ] Decomposing Gal with order
[2021-05-17 17:51:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:51:15] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-17 17:51:15] [INFO ] Flatten gal took : 107 ms
[2021-05-17 17:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2021-05-17 17:51:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-17 17:51:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVs-PT-001B @ 3570 seconds

FORMULA ShieldRVs-PT-001B-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-001B-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ ShieldRVs-PT-001B

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 17:51:17 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p13))) OR (G (((1 <= p35))) OR (F (((1 <= p31))) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p39)))))))",
"processed_size": 115,
"rewrites": 61
},
"result":
{
"edges": 924,
"markings": 233,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 4,
"X": 2,
"aconj": 7,
"adisj": 0,
"aneg": 1,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((((1 <= p3) AND (1 <= p15) AND (1 <= p40)) U (((1 <= p14) AND (1 <= p20) AND (1 <= p28)) U ((1 <= p38)))) OR (G (((1 <= p2))) AND F (((1 <= p38))))) U X ((X (((p38 <= 0))) U ((1 <= p3) AND (1 <= p15) AND (1 <= p40)))))",
"processed_size": 220,
"rewrites": 61
},
"result":
{
"edges": 98,
"markings": 97,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"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": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((X ((X ((((p2 <= 0)) AND ((p25 <= 0)))) R ((p17 <= 0)))) AND ((p17 <= 0))))))",
"processed_size": 86,
"rewrites": 61
},
"result":
{
"edges": 60,
"markings": 60,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": "((p22 <= 0))",
"processed_size": 12,
"rewrites": 63
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((X (((1 <= p3) AND (1 <= p12) AND (1 <= p39))) AND F (((1 <= p15) AND (1 <= p20) AND (1 <= p29)))))",
"processed_size": 102,
"rewrites": 61
},
"result":
{
"edges": 48,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (G ((F (((p14 <= 0) OR (p20 <= 0) OR (p29 <= 0))) OR G ((X (G (((p26 <= 0) OR (p37 <= 0)))) OR (((1 <= p29) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p24))))))))",
"processed_size": 164,
"rewrites": 61
},
"result":
{
"edges": 11614,
"markings": 3720,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((((p35 <= 0)) AND ((p28 <= 0))) R ((p36 <= 0))) OR ((p13 <= 0))))",
"processed_size": 70,
"rewrites": 61
},
"result":
{
"edges": 111,
"markings": 109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "X (G ((X (((p32 <= 0))) OR G (((p29 <= 0) OR (p37 <= 0))))))",
"processed_size": 61,
"rewrites": 61
},
"result":
{
"edges": 49,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": "F (G ((G (F (((1 <= p36)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p40 <= 0)))))",
"processed_size": 76,
"rewrites": 61
},
"result":
{
"edges": 64,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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": "((p18 <= 0))",
"processed_size": 12,
"rewrites": 63
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 38020,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((G(**) OR (G(**) OR (F(**) OR **))))) : (((** U (** U **)) OR (G(**) AND F(**))) U X((X(*) U **))) : X(X(G((X((X(*) R *)) AND *)))) : (F(**) OR X((** OR X(**)))) : F((X(**) AND F(**))) : F(G((G(F(**)) AND *))) : X(G((F(*) OR G((X(G(*)) OR (** OR **)))))) : (X(X(X(G(**)))) AND G(((* R *) OR **))) : X(G((X(*) OR G(*)))) : (G(**) OR F(**))"
},
"net":
{
"arcs": 144,
"conflict_clusters": 31,
"places": 43,
"places_significant": 38,
"singleton_clusters": 0,
"transitions": 48
},
"result":
{
"preliminary_value": "yes no no yes no no yes no no yes ",
"value": "yes no no yes no no yes no no yes "
},
"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: 91/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 43
lola: finding significant places
lola: 43 places, 48 transitions, 38 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: F (X (F ((((G (((1 <= p13))) OR G (((1 <= p35)))) OR (((1 <= p35)) U F (((1 <= p31))))) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p39)))))) : ((G (((1 <= p2))) U (((1 <= p3) AND (1 <= p15) AND (1 <= p40)) U (((1 <= p14) AND (1 <= p20) AND (1 <= p28)) U ((1 <= p38))))) U X ((NOT(X (((1 <= p38)))) U ((1 <= p3) AND (1 <= p15) AND (1 <= p40))))) : X (NOT(X (F ((X ((X ((((1 <= p2)) OR ((1 <= p25)))) U ((1 <= p17)))) OR ((1 <= p17))))))) : ((F ((((p30 <= 0)) U ((1 <= p22)))) OR X (((1 <= p14) AND (1 <= p20) AND (1 <= p28)))) OR X (X (((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0))))) : F ((X (((1 <= p3) AND (1 <= p12) AND (1 <= p39))) AND F (((X (((1 <= p36))) U ((1 <= p12))) U ((1 <= p15) AND (1 <= p20) AND (1 <= p29)))))) : F (X (G (NOT(F ((NOT(G (F (X (((1 <= p36)))))) OR ((1 <= p3) AND (1 <= p15) AND (1 <= p40)))))))) : X (G ((NOT(G (((1 <= p14) AND (1 <= p20) AND (1 <= p29)))) OR G (((NOT(F (X (((1 <= p26) AND (1 <= p37))))) OR ((1 <= p29) AND (1 <= p37))) OR ((1 <= p1) AND (1 <= p24))))))) : (X (X (X (G (((1 <= p14) AND (1 <= p20) AND (1 <= p29)))))) AND G ((NOT(((((1 <= p35)) OR ((1 <= p28))) U ((1 <= p36)))) OR ((p13 <= 0))))) : NOT(F (X ((NOT(G (((1 <= p36)))) U F ((X (((1 <= p32))) AND F (((1 <= p29) AND (1 <= p37))))))))) : (G (((1 <= p2))) OR F (((1 <= p18))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p13))) OR (G (((1 <= p35))) OR (F (((1 <= p31))) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p39)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p13))) OR (G (((1 <= p35))) OR (F (((1 <= p31))) OR ((1 <= p3) AND (1 <= p12) AND (1 <= p39)))))))
lola: processed formula length: 115
lola: 61 rewrites
lola: closed formula file LTLFireability.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: 233 markings, 924 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p3) AND (1 <= p15) AND (1 <= p40)) U (((1 <= p14) AND (1 <= p20) AND (1 <= p28)) U ((1 <= p38)))) OR (G (((1 <= p2))) AND F (((1 <= p38))))) U X ((X (((p38 <= 0))) U ((1 <= p3) AND (1 <= p15) AND (1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p3) AND (1 <= p15) AND (1 <= p40)) U (((1 <= p14) AND (1 <= p20) AND (1 <= p28)) U ((1 <= p38)))) OR (G (((1 <= p2))) AND F (((1 <= p38))))) U X ((X (((p38 <= 0))) U ((1 <= p3) AND (1 <= p15) AND (1 <= p40)))))
lola: processed formula length: 220
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 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: 97 markings, 98 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X ((X ((((p2 <= 0)) AND ((p25 <= 0)))) R ((p17 <= 0)))) AND ((p17 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X ((X ((((p2 <= 0)) AND ((p25 <= 0)))) R ((p17 <= 0)))) AND ((p17 <= 0))))))
lola: processed formula length: 86
lola: 61 rewrites
lola: closed formula file LTLFireability.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: 60 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p22))) OR X ((((1 <= p14) AND (1 <= p20) AND (1 <= p28)) OR X (((p14 <= 0) OR (p20 <= 0) OR (p28 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p22)))
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: ((p22 <= 0))
lola: processed formula length: 12
lola: 63 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p3) AND (1 <= p12) AND (1 <= p39))) AND F (((1 <= p15) AND (1 <= p20) AND (1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p3) AND (1 <= p12) AND (1 <= p39))) AND F (((1 <= p15) AND (1 <= p20) AND (1 <= p29)))))
lola: processed formula length: 102
lola: 61 rewrites
lola: closed formula file LTLFireability.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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((p14 <= 0) OR (p20 <= 0) OR (p29 <= 0))) OR G ((X (G (((p26 <= 0) OR (p37 <= 0)))) OR (((1 <= p29) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p24))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((p14 <= 0) OR (p20 <= 0) OR (p29 <= 0))) OR G ((X (G (((p26 <= 0) OR (p37 <= 0)))) OR (((1 <= p29) AND (1 <= p37)) OR ((1 <= p1) AND (1 <= p24))))))))
lola: processed formula length: 164
lola: 61 rewrites
lola: closed formula file LTLFireability.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: ========================================
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: 3720 markings, 11614 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G (((1 <= p14) AND (1 <= p20) AND (1 <= p29)))))) AND G ((((((p35 <= 0)) AND ((p28 <= 0))) R ((p36 <= 0))) OR ((p13 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((((p35 <= 0)) AND ((p28 <= 0))) R ((p36 <= 0))) OR ((p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((((p35 <= 0)) AND ((p28 <= 0))) R ((p36 <= 0))) OR ((p13 <= 0))))
lola: processed formula length: 70
lola: 61 rewrites
lola: closed formula file LTLFireability.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: 109 markings, 111 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p32 <= 0))) OR G (((p29 <= 0) OR (p37 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p32 <= 0))) OR G (((p29 <= 0) OR (p37 <= 0))))))
lola: processed formula length: 61
lola: 61 rewrites
lola: closed formula file LTLFireability.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: 49 markings, 49 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((1 <= p36)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p40 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((1 <= p36)))) AND ((p3 <= 0) OR (p15 <= 0) OR (p40 <= 0)))))
lola: processed formula length: 76
lola: 61 rewrites
lola: closed formula file LTLFireability.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: 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: 63 markings, 64 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p2))) OR F (((1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p18)))
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: ((p18 <= 0))
lola: processed formula length: 12
lola: 63 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 23 markings, 23 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes no no yes
lola:
preliminary result: yes no no yes no no yes no no yes
lola: memory consumption: 38020 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="ShieldRVs-PT-001B"
export BK_EXAMINATION="LTLFireability"
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 ShieldRVs-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-smll-162106594100006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001B.tgz
mv ShieldRVs-PT-001B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;