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.r182-oct2-158987914200666.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 CSRepetitions-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914200666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 71K Apr 27 15:14 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 CSRepetitions-PT-03-00
FORMULA_NAME CSRepetitions-PT-03-01
FORMULA_NAME CSRepetitions-PT-03-02
FORMULA_NAME CSRepetitions-PT-03-03
FORMULA_NAME CSRepetitions-PT-03-04
FORMULA_NAME CSRepetitions-PT-03-05
FORMULA_NAME CSRepetitions-PT-03-06
FORMULA_NAME CSRepetitions-PT-03-07
FORMULA_NAME CSRepetitions-PT-03-08
FORMULA_NAME CSRepetitions-PT-03-09
FORMULA_NAME CSRepetitions-PT-03-10
FORMULA_NAME CSRepetitions-PT-03-11
FORMULA_NAME CSRepetitions-PT-03-12
FORMULA_NAME CSRepetitions-PT-03-13
FORMULA_NAME CSRepetitions-PT-03-14
FORMULA_NAME CSRepetitions-PT-03-15

=== Now, execution of the tool begins

BK_START 1591171265533

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:01:07] [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 08:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:01:07] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-03 08:01:07] [INFO ] Transformed 58 places.
[2020-06-03 08:01:07] [INFO ] Transformed 81 transitions.
[2020-06-03 08:01:07] [INFO ] Parsed PT model containing 58 places and 81 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 388 steps, including 11 resets, run visited all 25 properties in 8 ms. (steps per millisecond=48 )
[2020-06-03 08:01:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 08:01:07] [INFO ] Flatten gal took : 30 ms
FORMULA CSRepetitions-PT-03-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:01:07] [INFO ] Flatten gal took : 15 ms
[2020-06-03 08:01:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-03 08:01:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CSRepetitions-PT-03 @ 3570 seconds

FORMULA CSRepetitions-PT-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CSRepetitions-PT-03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CSRepetitions-PT-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-03-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3504
rslt: Output for LTLFireability @ CSRepetitions-PT-03

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 08:01:07 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 2,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48)))) AND (((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56))))))",
"processed_size": 1157,
"rewrites": 82
},
"result":
{
"edges": 18,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (G ((G (F (((p16 <= 0) AND (p2 <= 0) AND (p21 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p8 <= 0) AND (p25 <= 0) AND (p43 <= 0) AND (p47 <= 0)))) AND X (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))))))",
"processed_size": 288,
"rewrites": 82
},
"result":
{
"edges": 70116676,
"markings": 7896254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 318
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))))",
"processed_size": 287,
"rewrites": 82
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 350
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 0,
"aconj": 64,
"adisj": 12,
"aneg": 0,
"comp": 144,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 144,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "F ((F (G ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56))))) AND G (((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))) OR ((((p13 <= 0) OR (p48 <= 0)) AND ((p17 <= 0) OR (p48 <= 0)) AND ((p31 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p10 <= 0) OR (p48 <= 0)) AND ((p5 <= 0) OR (p48 <= 0)) AND ((p37 <= 0) OR (p48 <= 0)) AND ((p48 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p48 <= 0))) U G ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56)))))))))",
"processed_size": 2314,
"rewrites": 82
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 350
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 27,
"adisj": 3,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X (X ((X (G (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))) AND (F ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56)))) U ((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))))))",
"processed_size": 1149,
"rewrites": 82
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 389
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G (((p36 <= 0) AND (p53 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p7 <= 0) AND (p23 <= 0) AND (p40 <= 0) AND (p26 <= 0) AND (p15 <= 0))))",
"processed_size": 139,
"rewrites": 82
},
"result":
{
"edges": 3157,
"markings": 464,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56))))",
"processed_size": 859,
"rewrites": 82
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 28,
"aneg": 0,
"comp": 63,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))) U X (X ((((p2 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p56 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p2 <= 0) OR (p56 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)) AND ((p21 <= 0) OR (p33 <= 0)) AND ((p25 <= 0) OR (p33 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p47 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p33 <= 0)) AND ((p43 <= 0) OR (p56 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p56 <= 0)) AND ((p33 <= 0) OR (p43 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p43 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p33 <= 0)) AND ((p38 <= 0) OR (p56 <= 0)) AND ((p21 <= 0) OR (p56 <= 0)) AND ((p16 <= 0) OR (p50 <= 0)) AND ((p38 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p21 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p50 <= 0)) AND ((p25 <= 0) OR (p50 <= 0)) AND ((p16 <= 0) OR (p56 <= 0)))))))",
"processed_size": 1007,
"rewrites": 82
},
"result":
{
"edges": 1746,
"markings": 1031,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 3,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 28,
"visible_transitions": 0
},
"processed": "G (F ((G (((p16 <= 0) AND (p2 <= 0) AND (p21 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p8 <= 0) AND (p25 <= 0) AND (p43 <= 0) AND (p47 <= 0))) OR (X (G ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))))) AND ((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))))))",
"processed_size": 577,
"rewrites": 82
},
"result":
{
"edges": 3195,
"markings": 696,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 584
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "G ((X (((p33 <= 0) OR (p38 <= 0))) OR (((p42 <= 0) OR (p44 <= 0)) AND (1 <= p33) AND (1 <= p38))))",
"processed_size": 100,
"rewrites": 82
},
"result":
{
"edges": 36193,
"markings": 8367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 700
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((X (((p18 <= 0) OR (p49 <= 0))) AND ((p34 <= 0) OR (p37 <= 0))))))",
"processed_size": 77,
"rewrites": 82
},
"result":
{
"edges": 5301,
"markings": 2862,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 876
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((F (((1 <= p12) AND (1 <= p44))) OR ((1 <= p44) AND (1 <= p48))))))",
"processed_size": 76,
"rewrites": 82
},
"result":
{
"edges": 22,
"markings": 22,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F (((1 <= p12) AND (1 <= p44))))",
"processed_size": 35,
"rewrites": 82
},
"result":
{
"edges": 19,
"markings": 19,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1752
},
"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 <= p15))",
"processed_size": 14,
"rewrites": 82
},
"result":
{
"edges": 33,
"markings": 30,
"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": 3504
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((1 <= p17) AND (1 <= p35)))",
"processed_size": 31,
"rewrites": 82
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 <= p17) AND (1 <= p35))",
"processed_size": 27,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p17 <= 0) OR (p35 <= 0))))",
"processed_size": 35,
"rewrites": 82
},
"result":
{
"edges": 509,
"markings": 243,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((1 <= p17) AND (1 <= p35)))",
"processed_size": 31,
"rewrites": 82
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"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 <= p38) AND (1 <= p50))",
"processed_size": 27,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= p17) AND (1 <= p35))",
"processed_size": 27,
"rewrites": 82
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p17 <= 0) OR (p35 <= 0))))",
"processed_size": 35,
"rewrites": 82
},
"result":
{
"edges": 509,
"markings": 243,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 115164,
"runtime": 66.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G((F(**) AND **))) AND G((** OR X(G((F(**) AND **)))))) : X(G((G(F(*)) AND X(**)))) : (F((F(G(**)) AND G((** OR (** U G(**)))))) AND X(**)) : X(X((X(G(**)) AND (F(**) U **)))) : (X(**) OR F(G(**))) : X((F(**) U X(X(**)))) : G(F((G(*) OR (X(G(**)) AND **)))) : (G((X(*) OR **)) AND ((** U **) OR **)) : X(X(F((X(*) AND *)))) : G(F(**)) : X(X(F((F(**) OR **)))) : G(**) : (G(**) OR (** OR (** OR (F((G(**) OR (** OR **))) AND F(G(**))))))"
},
"net":
{
"arcs": 279,
"conflict_clusters": 11,
"places": 58,
"places_significant": 46,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no no ",
"value": "no no no 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: 139/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 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 <= p12) AND (1 <= p44)) OR ((1 <= p32) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p29) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p24) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p28) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p51)) OR ((1 <= p10) AND (1 <= p57)) OR ((1 <= p17) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p27) AND (1 <= p31)) OR ((1 <= p39) AND (1 <= p44)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p5) AND (1 <= p46)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p42) AND (1 <= p44)) OR ((1 <= p34) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p45)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p30) AND (1 <= p37))) U NOT(F (NOT(G (X ((F ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48)))) AND (((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56))))))))))) : G (X ((NOT((F ((((1 <= p12) AND (1 <= p44)) OR ((1 <= p32) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p29) AND (1 <= p31)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p24) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p28) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p51)) OR ((1 <= p10) AND (1 <= p57)) OR ((1 <= p17) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p27) AND (1 <= p31)) OR ((1 <= p39) AND (1 <= p44)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p5) AND (1 <= p46)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p42) AND (1 <= p44)) OR ((1 <= p34) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p45)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p30) AND (1 <= p37)))) U F (X (G (((1 <= p16) OR (1 <= p2) OR (1 <= p21) OR (1 <= p38) OR (1 <= p41) OR (1 <= p8) OR (1 <= p25) OR (1 <= p43) OR (1 <= p47))))))) AND X (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))))) : (F (G (((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))) U ((((p13 <= 0) OR (p48 <= 0)) AND ((p17 <= 0) OR (p48 <= 0)) AND ((p31 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p10 <= 0) OR (p48 <= 0)) AND ((p5 <= 0) OR (p48 <= 0)) AND ((p37 <= 0) OR (p48 <= 0)) AND ((p48 <= 0) OR (p49 <= 0)) AND ((p44 <= 0) OR (p48 <= 0))) U G ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56)))))))) AND X ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))))) : X (X ((X (G (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))) AND (F ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56)))) U ((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))))) : (X ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p43)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p43) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p33)) OR ((1 <= p38) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p50)) OR ((1 <= p38) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p21) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p50)) OR ((1 <= p25) AND (1 <= p50)) OR ((1 <= p16) AND (1 <= p56)))) OR F (G (X (((p36 <= 0) AND (p53 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p7 <= 0) AND (p23 <= 0) AND (p40 <= 0) AND (p26 <= 0) AND (p15 <= 0)))))) : X ((F (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))) U X (X ((((p2 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p56 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p2 <= 0) OR (p56 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)) AND ((p21 <= 0) OR (p33 <= 0)) AND ((p25 <= 0) OR (p33 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AND ((p47 <= 0) OR (p50 <= 0)) AND ((p2 <= 0) OR (p33 <= 0)) AND ((p43 <= 0) OR (p56 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p56 <= 0)) AND ((p33 <= 0) OR (p43 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p43 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p33 <= 0)) AND ((p38 <= 0) OR (p56 <= 0)) AND ((p21 <= 0) OR (p56 <= 0)) AND ((p16 <= 0) OR (p50 <= 0)) AND ((p38 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p56 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p21 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p50 <= 0)) AND ((p25 <= 0) OR (p50 <= 0)) AND ((p16 <= 0) OR (p56 <= 0))))))) : NOT(F (NOT(F ((NOT(F (((1 <= p16) OR (1 <= p2) OR (1 <= p21) OR (1 <= p38) OR (1 <= p41) OR (1 <= p8) OR (1 <= p25) OR (1 <= p43) OR (1 <= p47)))) OR (G (X ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))))) AND ((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))))))) : (G ((NOT(X (((1 <= p33) AND (1 <= p38)))) OR (((p42 <= 0) OR (p44 <= 0)) AND (1 <= p33) AND (1 <= p38)))) AND ((((1 <= p33) AND (1 <= p38)) U (1 <= p23)) OR ((1 <= p42) AND (1 <= p44)))) : NOT(X (G (X ((X (((1 <= p18) AND (1 <= p49))) OR ((1 <= p34) AND (1 <= p37))))))) : G (F (X (((1 <= p12) AND (1 <= p44))))) : X (F (X ((NOT(G (NOT((((1 <= p44) AND (1 <= p48)) U ((1 <= p12) AND (1 <= p44)))))) OR ((1 <= p44) AND (1 <= p48)))))) : G ((1 <= p15)) : (F (X (F (G (((p17 <= 0) OR (p35 <= 0)))))) U ((G (((1 <= p17) AND (1 <= p35))) OR ((1 <= p38) AND (1 <= p50))) OR ((1 <= p17) AND (1 <= p35))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48)))) AND (((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48)))) AND (((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48)))) AND (((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <=... (shortened)
lola: processed formula length: 1157
lola: 82 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F (((p16 <= 0) AND (p2 <= 0) AND (p21 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p8 <= 0) AND (p25 <= 0) AND (p43 <= 0) AND (p47 <= 0)))) AND X (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F (((p16 <= 0) AND (p2 <= 0) AND (p21 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p8 <= 0) AND (p25 <= 0) AND (p43 <= 0) AND (p47 <= 0)))) AND X (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))))))
lola: processed formula length: 288
lola: 82 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: 1190884 markings, 5237779 edges, 238177 markings/sec, 0 secs
lola: 2147892 markings, 10649589 edges, 191402 markings/sec, 5 secs
lola: 3014232 markings, 16157048 edges, 173268 markings/sec, 10 secs
lola: 3831596 markings, 21648801 edges, 163473 markings/sec, 15 secs
lola: 4616359 markings, 27179408 edges, 156953 markings/sec, 20 secs
lola: 5382215 markings, 32912288 edges, 153171 markings/sec, 25 secs
lola: 6121582 markings, 39400875 edges, 147873 markings/sec, 30 secs
lola: 6765364 markings, 46159347 edges, 128756 markings/sec, 35 secs
lola: 7288322 markings, 52907406 edges, 104592 markings/sec, 40 secs
lola: 7576147 markings, 58563667 edges, 57565 markings/sec, 45 secs
lola: 7786051 markings, 63622382 edges, 41981 markings/sec, 50 secs
lola: 7887445 markings, 68385228 edges, 20279 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7896254 markings, 70116676 edges
lola: subprocess 2 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((F (G ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49)) OR ((1 <= p44) AND (1 <= p48))))
lola: processed formula length: 287
lola: 82 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p2... (shortened)
lola: processed formula length: 2314
lola: 82 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 16 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))) AND (F ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15)))) AND (F ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p... (shortened)
lola: processed formula length: 1149
lola: 82 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 4 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p36 <= 0) AND (p53 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p7 <= 0) AND (p23 <= 0) AND (p40 <= 0) AND (p26 <= 0) AND (p15 <= 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 (((p36 <= 0) AND (p53 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p7 <= 0) AND (p23 <= 0) AND (p40 <= 0) AND (p26 <= 0) AND (p15 <= 0))))
lola: processed formula length: 139
lola: 82 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: 464 markings, 3157 edges
lola: ========================================
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p2) AND (1 <= p50)) OR ((1 <= p8) AND (1 <= p56)) OR ((1 <= p16) AND (1 <= p33)) OR ((1 <= p2) AND (1 <= p56)) OR ((1 <= p47) AND (1 <= p56)) OR ((1 <= p21) AND (1 <= p33)) OR ((1 <= p25) AND (1 <= p33)) OR ((1 <= p41) AND (1 <= p50)) OR ((1 <= p47) AND (1 <= p50)) OR ((1 <= p2) AND (1 <= p33)) OR ((1 <= p43) AND (1 <= p56)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p25) AND ... (shortened)
lola: processed formula length: 859
lola: 82 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: 16 markings, 16 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))) U X (X ((((p2 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p56 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p2 <= 0) OR (p56 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)) AND ((p21 <= 0) OR (p33 <= 0)) AND ((p25 <= 0) OR (p33 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p36) OR (1 <= p53) OR (1 <= p55) OR (1 <= p54) OR (1 <= p7) OR (1 <= p23) OR (1 <= p40) OR (1 <= p26) OR (1 <= p15))) U X (X ((((p2 <= 0) OR (p50 <= 0)) AND ((p8 <= 0) OR (p56 <= 0)) AND ((p16 <= 0) OR (p33 <= 0)) AND ((p2 <= 0) OR (p56 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)) AND ((p21 <= 0) OR (p33 <= 0)) AND ((p25 <= 0) OR (p33 <= 0)) AND ((p41 <= 0) OR (p50 <= 0)) AN... (shortened)
lola: processed formula length: 1007
lola: 82 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1031 markings, 1746 edges
lola: ========================================
lola: subprocess 6 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p16 <= 0) AND (p2 <= 0) AND (p21 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p8 <= 0) AND (p25 <= 0) AND (p43 <= 0) AND (p47 <= 0))) OR (X (G ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p16 <= 0) AND (p2 <= 0) AND (p21 <= 0) AND (p38 <= 0) AND (p41 <= 0) AND (p8 <= 0) AND (p25 <= 0) AND (p43 <= 0) AND (p47 <= 0))) OR (X (G ((((1 <= p13) AND (1 <= p48)) OR ((1 <= p17) AND (1 <= p48)) OR ((1 <= p31) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p10) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p48)) OR ((1 <= p48) AND (1 <= p49... (shortened)
lola: processed formula length: 577
lola: 82 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: 696 markings, 3195 edges
lola: ========================================
lola: subprocess 7 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (((p33 <= 0) OR (p38 <= 0))) OR (((p42 <= 0) OR (p44 <= 0)) AND (1 <= p33) AND (1 <= p38)))) AND ((((1 <= p33) AND (1 <= p38)) U (1 <= p23)) OR ((1 <= p42) AND (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p33 <= 0) OR (p38 <= 0))) OR (((p42 <= 0) OR (p44 <= 0)) AND (1 <= p33) AND (1 <= p38))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p33 <= 0) OR (p38 <= 0))) OR (((p42 <= 0) OR (p44 <= 0)) AND (1 <= p33) AND (1 <= p38))))
lola: processed formula length: 100
lola: 82 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: 8367 markings, 36193 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (((p18 <= 0) OR (p49 <= 0))) AND ((p34 <= 0) OR (p37 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (((p18 <= 0) OR (p49 <= 0))) AND ((p34 <= 0) OR (p37 <= 0))))))
lola: processed formula length: 77
lola: 82 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: 2862 markings, 5301 edges
lola: ========================================
lola: subprocess 9 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F (((1 <= p12) AND (1 <= p44))) OR ((1 <= p44) AND (1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F (((1 <= p12) AND (1 <= p44))) OR ((1 <= p44) AND (1 <= p48))))))
lola: processed formula length: 76
lola: 82 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 10 will run for 1168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p12) AND (1 <= p44))))
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 <= p12) AND (1 <= p44))))
lola: processed formula length: 35
lola: 82 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 1752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p15))
lola: processed formula length: 14
lola: 82 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: 30 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 3504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p17) AND (1 <= p35))) OR (((1 <= p38) AND (1 <= p50)) OR (((1 <= p17) AND (1 <= p35)) OR (F ((G (((1 <= p17) AND (1 <= p35))) OR (((1 <= p38) AND (1 <= p50)) OR ((1 <= p17) AND (1 <= p35))))) AND F (G (((p17 <= 0) OR (p35 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p17) AND (1 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p17) AND (1 <= p35)))
lola: processed formula length: 31
lola: 82 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: 28 markings, 28 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p17) AND (1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p17) AND (1 <= p35))
lola: processed formula length: 27
lola: 82 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p17 <= 0) OR (p35 <= 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 (((p17 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 82 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: 243 markings, 509 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p17) AND (1 <= p35))) OR (((1 <= p38) AND (1 <= p50)) OR (((1 <= p17) AND (1 <= p35)) OR (F ((G (((1 <= p17) AND (1 <= p35))) OR (((1 <= p38) AND (1 <= p50)) OR ((1 <= p17) AND (1 <= p35))))) AND F (G (((p17 <= 0) OR (p35 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p17) AND (1 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p17) AND (1 <= p35)))
lola: processed formula length: 31
lola: 82 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: 28 markings, 28 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p38) AND (1 <= p50))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p38) AND (1 <= p50))
lola: processed formula length: 27
lola: 82 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: ((1 <= p17) AND (1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p17) AND (1 <= p35))
lola: processed formula length: 27
lola: 82 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: F (G (((p17 <= 0) OR (p35 <= 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 (((p17 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 82 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: 243 markings, 509 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no
lola: memory consumption: 115164 KB
lola: time consumption: 66 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="CSRepetitions-PT-03"
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 CSRepetitions-PT-03, 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 r182-oct2-158987914200666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-03.tgz
mv CSRepetitions-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;