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

About the Execution of 2020-gold for IOTPpurchase-PT-C01M01P01D01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4309.224 3600000.00 9328.00 260.00 FFFFTTTFTFFTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428300178.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 IOTPpurchase-PT-C01M01P01D01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428300178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 63K 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 IOTPpurchase-PT-C01M01P01D01-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-15

=== Now, execution of the tool begins

BK_START 1620916504953

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 14:35:06] [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-13 14:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:35:07] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-13 14:35:07] [INFO ] Transformed 111 places.
[2021-05-13 14:35:07] [INFO ] Transformed 45 transitions.
[2021-05-13 14:35:07] [INFO ] Found NUPN structural information;
[2021-05-13 14:35:07] [INFO ] Parsed PT model containing 111 places and 45 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 253 ms. (steps per millisecond=395 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 45 rows 111 cols
[2021-05-13 14:35:07] [INFO ] Computed 67 place invariants in 12 ms
[2021-05-13 14:35:07] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-13 14:35:07] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 14:35:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 14:35:07] [INFO ] Flatten gal took : 40 ms
FORMULA IOTPpurchase-PT-C01M01P01D01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:35:07] [INFO ] Applying decomposition
[2021-05-13 14:35:07] [INFO ] Flatten gal took : 10 ms
[2021-05-13 14:35:07] [INFO ] Decomposing Gal with order
[2021-05-13 14:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 14:35:07] [INFO ] Flatten gal took : 38 ms
[2021-05-13 14:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 14:35:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-13 14:35:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ IOTPpurchase-PT-C01M01P01D01 @ 3570 seconds

FORMULA IOTPpurchase-PT-C01M01P01D01-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C01M01P01D01-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ IOTPpurchase-PT-C01M01P01D01

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 14:35:08 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G (((X (((p62 <= 0) OR (p65 <= 0))) U ((1 <= p62) AND (1 <= p65))) OR (G (((1 <= p15) AND (1 <= p99))) AND ((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))",
"processed_size": 157,
"rewrites": 59
},
"result":
{
"edges": 60,
"markings": 59,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (G (((p37 <= 0) OR (p87 <= 0)))) U ((1 <= p46) AND (1 <= p49)))",
"processed_size": 67,
"rewrites": 59
},
"result":
{
"edges": 70,
"markings": 70,
"produced_by": "LTL model checker",
"value": false
},
"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": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"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 (X (G (((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))",
"processed_size": 58,
"rewrites": 59
},
"result":
{
"edges": 49,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((p10 <= 0) OR (p13 <= 0))))",
"processed_size": 35,
"rewrites": 59
},
"result":
{
"edges": 84,
"markings": 84,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((X (G (((1 <= p107)))) OR ((1 <= p15) AND (1 <= p99))) U (G ((X (((1 <= p45) AND (1 <= p84))) OR (((p45 <= 0)) OR ((p84 <= 0))))) OR F (((1 <= p15) AND (1 <= p99)))))",
"processed_size": 167,
"rewrites": 59
},
"result":
{
"edges": 354,
"markings": 180,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 445
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": "((p2 <= 0))",
"processed_size": 11,
"rewrites": 61
},
"result":
{
"edges": 28,
"markings": 29,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},

{
"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": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))))",
"processed_size": 81,
"rewrites": 59
},
"result":
{
"edges": 74,
"markings": 74,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))))",
"processed_size": 85,
"rewrites": 59
},
"result":
{
"edges": 48,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F ((((p62 <= 0) OR (p65 <= 0)) AND X ((((1 <= p12) AND (1 <= p58) AND (1 <= p103)) OR ((G (((p17 <= 0) OR (p19 <= 0))) AND F (((1 <= p12) AND (1 <= p58) AND (1 <= p103)))) OR ((1 <= p17) AND (1 <= p19)))))))",
"processed_size": 209,
"rewrites": 59
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 1,
"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": 12,
"visible_transitions": 0
},
"processed": "X (X (G (((((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78)) U ((1 <= p2))) OR (F (((1 <= p2))) AND F (G ((((p45 <= 0) OR (p84 <= 0)) AND ((p61 <= 0) OR (p64 <= 0))))))))))",
"processed_size": 226,
"rewrites": 59
},
"result":
{
"edges": 85,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p38 <= 0) OR (p67 <= 0) OR (p95 <= 0))",
"processed_size": 42,
"rewrites": 61
},
"result":
{
"edges": 22,
"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": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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 ((((p4 <= 0)) AND ((p10 <= 0) OR (p13 <= 0))))",
"processed_size": 49,
"rewrites": 59
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": "F ((F (((p15 <= 0) OR (p99 <= 0))) AND ((p4 <= 0))))",
"processed_size": 53,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))",
"processed_size": 109,
"rewrites": 59
},
"result":
{
"edges": 132,
"markings": 89,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((F (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))) OR ((1 <= p69) AND (1 <= p90)))))",
"processed_size": 102,
"rewrites": 59
},
"result":
{
"edges": 129,
"markings": 88,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 49860,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(((X(*) U **) OR (G(**) AND **)))) : (X(G(*)) U **) : X(X(X(G(**)))) : X(G(*)) : ((X(G(**)) OR **) U (G((X(**) OR (** OR **))) OR F(**))) : (X(**) OR (F(**) OR X(**))) : ((* R X(G(*))) OR (G((X(F(**)) OR (** U **))) AND F((* R X(G(*)))))) : F((** AND X((** OR ((G(*) AND F(**)) OR **))))) : X(X(G(((** U **) OR (F(**) AND F(G(*))))))) : (X(G(**)) OR F(**)) : (X(*) AND (F((F(*) AND *)) OR X(G(*)))) : G(F(**)) : G(F((F(**) OR **)))"
},
"net":
{
"arcs": 224,
"conflict_clusters": 44,
"places": 111,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "no no no no yes yes no yes no yes yes yes yes ",
"value": "no no no no yes yes no yes no yes yes yes 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: 156/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3552
lola: finding significant places
lola: 111 places, 45 transitions, 44 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: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 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: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 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: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: F (G ((X ((NOT(X (((1 <= p62) AND (1 <= p65)))) U ((1 <= p62) AND (1 <= p65)))) OR (X (G (((1 <= p15) AND (1 <= p99)))) AND X (((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))) : (G (NOT(X (((1 <= p37) AND (1 <= p87))))) U ((1 <= p46) AND (1 <= p49))) : X (G (X (X (((1 <= p38) AND (1 <= p67) AND (1 <= p95)))))) : G (NOT(X (((1 <= p10) AND (1 <= p13))))) : ((G (X (((1 <= p107)))) OR ((1 <= p15) AND (1 <= p99))) U (G (((X (((1 <= p45) AND (1 <= p84))) OR ((p45 <= 0))) OR ((p84 <= 0)))) OR F (((1 <= p15) AND (1 <= p99))))) : ((X (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))) OR ((((1 <= p97)) U ((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))) U F (((1 <= p2))))) OR X (((1 <= p2)))) : (G ((X (F (((1 <= p3)))) OR (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U ((1 <= p2))))) U NOT((((1 <= p3)) U X (F (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))))))) : F ((((p62 <= 0) OR (p65 <= 0)) AND (X ((NOT(F (((1 <= p17) AND (1 <= p19)))) U ((1 <= p12) AND (1 <= p58) AND (1 <= p103)))) OR X (((1 <= p17) AND (1 <= p19)))))) : G (X (X ((NOT(X (G (X (F ((((1 <= p45) AND (1 <= p84)) OR ((1 <= p61) AND (1 <= p64)))))))) U (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78)) U ((1 <= p2))))))) : (X (G (((1 <= p82)))) OR F (((1 <= p38) AND (1 <= p67) AND (1 <= p95)))) : NOT((G ((G (((1 <= p15) AND (1 <= p99))) OR ((1 <= p4)))) U X ((((1 <= p4)) OR ((1 <= p10) AND (1 <= p13)))))) : F (G (F (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))) : G (X (X (F ((F (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))) OR ((1 <= p69) AND (1 <= p90)))))))
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:528
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (((p62 <= 0) OR (p65 <= 0))) U ((1 <= p62) AND (1 <= p65))) OR (G (((1 <= p15) AND (1 <= p99))) AND ((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (((p62 <= 0) OR (p65 <= 0))) U ((1 <= p62) AND (1 <= p65))) OR (G (((1 <= p15) AND (1 <= p99))) AND ((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))
lola: processed formula length: 157
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 59 markings, 60 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p37 <= 0) OR (p87 <= 0)))) U ((1 <= p46) AND (1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((p37 <= 0) OR (p87 <= 0)))) U ((1 <= p46) AND (1 <= p49)))
lola: processed formula length: 67
lola: 59 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: 70 markings, 70 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((1 <= p38) AND (1 <= p67) AND (1 <= p95))))))
lola: processed formula length: 58
lola: 59 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: 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 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p10 <= 0) OR (p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p10 <= 0) OR (p13 <= 0))))
lola: processed formula length: 35
lola: 59 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: 84 markings, 84 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p107)))) OR ((1 <= p15) AND (1 <= p99))) U (G ((X (((1 <= p45) AND (1 <= p84))) OR (((p45 <= 0)) OR ((p84 <= 0))))) OR F (((1 <= p15) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (G (((1 <= p107)))) OR ((1 <= p15) AND (1 <= p99))) U (G ((X (((1 <= p45) AND (1 <= p84))) OR (((p45 <= 0)) OR ((p84 <= 0))))) OR F (((1 <= p15) AND (1 <= p99)))))
lola: processed formula length: 167
lola: 59 rewrites
lola: closed formula file LTLFireability.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: 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: 180 markings, 354 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))) OR (F (((1 <= p2))) OR X (((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))
lola: processed formula length: 61
lola: 59 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2)))
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: ((p2 <= 0))
lola: processed formula length: 11
lola: 61 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: 29 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))) OR (G ((X (F (((1 <= p3)))) OR (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U ((1 <= p2))))) AND F ((((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))))
lola: processed formula length: 81
lola: 59 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: 74 markings, 74 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p3 <= 0)) R X (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))))
lola: processed formula length: 85
lola: 59 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: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p62 <= 0) OR (p65 <= 0)) AND X ((((1 <= p12) AND (1 <= p58) AND (1 <= p103)) OR ((G (((p17 <= 0) OR (p19 <= 0))) AND F (((1 <= p12) AND (1 <= p58) AND (1 <= p103)))) OR ((1 <= p17) AND (1 <= p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p62 <= 0) OR (p65 <= 0)) AND X ((((1 <= p12) AND (1 <= p58) AND (1 <= p103)) OR ((G (((p17 <= 0) OR (p19 <= 0))) AND F (((1 <= p12) AND (1 <= p58) AND (1 <= p103)))) OR ((1 <= p17) AND (1 <= p19)))))))
lola: processed formula length: 209
lola: 59 rewrites
lola: closed formula file LTLFireability.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: 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78)) U ((1 <= p2))) OR (F (((1 <= p2))) AND F (G ((((p45 <= 0) OR (p84 <= 0)) AND ((p61 <= 0) OR (p64 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78)) U ((1 <= p2))) OR (F (((1 <= p2))) AND F (G ((((p45 <= 0) OR (p84 <= 0)) AND ((p61 <= 0) OR (p64 <= 0))))))))))
lola: processed formula length: 226
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: add low 9
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: 81 markings, 85 edges
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p82)))) OR F (((1 <= p38) AND (1 <= p67) AND (1 <= p95))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p38) AND (1 <= p67) AND (1 <= p95)))
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: ((p38 <= 0) OR (p67 <= 0) OR (p95 <= 0))
lola: processed formula length: 42
lola: 61 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, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p4 <= 0)) AND ((p10 <= 0) OR (p13 <= 0)))) AND (F ((F (((p15 <= 0) OR (p99 <= 0))) AND ((p4 <= 0)))) OR X (G ((((p4 <= 0)) AND ((p10 <= 0) OR (p13 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p4 <= 0)) AND ((p10 <= 0) OR (p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p4 <= 0)) AND ((p10 <= 0) OR (p13 <= 0))))
lola: processed formula length: 49
lola: 59 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p15 <= 0) OR (p99 <= 0))) AND ((p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p15 <= 0) OR (p99 <= 0))) AND ((p4 <= 0))))
lola: processed formula length: 53
lola: 59 rewrites
lola: closed formula file LTLFireability.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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))
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 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))
lola: processed formula length: 109
lola: 59 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 89 markings, 132 edges
lola: ========================================
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))) OR ((1 <= p69) AND (1 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))) OR ((1 <= p69) AND (1 <= p90)))))
lola: processed formula length: 102
lola: 59 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 88 markings, 129 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes no yes yes yes yes
lola:
preliminary result: no no no no yes yes no yes no yes yes yes yes
lola: memory consumption: 49860 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="IOTPpurchase-PT-C01M01P01D01"
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 IOTPpurchase-PT-C01M01P01D01, 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 r132-tall-162075428300178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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