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-158987853200466.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-0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.8K Apr 13 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 13 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.3K 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.6K Apr 13 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 13 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 13 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 13 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 149K 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-0-00
FORMULA_NAME ParamProductionCell-PT-0-01
FORMULA_NAME ParamProductionCell-PT-0-02
FORMULA_NAME ParamProductionCell-PT-0-03
FORMULA_NAME ParamProductionCell-PT-0-04
FORMULA_NAME ParamProductionCell-PT-0-05
FORMULA_NAME ParamProductionCell-PT-0-06
FORMULA_NAME ParamProductionCell-PT-0-07
FORMULA_NAME ParamProductionCell-PT-0-08
FORMULA_NAME ParamProductionCell-PT-0-09
FORMULA_NAME ParamProductionCell-PT-0-10
FORMULA_NAME ParamProductionCell-PT-0-11
FORMULA_NAME ParamProductionCell-PT-0-12
FORMULA_NAME ParamProductionCell-PT-0-13
FORMULA_NAME ParamProductionCell-PT-0-14
FORMULA_NAME ParamProductionCell-PT-0-15

=== Now, execution of the tool begins

BK_START 1591150432430

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:13:57] [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:13:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:13:57] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2020-06-03 02:13:57] [INFO ] Transformed 198 places.
[2020-06-03 02:13:57] [INFO ] Transformed 176 transitions.
[2020-06-03 02:13:57] [INFO ] Found NUPN structural information;
[2020-06-03 02:13:57] [INFO ] Parsed PT model containing 198 places and 176 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 109 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 289 ms. (steps per millisecond=346 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 176 rows 198 cols
[2020-06-03 02:13:58] [INFO ] Computed 49 place invariants in 28 ms
[2020-06-03 02:13:58] [INFO ] [Real]Absence check using 32 positive place invariants in 37 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 02:13:58] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 02:13:58] [INFO ] Flatten gal took : 82 ms
FORMULA ParamProductionCell-PT-0-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 02:13:58] [INFO ] Applying decomposition
[2020-06-03 02:13:58] [INFO ] Flatten gal took : 56 ms
[2020-06-03 02:13:59] [INFO ] Decomposing Gal with order
[2020-06-03 02:13:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 02:13:59] [INFO ] Removed a total of 126 redundant transitions.
[2020-06-03 02:13:59] [INFO ] Flatten gal took : 220 ms
[2020-06-03 02:13:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 23 ms.
[2020-06-03 02:13:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2020-06-03 02:13:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ParamProductionCell-PT-0 @ 3570 seconds

FORMULA ParamProductionCell-PT-0-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ParamProductionCell-PT-0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLFireability @ ParamProductionCell-PT-0

{
"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:14:00 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((1 <= p44) AND (1 <= p51)))) AND G (((1 <= p17))))))",
"processed_size": 66,
"rewrites": 59
},
"result":
{
"edges": 236,
"markings": 235,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((X (G (((1 <= p165) AND (1 <= p168)))) OR F ((((1 <= p104) AND (1 <= p151)) OR (G ((G (((p98 <= 0) OR (p105 <= 0) OR (p111 <= 0))) OR (((p114 <= 0)) OR ((p140 <= 0))))) AND F (((1 <= p104) AND (1 <= p151))))))))",
"processed_size": 216,
"rewrites": 59
},
"result":
{
"edges": 1257,
"markings": 1033,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 31
},
"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": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((p79 <= 0) OR (p80 <= 0)))) AND G (((1 <= p94) AND (1 <= p105))))))",
"processed_size": 82,
"rewrites": 59
},
"result":
{
"edges": 236,
"markings": 235,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) AND (X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) OR G (((p40 <= 0) OR (p58 <= 0))))))",
"processed_size": 148,
"rewrites": 59
},
"result":
{
"edges": 233,
"markings": 233,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 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 (G (((1 <= p63) AND (1 <= p72))))",
"processed_size": 35,
"rewrites": 59
},
"result":
{
"edges": 233,
"markings": 233,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (((p76 <= 0) OR (p78 <= 0) OR (p86 <= 0))) R ((p76 <= 0) OR (p78 <= 0) OR (p86 <= 0))))",
"processed_size": 97,
"rewrites": 59
},
"result":
{
"edges": 1,
"markings": 2,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((F (((1 <= p7) AND (1 <= p36))) AND (((1 <= p147)) OR ((1 <= p7) AND (1 <= p36)))))))",
"processed_size": 95,
"rewrites": 59
},
"result":
{
"edges": 1470,
"markings": 490,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 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": "((p137 <= 0) OR (p141 <= 0))",
"processed_size": 29,
"rewrites": 61
},
"result":
{
"edges": 174,
"markings": 175,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 (((p119 <= 0) OR (p138 <= 0))))",
"processed_size": 37,
"rewrites": 59
},
"result":
{
"edges": 457,
"markings": 452,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((((p119 <= 0) OR ((1 <= p119) AND ((p99 <= 0) OR (p130 <= 0)) AND (1 <= p138)) OR (p138 <= 0)) AND ((p99 <= 0) OR (p130 <= 0)) AND ((p14 <= 0) OR (p145 <= 0)))))",
"processed_size": 172,
"rewrites": 59
},
"result":
{
"edges": 633,
"markings": 602,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 3566
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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 <= p4) AND (1 <= p15))",
"processed_size": 26,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "(((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0)))",
"processed_size": 62,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p4) AND (1 <= p15))",
"processed_size": 26,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p65 <= 0) OR (p66 <= 0))",
"processed_size": 27,
"rewrites": 61
},
"result":
{
"edges": 810,
"markings": 804,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "(((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0)))",
"processed_size": 62,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 46876,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((* R *) AND (G(F(**)) OR (F(**) OR **))) : F(G((X(F(**)) AND G(**)))) : G((X(G(**)) OR F((** OR (G((G(*) OR (** OR **))) AND F(**)))))) : F(G((X(F(*)) AND G(**)))) : F((X(G(**)) AND (X(G(**)) OR G(**)))) : F(G(*)) : ((X(F(**)) U (X(X(**)) AND (** AND (** AND (** AND **))))) AND X(G(**))) : F(**) : F((X(*) R *)) : G(F(*)) : X(X(F((F(**) AND **))))"
},
"net":
{
"arcs": 730,
"conflict_clusters": 53,
"places": 198,
"places_significant": 149,
"singleton_clusters": 0,
"transitions": 176
},
"result":
{
"preliminary_value": "yes no no no no no no yes yes yes yes ",
"value": "yes no no no no no no yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 374/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 198
lola: finding significant places
lola: 198 places, 176 transitions, 149 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: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 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: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 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: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 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: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 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: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 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: (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: (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: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 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: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: (NOT((((1 <= p97) AND (1 <= p157)) U ((1 <= p105) AND (1 <= p134)))) AND ((G (X (F (((1 <= p65) AND (1 <= p66))))) OR F (((1 <= p65) AND (1 <= p66)))) OR ((1 <= p4) AND (1 <= p15)))) : F (G (X ((F (X (F (((1 <= p44) AND (1 <= p51))))) AND G (((1 <= p17))))))) : G ((G (X (((1 <= p165) AND (1 <= p168)))) OR F ((G (((NOT(F (((1 <= p98) AND (1 <= p105) AND (1 <= p111)))) OR ((p114 <= 0))) OR ((p140 <= 0)))) U ((1 <= p104) AND (1 <= p151)))))) : F (X (G ((F (NOT(X (G (((1 <= p79) AND (1 <= p80)))))) AND G (((1 <= p94) AND (1 <= p105))))))) : F ((X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) AND (G (X (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) OR G (((p40 <= 0) OR (p58 <= 0)))))) : X (F (NOT((X (F (((1 <= p112) AND (1 <= p117) AND (1 <= p124)))) U F (X (((1 <= p119) AND (1 <= p138)))))))) : ((F (X (((1 <= p113) AND (1 <= p124)))) U ((((X (X (((1 <= p63) AND (1 <= p72)))) AND ((1 <= p63))) AND ((1 <= p72))) AND ((1 <= p113))) AND ((1 <= p124)))) AND X (G (((1 <= p63) AND (1 <= p72))))) : F (((G (X (NOT(G (((1 <= p137) AND (1 <= p141)))))) OR ((1 <= p99) AND (1 <= p178))) U ((1 <= p137) AND (1 <= p141)))) : F ((F (((1 <= p76) AND (1 <= p78) AND (1 <= p86))) U NOT((X (((1 <= p76) AND (1 <= p78) AND (1 <= p86))) U ((1 <= p76) AND (1 <= p78) AND (1 <= p86)))))) : NOT(F (G (X ((((1 <= p119) AND ((p119 <= 0) OR ((1 <= p99) AND (1 <= p130)) OR (p138 <= 0)) AND (1 <= p138)) OR ((1 <= p99) AND (1 <= p130)) OR ((1 <= p14) AND (1 <= p145))))))) : F (X (X (F ((F (((1 <= p7) AND (1 <= p36))) AND (((1 <= p147)) OR ((1 <= p7) AND (1 <= p36))))))))
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p44) AND (1 <= p51)))) AND G (((1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p44) AND (1 <= p51)))) AND G (((1 <= p17))))))
lola: processed formula length: 66
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 235 markings, 236 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((1 <= p165) AND (1 <= p168)))) OR F ((((1 <= p104) AND (1 <= p151)) OR (G ((G (((p98 <= 0) OR (p105 <= 0) OR (p111 <= 0))) OR (((p114 <= 0)) OR ((p140 <= 0))))) AND F (((1 <= p104) AND (1 <= p151))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((1 <= p165) AND (1 <= p168)))) OR F ((((1 <= p104) AND (1 <= p151)) OR (G ((G (((p98 <= 0) OR (p105 <= 0) OR (p111 <= 0))) OR (((p114 <= 0)) OR ((p140 <= 0))))) AND F (((1 <= p104) AND (1 <= p151))))))))
lola: processed formula length: 216
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 31 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 114
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: 1033 markings, 1257 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((p79 <= 0) OR (p80 <= 0)))) AND G (((1 <= p94) AND (1 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((p79 <= 0) OR (p80 <= 0)))) AND G (((1 <= p94) AND (1 <= p105))))))
lola: processed formula length: 82
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 235 markings, 236 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) AND (X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) OR G (((p40 <= 0) OR (p58 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) AND (X (G (((1 <= p63) AND (1 <= p64) AND (1 <= p70)))) OR G (((p40 <= 0) OR (p58 <= 0))))))
lola: processed formula length: 148
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 233 markings, 233 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F (((1 <= p113) AND (1 <= p124)))) U (X (X (((1 <= p63) AND (1 <= p72)))) AND (((1 <= p63)) AND (((1 <= p72)) AND (((1 <= p113)) AND ((1 <= p124))))))) AND X (G (((1 <= p63) AND (1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p63) AND (1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p63) AND (1 <= p72))))
lola: processed formula length: 35
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 233 markings, 233 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p76 <= 0) OR (p78 <= 0) OR (p86 <= 0))) R ((p76 <= 0) OR (p78 <= 0) OR (p86 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p76 <= 0) OR (p78 <= 0) OR (p86 <= 0))) R ((p76 <= 0) OR (p78 <= 0) OR (p86 <= 0))))
lola: processed formula length: 97
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F (((1 <= p7) AND (1 <= p36))) AND (((1 <= p147)) OR ((1 <= p7) AND (1 <= p36)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F (((1 <= p7) AND (1 <= p36))) AND (((1 <= p147)) OR ((1 <= p7) AND (1 <= p36)))))))
lola: processed formula length: 95
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 490 markings, 1470 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p137) AND (1 <= p141)))
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: ((p137 <= 0) OR (p141 <= 0))
lola: processed formula length: 29
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 175 markings, 174 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p119 <= 0) OR (p138 <= 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 (((p119 <= 0) OR (p138 <= 0))))
lola: processed formula length: 37
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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 173
lola: add low 172
lola: add low 39
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: 452 markings, 457 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p119 <= 0) OR ((1 <= p119) AND ((p99 <= 0) OR (p130 <= 0)) AND (1 <= p138)) OR (p138 <= 0)) AND ((p99 <= 0) OR (p130 <= 0)) AND ((p14 <= 0) OR (p145 <= 0)))))
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 ((((p119 <= 0) OR ((1 <= p119) AND ((p99 <= 0) OR (p130 <= 0)) AND (1 <= p138)) OR (p138 <= 0)) AND ((p99 <= 0) OR (p130 <= 0)) AND ((p14 <= 0) OR (p145 <= 0)))))
lola: processed formula length: 172
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 602 markings, 633 edges
lola: ========================================
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0))) AND (G (F (((1 <= p65) AND (1 <= p66)))) OR (F (((1 <= p65) AND (1 <= p66))) OR ((1 <= p4) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p15))
lola: processed formula length: 26
lola: 59 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: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0)))
lola: processed formula length: 62
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p65) AND (1 <= p66))))
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 <= p65) AND (1 <= p66))))
lola: processed formula length: 35
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no no no no no yes yes yes yes
lola: memory consumption: 62532 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0))) AND (G (F (((1 <= p65) AND (1 <= p66)))) OR (F (((1 <= p65) AND (1 <= p66))) OR ((1 <= p4) AND (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p15))
lola: processed formula length: 26
lola: 59 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 (((1 <= p65) AND (1 <= p66)))
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: ((p65 <= 0) OR (p66 <= 0))
lola: processed formula length: 27
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 804 markings, 810 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p97 <= 0) OR (p157 <= 0)) R ((p105 <= 0) OR (p134 <= 0)))
lola: processed formula length: 62
lola: 59 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no yes yes yes yes
lola:
preliminary result: yes no no no no no no yes yes yes yes
lola: memory consumption: 46876 KB
lola: time consumption: 5 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-0"
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-0, 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-158987853200466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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