About the Execution of ITS-LoLa for RwMutex-PT-r0010w0050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15745.360 | 3600000.00 | 10551.00 | 77.80 | FFFFFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r186-oct2-158987938700258.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is RwMutex-PT-r0010w0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.9K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 12:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 9 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 88K Mar 24 05:38 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RwMutex-PT-r0010w0050-00
FORMULA_NAME RwMutex-PT-r0010w0050-01
FORMULA_NAME RwMutex-PT-r0010w0050-02
FORMULA_NAME RwMutex-PT-r0010w0050-03
FORMULA_NAME RwMutex-PT-r0010w0050-04
FORMULA_NAME RwMutex-PT-r0010w0050-05
FORMULA_NAME RwMutex-PT-r0010w0050-06
FORMULA_NAME RwMutex-PT-r0010w0050-07
FORMULA_NAME RwMutex-PT-r0010w0050-08
FORMULA_NAME RwMutex-PT-r0010w0050-09
FORMULA_NAME RwMutex-PT-r0010w0050-10
FORMULA_NAME RwMutex-PT-r0010w0050-11
FORMULA_NAME RwMutex-PT-r0010w0050-12
FORMULA_NAME RwMutex-PT-r0010w0050-13
FORMULA_NAME RwMutex-PT-r0010w0050-14
FORMULA_NAME RwMutex-PT-r0010w0050-15
=== Now, execution of the tool begins
BK_START 1591232772173
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:06:14] [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]
[2020-06-04 01:06:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:06:14] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-06-04 01:06:14] [INFO ] Transformed 130 places.
[2020-06-04 01:06:14] [INFO ] Transformed 120 transitions.
[2020-06-04 01:06:14] [INFO ] Parsed PT model containing 130 places and 120 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 464 ms. (steps per millisecond=215 ) 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, 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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 120 rows 130 cols
[2020-06-04 01:06:14] [INFO ] Computed 70 place invariants in 9 ms
[2020-06-04 01:06:14] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned unsat
[2020-06-04 01:06:14] [INFO ] [Real]Absence check using 70 positive place invariants in 15 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 01:06:14] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 01:06:15] [INFO ] Flatten gal took : 49 ms
FORMULA RwMutex-PT-r0010w0050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:06:15] [INFO ] Flatten gal took : 20 ms
[2020-06-04 01:06:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 01:06:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0010w0050 @ 3570 seconds
FORMULA RwMutex-PT-r0010w0050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r0010w0050-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ RwMutex-PT-r0010w0050
{
"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": "Thu Jun 4 01:06:15 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p7))",
"processed_size": 13,
"rewrites": 124
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((F (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND ((1 <= p7) OR ((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))) AND (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p7)))))",
"processed_size": 579,
"rewrites": 124
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G (F ((X (G (((1 <= p125) OR (G (((1 <= p84) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND F ((1 <= p125)))))) OR ((1 <= p79) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))",
"processed_size": 409,
"rewrites": 124
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "F (G ((((p85 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) OR (X (((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND (G ((1 <= p2)) OR ((1 <= p12) AND (1 <= p110)))))))",
"processed_size": 416,
"rewrites": 124
},
"result":
{
"edges": 32,
"markings": 18,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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 ((X (G (((p19 <= 0) OR (1 <= p16)))) OR (1 <= p32)))",
"processed_size": 55,
"rewrites": 124
},
"result":
{
"edges": 10227,
"markings": 1048,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 26,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X ((F (((F (((1 <= p97) AND (1 <= p105))) U ((1 <= p57) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) OR ((p97 <= 0) OR (p105 <= 0)))) OR ((1 <= p78) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))",
"processed_size": 428,
"rewrites": 124
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3,
"G": 2,
"U": 0,
"X": 5,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 55,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (F (((G (((p56 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))) R X (X (((p77 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))))) AND ((F (((p68 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))) OR X (X (G (((p77 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)))))) AND F (((p68 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)))))))",
"processed_size": 925,
"rewrites": 124
},
"result":
{
"edges": 60,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 106
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p12) AND (1 <= p110))",
"processed_size": 28,
"rewrites": 126
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 102
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((p59 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))",
"processed_size": 172,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((1 <= p59) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))",
"processed_size": 172,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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 (((p12 <= 0) OR (p110 <= 0)))",
"processed_size": 32,
"rewrites": 124
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 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": 10,
"rewrites": 126
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p20)))",
"processed_size": 18,
"rewrites": 124
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p76) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))",
"processed_size": 180,
"rewrites": 124
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 71408,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((F(G((F(**) AND (** OR **)))) AND (** U **)))) OR (G(**) AND X(F((F(G((F(**) AND (** OR **)))) AND (** U **)))))) : G(F(**)) : G(F((X(G((** OR (G(**) AND F(**))))) OR **))) : F(G((** OR (X(**) AND (G(**) OR **))))) : F(G(**)) : X((X(G(**)) OR **)) : X((F(((F(**) U **) OR (** OR **))) OR **)) : X(F(((G(*) R X(X(*))) AND ((F(*) OR X(X(G(*)))) AND F(*))))) : ((** OR (X(G(*)) AND **)) AND (X(*) OR F(*))) : F(**)"
},
"net":
{
"arcs": 1260,
"conflict_clusters": 61,
"places": 130,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 120
},
"result":
{
"preliminary_value": "no no no no no no no no no no ",
"value": "no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 250/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 130
lola: finding significant places
lola: 130 places, 120 transitions, 60 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: (G ((1 <= p7)) U F (X ((G (F (G (((1 <= p7) U ((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))) AND (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p7)))))) : ((1 <= 0) U (NOT(((1 <= p20) U ((1 <= p85) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) U G (F ((1 <= p20))))) : G (F ((G (X (NOT(F (NOT((G (((1 <= p84) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) U (1 <= p125))))))) OR ((1 <= p79) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))) : X (F (G ((((p85 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) OR (X (((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND (G ((1 <= p2)) OR ((1 <= p12) AND (1 <= p110)))))))) : F (X (((((((((((((F (((1 <= p107) AND (1 <= p119))) AND (1 <= p47)) AND (1 <= p100)) AND (1 <= p101)) AND (1 <= p102)) AND (1 <= p103)) AND (1 <= p104)) AND (1 <= p105)) AND (1 <= p106)) AND (1 <= p107)) AND (1 <= p109)) AND (1 <= p110)) U X ((((1 <= p87) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U G (((1 <= p76) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))))) : X ((G (X (((p19 <= 0) OR (1 <= p16)))) OR (1 <= p32))) : X ((F ((((F (((1 <= p97) AND (1 <= p105))) U ((1 <= p57) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) OR (p97 <= 0)) OR (p105 <= 0))) OR ((1 <= p78) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) : X (F ((NOT((G (((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) U (F (((1 <= p56) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) U X (X (((1 <= p77) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))))) AND NOT(G (((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))))) : ((((1 <= p59) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR (NOT(F (X ((1 <= p92)))) AND ((p59 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)))) AND (NOT(X (((1 <= p12) AND (1 <= p110)))) OR NOT(G (((1 <= p12) AND (1 <= p110)))))) : F ((1 <= p18))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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 ((F (G ((F (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND ((1 <= p7) OR ((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))) AND (((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p7))
lola: processed formula length: 13
lola: 124 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((F (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND ((1 <= p7) OR ((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))) AND (((1 <= p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((F (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND ((1 <= p7) OR ((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))) AND (((1 <= p6... (shortened)
lola: processed formula length: 579
lola: 124 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: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G (((1 <= p125) OR (G (((1 <= p84) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND F ((1 <= p125)))))) OR ((1 <= p79) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G (((1 <= p125) OR (G (((1 <= p84) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND F ((1 <= p125)))))) OR ((1 <= p79) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= ... (shortened)
lola: processed formula length: 409
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p85 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) OR (X (((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND (G ((1 <= p2)) OR ((1 <= p12) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p85 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) OR (X (((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND (G ((1 <= p2)) OR ((1 <= p12) AND (... (shortened)
lola: processed formula length: 416
lola: 124 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: 18 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p19 <= 0) OR (1 <= p16)))) OR (1 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p19 <= 0) OR (1 <= p16)))) OR (1 <= p32)))
lola: processed formula length: 55
lola: 124 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: 1048 markings, 10227 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((F (((1 <= p97) AND (1 <= p105))) U ((1 <= p57) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) OR ((p97 <= 0) OR (p105 <= 0)))) OR ((1 <= p78) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((F (((1 <= p97) AND (1 <= p105))) U ((1 <= p57) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) OR ((p97 <= 0) OR (p105 <= 0)))) OR ((1 <= p78) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1... (shortened)
lola: processed formula length: 428
lola: 124 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((G (((p56 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))) R X (X (((p77 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))))) AND ((F (((p68 <= 0) OR (p100 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((G (((p56 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))) R X (X (((p77 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))))) AND ((F (((p68 <= 0) OR (p100 ... (shortened)
lola: processed formula length: 925
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 106 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: 52 markings, 60 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p59) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR (X (G ((p92 <= 0))) AND ((p59 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)))) AND (X (((p12 <= 0) OR ... (shortened)
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: F (((p12 <= 0) OR (p110 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p12) AND (1 <= p110))
lola: processed formula length: 28
lola: 126 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p59 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p59 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))
lola: processed formula length: 172
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 11 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p59) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p59) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))
lola: processed formula length: 172
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 11 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p12 <= 0) OR (p110 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p12 <= 0) OR (p110 <= 0)))
lola: processed formula length: 32
lola: 124 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: 5 markings, 5 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: 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: 10
lola: 126 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p20)))
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 <= p20)))
lola: processed formula length: 18
lola: 124 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p76) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p76) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))
lola: processed formula length: 180
lola: 124 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: add low 109
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no
lola: memory consumption: 71408 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="RwMutex-PT-r0010w0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is RwMutex-PT-r0010w0050, 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 r186-oct2-158987938700258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w0050.tgz
mv RwMutex-PT-r0010w0050 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 '
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 ;