About the Execution of ITS-LoLa for ParamProductionCell-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.650 | 3600000.00 | 46792.00 | 135.20 | TFFTFFFFFFTTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853300490.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 ParamProductionCell-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300490
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 4.9K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 13 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 13 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 13 14:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 13 14:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 174K Mar 24 05:37 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 ParamProductionCell-PT-3-00
FORMULA_NAME ParamProductionCell-PT-3-01
FORMULA_NAME ParamProductionCell-PT-3-02
FORMULA_NAME ParamProductionCell-PT-3-03
FORMULA_NAME ParamProductionCell-PT-3-04
FORMULA_NAME ParamProductionCell-PT-3-05
FORMULA_NAME ParamProductionCell-PT-3-06
FORMULA_NAME ParamProductionCell-PT-3-07
FORMULA_NAME ParamProductionCell-PT-3-08
FORMULA_NAME ParamProductionCell-PT-3-09
FORMULA_NAME ParamProductionCell-PT-3-10
FORMULA_NAME ParamProductionCell-PT-3-11
FORMULA_NAME ParamProductionCell-PT-3-12
FORMULA_NAME ParamProductionCell-PT-3-13
FORMULA_NAME ParamProductionCell-PT-3-14
FORMULA_NAME ParamProductionCell-PT-3-15
=== Now, execution of the tool begins
BK_START 1591151315594
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:28:38] [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-03 02:28:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:28:39] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2020-06-03 02:28:39] [INFO ] Transformed 231 places.
[2020-06-03 02:28:39] [INFO ] Transformed 202 transitions.
[2020-06-03 02:28:39] [INFO ] Found NUPN structural information;
[2020-06-03 02:28:39] [INFO ] Parsed PT model containing 231 places and 202 transitions in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 254 ms. (steps per millisecond=393 ) properties seen :[1, 0, 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]
// Phase 1: matrix 202 rows 231 cols
[2020-06-03 02:28:39] [INFO ] Computed 59 place invariants in 21 ms
[2020-06-03 02:28:39] [INFO ] [Real]Absence check using 35 positive place invariants in 140 ms returned sat
[2020-06-03 02:28:39] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned unsat
[2020-06-03 02:28:40] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 02:28:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 02:28:40] [INFO ] Flatten gal took : 142 ms
FORMULA ParamProductionCell-PT-3-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:28:40] [INFO ] Applying decomposition
[2020-06-03 02:28:40] [INFO ] Flatten gal took : 35 ms
[2020-06-03 02:28:40] [INFO ] Decomposing Gal with order
[2020-06-03 02:28:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 02:28:40] [INFO ] Removed a total of 137 redundant transitions.
[2020-06-03 02:28:41] [INFO ] Flatten gal took : 159 ms
[2020-06-03 02:28:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 36 ms.
[2020-06-03 02:28:41] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2020-06-03 02:28:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ParamProductionCell-PT-3 @ 3570 seconds
FORMULA ParamProductionCell-PT-3-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-3-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3541
rslt: Output for LTLFireability @ ParamProductionCell-PT-3
{
"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": "Wed Jun 3 02:28:41 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((((1 <= p96) AND (1 <= p126)) OR (G (((1 <= p18) AND (1 <= p22))) AND F (((1 <= p96) AND (1 <= p126)))))))",
"processed_size": 112,
"rewrites": 72
},
"result":
{
"edges": 271,
"markings": 271,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0))) AND F (((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0))))))",
"processed_size": 111,
"rewrites": 72
},
"result":
{
"edges": 11903351,
"markings": 2938198,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p115) AND (1 <= p118))) AND F ((((p162 <= 0) OR ((1 <= p115) AND (1 <= p118)) OR (p172 <= 0)) AND (((1 <= p99) AND (1 <= p128)) U ((1 <= p13) AND (1 <= p87)))))))",
"processed_size": 178,
"rewrites": 72
},
"result":
{
"edges": 271,
"markings": 271,
"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": 295
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G (((1 <= p101) AND (1 <= p160)))))",
"processed_size": 41,
"rewrites": 72
},
"result":
{
"edges": 271,
"markings": 271,
"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": 321
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (F (((1 <= p105) AND (1 <= p134)))) OR ((p9 <= 0) OR (p89 <= 0))))",
"processed_size": 73,
"rewrites": 72
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((p164 <= 0) OR (p171 <= 0))))",
"processed_size": 37,
"rewrites": 72
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 393
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"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": "X (F (((((p1 <= 0) OR (p60 <= 0)) R ((p14 <= 0) OR (p88 <= 0))) OR X (G (((1 <= p93) AND (1 <= p115)))))))",
"processed_size": 108,
"rewrites": 72
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 442
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"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": "((p163 <= 0) OR (p164 <= 0) OR (p191 <= 0))",
"processed_size": 45,
"rewrites": 74
},
"result":
{
"edges": 98,
"markings": 99,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 (((1 <= p101) AND (1 <= p104) AND (1 <= p157)))",
"processed_size": 49,
"rewrites": 72
},
"result":
{
"edges": 271,
"markings": 271,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"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 (((1 <= p96) AND (1 <= p111))) U ((1 <= p119) AND (1 <= p138)))",
"processed_size": 66,
"rewrites": 72
},
"result":
{
"edges": 271,
"markings": 271,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 590
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G (((p101 <= 0) OR (p135 <= 0))))",
"processed_size": 37,
"rewrites": 72
},
"result":
{
"edges": 422,
"markings": 419,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((p99 <= 0) OR (p178 <= 0)) OR ((1 <= p163) AND (1 <= p174)))))",
"processed_size": 71,
"rewrites": 72
},
"result":
{
"edges": 670,
"markings": 664,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p24 <= 0) OR (p28 <= 0)))",
"processed_size": 31,
"rewrites": 72
},
"result":
{
"edges": 422,
"markings": 422,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F (((p44 <= 0) OR (p51 <= 0))) AND (((1 <= p147)) OR ((p44 <= 0) OR (p51 <= 0))))))",
"processed_size": 92,
"rewrites": 72
},
"result":
{
"edges": 173,
"markings": 172,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1770
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p105) AND (1 <= p151)) U (G (F (((1 <= p105) AND (1 <= p151)))) OR ((1 <= p61))))",
"processed_size": 89,
"rewrites": 72
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 3541
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p99) AND (1 <= p128))) OR (F (((1 <= p98) AND (1 <= p183))) OR ((1 <= p98) AND (1 <= p183) AND ((p94 <= 0) OR (p105 <= 0)) AND ((p99 <= 0) OR (p128 <= 0))))))",
"processed_size": 174,
"rewrites": 72
},
"result":
{
"edges": 442,
"markings": 433,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 49844,
"runtime": 29.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((** OR (G(**) AND F(**))))) : F(G((* OR **))) : G(F((X(*) AND F(*)))) : F(G((F(**) AND (** OR **)))) : F(G(*)) : F((G(**) OR (F(**) OR **))) : X((G(**) AND F((** AND (** U **))))) : X(X(G(**))) : G(**) : X((X(F(**)) OR **)) : X(F(*)) : X(F(((* R *) OR X(G(**))))) : (** U (G(F(**)) OR **)) : (X(X(G(**))) AND (F(**) AND X(**))) : (X(*) U **)"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no no yes no no no no no no yes yes yes no no no ",
"value": "no no yes no no no no no no yes yes yes 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: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: X (X ((G (((1 <= p18) AND (1 <= p22))) U ((1 <= p96) AND (1 <= p126))))) : F (G ((NOT(X (((1 <= p99) AND (1 <= p178)))) OR X (((1 <= p163) AND (1 <= p174)))))) : G (F (X (G (NOT(G ((X (((1 <= p96) AND (1 <= p101) AND (1 <= p161))) OR G (((1 <= p96) AND (1 <= p101) AND (1 <= p161)))))))))) : X (G (F (X (G ((F (((1 <= p147))) U F (G ((((1 <= p147)) U ((p44 <= 0) OR (p51 <= 0))))))))))) : G (NOT(G (F ((((p7 <= 0) OR (p36 <= 0) OR ((1 <= p99) AND (1 <= p179))) U X (((1 <= p101) AND (1 <= p135)))))))) : F (((G (((1 <= p99) AND (1 <= p128))) OR F (((1 <= p98) AND (1 <= p183)))) OR ((1 <= p98) AND (1 <= p183) AND ((p94 <= 0) OR (p105 <= 0)) AND ((p99 <= 0) OR (p128 <= 0))))) : (G (X (((1 <= p115) AND (1 <= p118)))) AND F ((X (((p162 <= 0) OR ((1 <= p115) AND (1 <= p118)) OR (p172 <= 0))) AND X ((((1 <= p99) AND (1 <= p128)) U ((1 <= p13) AND (1 <= p87))))))) : G (X (X (NOT(((((1 <= p76) AND (1 <= p78) AND (1 <= p86)) U ((1 <= p205) AND (1 <= p206) AND (1 <= p215))) U NOT(G (((1 <= p101) AND (1 <= p160))))))))) : G (((p24 <= 0) OR (p28 <= 0))) : (X (X (F (((1 <= p105) AND (1 <= p134))))) OR X (((p9 <= 0) OR (p89 <= 0)))) : F (((G (F (((p112 <= 0) OR (p122 <= 0)))) OR NOT(F (X (((1 <= p112) AND (1 <= p122)))))) U NOT(X (((1 <= p164) AND (1 <= p171)))))) : F (X ((NOT((((1 <= p1) AND (1 <= p60)) U ((1 <= p14) AND (1 <= p88)))) OR G (X (((1 <= p93) AND (1 <= p115))))))) : (((1 <= p105) AND (1 <= p151)) U (G (F (X (((1 <= p105) AND (1 <= p151))))) OR ((1 <= p61)))) : ((NOT(X (X (F (NOT(G (((1 <= p101) AND (1 <= p104) AND (1 <= p157)))))))) AND F (((1 <= p163) AND (1 <= p164) AND (1 <= p191)))) AND X (((1 <= p101) AND (1 <= p104) AND (1 <= p157)))) : (NOT(X (((p96 <= 0) OR (p111 <= 0)))) U ((1 <= p119) AND (1 <= p138)))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p96) AND (1 <= p126)) OR (G (((1 <= p18) AND (1 <= p22))) AND F (((1 <= p96) AND (1 <= p126)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p96) AND (1 <= p126)) OR (G (((1 <= p18) AND (1 <= p22))) AND F (((1 <= p96) AND (1 <= p126)))))))
lola: processed formula length: 112
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 271 markings, 271 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0))) AND F (((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0))) AND F (((p96 <= 0) OR (p101 <= 0) OR (p161 <= 0))))))
lola: processed formula length: 111
lola: 72 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: 896422 markings, 2426887 edges, 179284 markings/sec, 0 secs
lola: 1670889 markings, 4964253 edges, 154893 markings/sec, 5 secs
lola: 2354028 markings, 7570101 edges, 136628 markings/sec, 10 secs
lola: 2889785 markings, 10163566 edges, 107151 markings/sec, 15 secs
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: 2938198 markings, 11903351 edges
lola: subprocess 2 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p115) AND (1 <= p118))) AND F ((((p162 <= 0) OR ((1 <= p115) AND (1 <= p118)) OR (p172 <= 0)) AND (((1 <= p99) AND (1 <= p128)) U ((1 <= p13) AND (1 <= p87)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p115) AND (1 <= p118))) AND F ((((p162 <= 0) OR ((1 <= p115) AND (1 <= p118)) OR (p172 <= 0)) AND (((1 <= p99) AND (1 <= p128)) U ((1 <= p13) AND (1 <= p87)))))))
lola: processed formula length: 178
lola: 72 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: 271 markings, 271 edges
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p101) AND (1 <= p160)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p101) AND (1 <= p160)))))
lola: processed formula length: 41
lola: 72 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: 271 markings, 271 edges
lola: ========================================
lola: subprocess 4 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((1 <= p105) AND (1 <= p134)))) OR ((p9 <= 0) OR (p89 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((1 <= p105) AND (1 <= p134)))) OR ((p9 <= 0) OR (p89 <= 0))))
lola: processed formula length: 73
lola: 72 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p164 <= 0) OR (p171 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p164 <= 0) OR (p171 <= 0))))
lola: processed formula length: 37
lola: 72 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: 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((p1 <= 0) OR (p60 <= 0)) R ((p14 <= 0) OR (p88 <= 0))) OR X (G (((1 <= p93) AND (1 <= p115)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((p1 <= 0) OR (p60 <= 0)) R ((p14 <= 0) OR (p88 <= 0))) OR X (G (((1 <= p93) AND (1 <= p115)))))))
lola: processed formula length: 108
lola: 72 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p101) AND (1 <= p104) AND (1 <= p157))))) AND (F (((1 <= p163) AND (1 <= p164) AND (1 <= p191))) AND X (((1 <= p101) AND (1 <= p104) AND (1 <= p157)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p163) AND (1 <= p164) AND (1 <= p191)))
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: ((p163 <= 0) OR (p164 <= 0) OR (p191 <= 0))
lola: processed formula length: 45
lola: 74 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: 99 markings, 98 edges
lola: ========================================
lola: subprocess 8 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p101) AND (1 <= p104) AND (1 <= p157)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p101) AND (1 <= p104) AND (1 <= p157)))
lola: processed formula length: 49
lola: 72 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: 271 markings, 271 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p96) AND (1 <= p111))) U ((1 <= p119) AND (1 <= p138)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p96) AND (1 <= p111))) U ((1 <= p119) AND (1 <= p138)))
lola: processed formula length: 66
lola: 72 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: 271 markings, 271 edges
lola: ========================================
lola: subprocess 9 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p101 <= 0) OR (p135 <= 0))))
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 (((p101 <= 0) OR (p135 <= 0))))
lola: processed formula length: 37
lola: 72 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: 419 markings, 422 edges
lola: ========================================
lola: subprocess 10 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p99 <= 0) OR (p178 <= 0)) OR ((1 <= p163) AND (1 <= p174)))))
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 ((((p99 <= 0) OR (p178 <= 0)) OR ((1 <= p163) AND (1 <= p174)))))
lola: processed formula length: 71
lola: 72 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 152
lola: add low 151
lola: add low 166
lola: add low 167
lola: add low 165
lola: add low 164
lola: add low 163
lola: add low 170
lola: add low 171
lola: add low 169
lola: add low 168
lola: add low 120
lola: add low 0
lola: add low 121
lola: add low 116
lola: add low 10
lola: add low 67
lola: add low 11
lola: add low 9
lola: add low 8
lola: add low 6
lola: add low 7
lola: add low 5
lola: add low 4
lola: add low 1
lola: add low 69
lola: add low 77
lola: add low 78
lola: add low 76
lola: add low 75
lola: add low 86
lola: add low 87
lola: add low 85
lola: add low 84
lola: add low 83
lola: add low 90
lola: add low 91
lola: add low 89
lola: add low 88
lola: add low 64
lola: add low 65
lola: add low 60
lola: add low 36
lola: add low 37
lola: add low 42
lola: add low 117
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 172
lola: add low 39
lola: add low 192
lola: add low 193
lola: add low 191
lola: add low 190
lola: add low 189
lola: add low 200
lola: add low 201
lola: add low 199
lola: add low 198
lola: add low 196
lola: add low 197
lola: add low 195
lola: add low 194
lola: add low 175
lola: add low 173
lola: add low 187
lola: add low 188
lola: add low 186
lola: add low 185
lola: add low 176
lola: add low 179
lola: add low 180
lola: add low 178
lola: add low 177
lola: add low 183
lola: add low 184
lola: add low 182
lola: add low 181
lola: add low 174
lola: add low 48
lola: add low 126
lola: add low 137
lola: add low 138
lola: add low 136
lola: add low 135
lola: add low 142
lola: add low 143
lola: add low 141
lola: add low 140
lola: add low 139
lola: add low 146
lola: add low 147
lola: add low 145
lola: add low 144
lola: add low 122
lola: add low 18
lola: add low 118
lola: add low 22
lola: add low 61
lola: add low 23
lola: add low 21
lola: add low 20
lola: add low 26
lola: add low 27
lola: add low 25
lola: add low 24
lola: add low 19
lola: add low 49
lola: add low 54
lola: add low 55
lola: add low 53
lola: add low 52
lola: add low 58
lola: add low 59
lola: add low 57
lola: add low 56
lola: add low 50
lola: add low 16
lola: add low 51
lola: add low 34
lola: add low 35
lola: add low 33
lola: add low 32
lola: add low 30
lola: add low 31
lola: add low 29
lola: add low 28
lola: add low 17
lola: add low 92
lola: add low 97
lola: add low 98
lola: add low 96
lola: add low 95
lola: add low 110
lola: add low 111
lola: add low 109
lola: add low 108
lola: add low 107
lola: add low 114
lola: add low 115
lola: add low 113
lola: add low 112
lola: add low 66
lola: add low 2
lola: add low 62
lola: add low 63
lola: add low 14
lola: add low 15
lola: add low 13
lola: add low 12
lola: add low 3
lola: add low 119
lola: add low 67
lola: add low 70
lola: add low 81
lola: add low 82
lola: add low 80
lola: add low 79
lola: add low 86
lola: add low 87
lola: add low 85
lola: add low 84
lola: add low 83
lola: add low 90
lola: add low 91
lola: add low 89
lola: add low 88
lola: add low 64
lola: add low 65
lola: add low 36
lola: add low 37
lola: add low 42
lola: add low 123
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 172
lola: add low 39
lola: add low 192
lola: add low 193
lola: add low 191
lola: add low 190
lola: add low 189
lola: add low 200
lola: add low 201
lola: add low 199
lola: add low 198
lola: add low 196
lola: add low 197
lola: add low 195
lola: add low 194
lola: add low 175
lola: add low 173
lola: add low 187
lola: add low 188
lola: add low 186
lola: add low 185
lola: add low 176
lola: add low 179
lola: add low 180
lola: add low 178
lola: add low 177
lola: add low 183
lola: add low 184
lola: add low 182
lola: add low 181
lola: add low 174
lola: add low 48
lola: add low 150
lola: add low 161
lola: add low 162
lola: add low 160
lola: add low 159
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: 664 markings, 670 edges
lola: subprocess 11 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p24 <= 0) OR (p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p24 <= 0) OR (p28 <= 0)))
lola: processed formula length: 31
lola: 72 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: 422 markings, 422 edges
lola: ========================================
lola: subprocess 12 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p44 <= 0) OR (p51 <= 0))) AND (((1 <= p147)) OR ((p44 <= 0) OR (p51 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p44 <= 0) OR (p51 <= 0))) AND (((1 <= p147)) OR ((p44 <= 0) OR (p51 <= 0))))))
lola: processed formula length: 92
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 19
lola: add low 49
lola: add low 54
lola: add low 55
lola: add low 53
lola: add low 52
lola: add low 58
lola: add low 59
lola: add low 57
lola: add low 56
lola: add low 50
lola: add low 16
lola: add low 51
lola: add low 173
lola: add low 34
lola: add low 187
lola: add low 35
lola: add low 33
lola: add low 32
lola: add low 30
lola: add low 188
lola: add low 186
lola: add low 185
lola: add low 176
lola: add low 179
lola: add low 180
lola: add low 178
lola: add low 177
lola: add low 183
lola: add low 184
lola: add low 182
lola: add low 181
lola: add low 174
lola: add low 172
lola: add low 48
lola: add low 192
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: 172 markings, 173 edges
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p105) AND (1 <= p151)) U (G (F (((1 <= p105) AND (1 <= p151)))) OR ((1 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p105) AND (1 <= p151)) U (G (F (((1 <= p105) AND (1 <= p151)))) OR ((1 <= p61))))
lola: processed formula length: 89
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260 markings, 260 edges
lola: ========================================
lola: subprocess 14 will run for 3541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p99) AND (1 <= p128))) OR (F (((1 <= p98) AND (1 <= p183))) OR ((1 <= p98) AND (1 <= p183) AND ((p94 <= 0) OR (p105 <= 0)) AND ((p99 <= 0) OR (p128 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p99) AND (1 <= p128))) OR (F (((1 <= p98) AND (1 <= p183))) OR ((1 <= p98) AND (1 <= p183) AND ((p94 <= 0) OR (p105 <= 0)) AND ((p99 <= 0) OR (p128 <= 0))))))
lola: processed formula length: 174
lola: 72 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: 433 markings, 442 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no yes yes yes no no no
lola:
preliminary result: no no yes no no no no no no yes yes yes no no no
lola: memory consumption: 49844 KB
lola: time consumption: 29 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="ParamProductionCell-PT-3"
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 ParamProductionCell-PT-3, 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 r174-csrt-158987853300490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ;