Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038006100190.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is AutoFlight-PT-01b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100190
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 26K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-01b-00
FORMULA_NAME AutoFlight-PT-01b-01
FORMULA_NAME AutoFlight-PT-01b-02
FORMULA_NAME AutoFlight-PT-01b-03
FORMULA_NAME AutoFlight-PT-01b-04
FORMULA_NAME AutoFlight-PT-01b-05
FORMULA_NAME AutoFlight-PT-01b-06
FORMULA_NAME AutoFlight-PT-01b-07
FORMULA_NAME AutoFlight-PT-01b-08
FORMULA_NAME AutoFlight-PT-01b-09
FORMULA_NAME AutoFlight-PT-01b-10
FORMULA_NAME AutoFlight-PT-01b-11
FORMULA_NAME AutoFlight-PT-01b-12
FORMULA_NAME AutoFlight-PT-01b-13
FORMULA_NAME AutoFlight-PT-01b-14
FORMULA_NAME AutoFlight-PT-01b-15

=== Now, execution of the tool begins

BK_START 1620431852042

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 23:57:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-07 23:57:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 23:57:33] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-07 23:57:33] [INFO ] Transformed 114 places.
[2021-05-07 23:57:33] [INFO ] Transformed 112 transitions.
[2021-05-07 23:57:33] [INFO ] Found NUPN structural information;
[2021-05-07 23:57:33] [INFO ] Parsed PT model containing 114 places and 112 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1502 resets, run finished after 261 ms. (steps per millisecond=383 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 112 rows 114 cols
[2021-05-07 23:57:34] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-07 23:57:34] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2021-05-07 23:57:34] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:34] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-07 23:57:34] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 10 ms.
[2021-05-07 23:57:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:57:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 100 ms returned sat
[2021-05-07 23:57:34] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:34] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-07 23:57:34] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 9 ms.
[2021-05-07 23:57:35] [INFO ] Added : 111 causal constraints over 23 iterations in 192 ms. Result :sat
[2021-05-07 23:57:35] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2021-05-07 23:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-07 23:57:35] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:35] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-07 23:57:35] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 11 ms.
[2021-05-07 23:57:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:57:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 96 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-07 23:57:35] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 6 ms.
[2021-05-07 23:57:35] [INFO ] Added : 111 causal constraints over 23 iterations in 198 ms. Result :sat
[2021-05-07 23:57:35] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:35] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-07 23:57:35] [INFO ] Deduced a trap composed of 35 places in 34 ms
[2021-05-07 23:57:35] [INFO ] Deduced a trap composed of 34 places in 26 ms
[2021-05-07 23:57:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2021-05-07 23:57:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:57:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 96 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-07 23:57:36] [INFO ] Deduced a trap composed of 35 places in 27 ms
[2021-05-07 23:57:36] [INFO ] Deduced a trap composed of 34 places in 24 ms
[2021-05-07 23:57:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2021-05-07 23:57:36] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 6 ms.
[2021-05-07 23:57:36] [INFO ] Added : 111 causal constraints over 23 iterations in 160 ms. Result :sat
[2021-05-07 23:57:36] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:36] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-07 23:57:36] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 7 ms.
[2021-05-07 23:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 95 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-07 23:57:36] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 6 ms.
[2021-05-07 23:57:36] [INFO ] Added : 111 causal constraints over 23 iterations in 155 ms. Result :sat
[2021-05-07 23:57:36] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-07 23:57:36] [INFO ] Deduced a trap composed of 25 places in 51 ms
[2021-05-07 23:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-07 23:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 30 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-07 23:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 23:57:36] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-07 23:57:37] [INFO ] Deduced a trap composed of 25 places in 29 ms
[2021-05-07 23:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-07 23:57:37] [INFO ] Computed and/alt/rep : 111/152/111 causal constraints in 7 ms.
[2021-05-07 23:57:37] [INFO ] Added : 111 causal constraints over 23 iterations in 155 ms. Result :sat
[2021-05-07 23:57:37] [INFO ] Deduced a trap composed of 28 places in 30 ms
[2021-05-07 23:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-07 23:57:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-07 23:57:37] [INFO ] Flatten gal took : 36 ms
FORMULA AutoFlight-PT-01b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-01b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-07 23:57:37] [INFO ] Applying decomposition
[2021-05-07 23:57:37] [INFO ] Flatten gal took : 11 ms
[2021-05-07 23:57:37] [INFO ] Decomposing Gal with order
[2021-05-07 23:57:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 23:57:37] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-07 23:57:37] [INFO ] Flatten gal took : 44 ms
[2021-05-07 23:57:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2021-05-07 23:57:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-07 23:57:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ AutoFlight-PT-01b @ 3570 seconds

FORMULA AutoFlight-PT-01b-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-01b-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2535
rslt: Output for LTLFireability @ AutoFlight-PT-01b

{
"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": "Fri May 7 23:57:38 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((((1 <= p9)) U G ((G (((p9 <= 0))) AND ((p49 <= 0))))) OR X ((G (((1 <= p83))) AND ((1 <= p83))))))",
"processed_size": 103,
"rewrites": 108
},
"result":
{
"edges": 60,
"markings": 60,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 23
},
"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": 327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((p22 <= 0) OR (p90 <= 0) OR ((1 <= p37)))))",
"processed_size": 52,
"rewrites": 108
},
"result":
{
"edges": 1405,
"markings": 514,
"produced_by": "LTL model checker",
"value": false
},
"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": 363
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 2,
"aconj": 7,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p111))) AND (X (X ((((p54 <= 0)) R ((p38 <= 0) OR (p74 <= 0))))) OR (((((1 <= p5)) U ((1 <= p54))) AND ((1 <= p5))) U ((1 <= p111))))))",
"processed_size": 150,
"rewrites": 108
},
"result":
{
"edges": 60,
"markings": 60,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 408
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p20 <= 0))",
"processed_size": 12,
"rewrites": 108
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((G (((1 <= p14))) AND ((1 <= p35))) U (X (X (G (((1 <= p107))))) OR (G (((1 <= p107))) AND F (G (((1 <= p107)))))))",
"processed_size": 116,
"rewrites": 108
},
"result":
{
"edges": 60,
"markings": 60,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 59
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (((p88 <= 0))) AND ((X (G (((p88 <= 0)))) OR G (F (((p59 <= 0))))) AND ((p41 <= 0) OR (p86 <= 0))))))",
"processed_size": 111,
"rewrites": 108
},
"result":
{
"edges": 1865,
"markings": 975,
"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": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (G ((((1 <= p93)) OR (G ((G (((p87 <= 0))) AND ((1 <= p93)))) AND F (((1 <= p93)))))))))",
"processed_size": 96,
"rewrites": 108
},
"result":
{
"edges": 1405,
"markings": 514,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (((1 <= p17))) OR (((1 <= p19)) U X (F (((1 <= p17))))))))",
"processed_size": 67,
"rewrites": 108
},
"result":
{
"edges": 304,
"markings": 245,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p83 <= 0))",
"processed_size": 12,
"rewrites": 110
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1090
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F (((p15 <= 0) OR (p97 <= 0))) OR ((p96 <= 0)))))",
"processed_size": 57,
"rewrites": 108
},
"result":
{
"edges": 997672,
"markings": 180105,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1634
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1634
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p57 <= 0))",
"processed_size": 12,
"rewrites": 110
},
"result":
{
"edges": 151,
"markings": 129,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3268
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p26 <= 0))))",
"processed_size": 20,
"rewrites": 108
},
"result":
{
"edges": 770,
"markings": 333,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((((p37 <= 0)) AND (F ((X (((p41 <= 0) OR (p86 <= 0))) OR ((p83 <= 0)))) OR G (((p37 <= 0))))))) AND ((1 <= p52)))))",
"processed_size": 129,
"rewrites": 108
},
"result":
{
"edges": 423433778,
"markings": 65527874,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 34212,
"runtime": 1035.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(*)) AND G((G(*) AND **))) : F(G((F(*) OR *))) : G(F((G(F((* AND (F((X(*) OR *)) OR G(*))))) AND **))) : X(((** U G((G(*) AND *))) OR X((G(**) AND **)))) : X(G(**)) : (F(**) AND F(**)) : G((F(**) AND (X(X((* R *))) OR (((** U **) AND **) U **)))) : (((G(**) AND **) U (X(X(G(**))) OR (G(**) AND F(G(**))))) AND **) : X(G((X(*) AND ((X(G(*)) OR G(F(*))) AND *)))) : F(**) : X(X(X(G((** OR (G((G(*) AND *)) AND F(**))))))) : X(G((G(**) OR (** U X(F(**))))))"
},
"net":
{
"arcs": 264,
"conflict_clusters": 98,
"places": 114,
"places_significant": 104,
"singleton_clusters": 0,
"transitions": 112
},
"result":
{
"preliminary_value": "no yes no no no no no no no no no no ",
"value": "no yes 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: 226/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 114
lola: finding significant places
lola: 114 places, 112 transitions, 104 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: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: (NOT(G (F (((1 <= p26))))) AND G ((NOT(F (((1 <= p6)))) AND ((p24 <= 0))))) : NOT(G (F ((G (((1 <= p15) AND (1 <= p97))) AND ((1 <= p96)))))) : X (G (F ((G (F (NOT((G ((X (((1 <= p41) AND (1 <= p86))) AND ((1 <= p83)))) U ((1 <= p37)))))) AND ((1 <= p52)))))) : X (((((1 <= p9)) U NOT(F ((F (((1 <= p9))) OR ((1 <= p49)))))) OR X ((G (((1 <= p83))) AND ((1 <= p83)))))) : G (X (G (((p22 <= 0) OR (p90 <= 0) OR ((1 <= p37)))))) : ((((1 <= p11) AND (1 <= p75)) U F (((1 <= p78)))) AND F (((1 <= p57)))) : G ((NOT(X (X ((((1 <= p54)) U ((1 <= p38) AND (1 <= p74)))))) U (((((1 <= p5)) U ((1 <= p54))) AND ((1 <= p5))) U ((1 <= p111))))) : (((G (((1 <= p14))) AND ((1 <= p35))) U (G (((1 <= p107))) U X (X (G (((1 <= p107))))))) AND ((p20 <= 0))) : G (NOT(X ((F ((X (F (G (((1 <= p59))))) U X (((1 <= p88))))) OR F (((1 <= p41) AND (1 <= p86))))))) : ((((1 <= p44)) OR ((1 <= p18))) U (X (((1 <= p51) AND (1 <= p100))) U F ((((1 <= p18)) U NOT(G (NOT(F (((1 <= p83)))))))))) : X (NOT(F (NOT(X (X ((NOT(F ((F (((1 <= p87))) OR ((p93 <= 0))))) U ((1 <= p93))))))))) : G (X ((G (((1 <= p17))) OR (((1 <= p19)) U X (F (((1 <= p17))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((((p37 <= 0)) AND (F ((X (((p41 <= 0) OR (p86 <= 0))) OR ((p83 <= 0)))) OR G (((p37 <= 0))))))) AND ((1 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((((p37 <= 0)) AND (F ((X (((p41 <= 0) OR (p86 <= 0))) OR ((p83 <= 0)))) OR G (((p37 <= 0))))))) AND ((1 <= p52)))))
lola: processed formula length: 129
lola: 108 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: 772503 markings, 3555954 edges, 154501 markings/sec, 0 secs
lola: 1519923 markings, 6897100 edges, 149484 markings/sec, 5 secs
lola: 2204678 markings, 10034305 edges, 136951 markings/sec, 10 secs
lola: 2834789 markings, 13058285 edges, 126022 markings/sec, 15 secs
lola: 3462176 markings, 16173635 edges, 125477 markings/sec, 20 secs
lola: 4045790 markings, 19273265 edges, 116723 markings/sec, 25 secs
lola: 4581847 markings, 22197856 edges, 107211 markings/sec, 30 secs
lola: 5099752 markings, 25151561 edges, 103581 markings/sec, 35 secs
lola: 5616416 markings, 28069727 edges, 103333 markings/sec, 40 secs
lola: 6109004 markings, 30979704 edges, 98518 markings/sec, 45 secs
lola: 6628077 markings, 33962129 edges, 103815 markings/sec, 50 secs
lola: 7155305 markings, 36932290 edges, 105446 markings/sec, 55 secs
lola: 7669596 markings, 39854489 edges, 102858 markings/sec, 60 secs
lola: 8177223 markings, 42777551 edges, 101525 markings/sec, 65 secs
lola: 8682051 markings, 45703243 edges, 100966 markings/sec, 70 secs
lola: 9213181 markings, 48646027 edges, 106226 markings/sec, 75 secs
lola: 9723837 markings, 51630168 edges, 102131 markings/sec, 80 secs
lola: 9998423 markings, 54286113 edges, 54917 markings/sec, 85 secs
lola: 10104563 markings, 56602720 edges, 21228 markings/sec, 90 secs
lola: 10814901 markings, 59899861 edges, 142068 markings/sec, 95 secs
lola: 11441881 markings, 63197274 edges, 125396 markings/sec, 100 secs
lola: 12027940 markings, 66510921 edges, 117212 markings/sec, 105 secs
lola: 12569479 markings, 69761906 edges, 108308 markings/sec, 110 secs
lola: 13127507 markings, 73056403 edges, 111606 markings/sec, 115 secs
lola: 13691554 markings, 76296498 edges, 112809 markings/sec, 120 secs
lola: 14213990 markings, 79520212 edges, 104487 markings/sec, 125 secs
lola: 14793348 markings, 82747692 edges, 115872 markings/sec, 130 secs
lola: 15309615 markings, 85899095 edges, 103253 markings/sec, 135 secs
lola: 15850415 markings, 89032566 edges, 108160 markings/sec, 140 secs
lola: 16361874 markings, 92062525 edges, 102292 markings/sec, 145 secs
lola: 16877453 markings, 95099256 edges, 103116 markings/sec, 150 secs
lola: 17352237 markings, 98112305 edges, 94957 markings/sec, 155 secs
lola: 17792808 markings, 101087678 edges, 88114 markings/sec, 160 secs
lola: 18272571 markings, 104054563 edges, 95953 markings/sec, 165 secs
lola: 18766740 markings, 107013903 edges, 98834 markings/sec, 170 secs
lola: 19301013 markings, 109999902 edges, 106855 markings/sec, 175 secs
lola: 19799018 markings, 112918727 edges, 99601 markings/sec, 180 secs
lola: 20347825 markings, 116043620 edges, 109761 markings/sec, 185 secs
lola: 20893265 markings, 119232008 edges, 109088 markings/sec, 190 secs
lola: 21389434 markings, 122311827 edges, 99234 markings/sec, 195 secs
lola: 21882606 markings, 125374756 edges, 98634 markings/sec, 200 secs
lola: 22289035 markings, 128292760 edges, 81286 markings/sec, 205 secs
lola: 22704025 markings, 131202421 edges, 82998 markings/sec, 210 secs
lola: 23080978 markings, 134043149 edges, 75391 markings/sec, 215 secs
lola: 23502236 markings, 136888126 edges, 84252 markings/sec, 220 secs
lola: 23901028 markings, 139545223 edges, 79758 markings/sec, 225 secs
lola: 24250077 markings, 141981583 edges, 69810 markings/sec, 230 secs
lola: 24578786 markings, 144523842 edges, 65742 markings/sec, 235 secs
lola: 24886049 markings, 147113191 edges, 61453 markings/sec, 240 secs
lola: 25241372 markings, 149859294 edges, 71065 markings/sec, 245 secs
lola: 25659961 markings, 152602176 edges, 83718 markings/sec, 250 secs
lola: 26024993 markings, 155344991 edges, 73006 markings/sec, 255 secs
lola: 26386020 markings, 158199056 edges, 72205 markings/sec, 260 secs
lola: 26681204 markings, 161054788 edges, 59037 markings/sec, 265 secs
lola: 27048880 markings, 164004170 edges, 73535 markings/sec, 270 secs
lola: 27470365 markings, 167099832 edges, 84297 markings/sec, 275 secs
lola: 27955207 markings, 170338804 edges, 96968 markings/sec, 280 secs
lola: 28389384 markings, 173433896 edges, 86835 markings/sec, 285 secs
lola: 28851164 markings, 176539515 edges, 92356 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4097592 KB
lola: time consumption: 300 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: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p9)) U G ((G (((p9 <= 0))) AND ((p49 <= 0))))) OR X ((G (((1 <= p83))) AND ((1 <= p83))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p9)) U G ((G (((p9 <= 0))) AND ((p49 <= 0))))) OR X ((G (((1 <= p83))) AND ((1 <= p83))))))
lola: processed formula length: 103
lola: 108 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 23 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: 60 markings, 60 edges
lola: ========================================
lola: subprocess 2 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p22 <= 0) OR (p90 <= 0) OR ((1 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p22 <= 0) OR (p90 <= 0) OR ((1 <= p37)))))
lola: processed formula length: 52
lola: 108 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: 514 markings, 1405 edges
lola: ========================================
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p111))) AND (X (X ((((p54 <= 0)) R ((p38 <= 0) OR (p74 <= 0))))) OR (((((1 <= p5)) U ((1 <= p54))) AND ((1 <= p5))) U ((1 <= p111))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p111))) AND (X (X ((((p54 <= 0)) R ((p38 <= 0) OR (p74 <= 0))))) OR (((((1 <= p5)) U ((1 <= p54))) AND ((1 <= p5))) U ((1 <= p111))))))
lola: processed formula length: 150
lola: 108 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 60 markings, 60 edges
lola: ========================================
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((G (((1 <= p14))) AND ((1 <= p35))) U (X (X (G (((1 <= p107))))) OR (G (((1 <= p107))) AND F (G (((1 <= p107))))))) AND ((p20 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p20 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p20 <= 0))
lola: processed formula length: 12
lola: 108 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p14))) AND ((1 <= p35))) U (X (X (G (((1 <= p107))))) OR (G (((1 <= p107))) AND F (G (((1 <= p107)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p14))) AND ((1 <= p35))) U (X (X (G (((1 <= p107))))) OR (G (((1 <= p107))) AND F (G (((1 <= p107)))))))
lola: processed formula length: 116
lola: 108 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 59 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: 60 markings, 60 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p88 <= 0))) AND ((X (G (((p88 <= 0)))) OR G (F (((p59 <= 0))))) AND ((p41 <= 0) OR (p86 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p88 <= 0))) AND ((X (G (((p88 <= 0)))) OR G (F (((p59 <= 0))))) AND ((p41 <= 0) OR (p86 <= 0))))))
lola: processed formula length: 111
lola: 108 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: 975 markings, 1865 edges
lola: ========================================
lola: subprocess 6 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((1 <= p93)) OR (G ((G (((p87 <= 0))) AND ((1 <= p93)))) AND F (((1 <= p93)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((1 <= p93)) OR (G ((G (((p87 <= 0))) AND ((1 <= p93)))) AND F (((1 <= p93)))))))))
lola: processed formula length: 96
lola: 108 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: 514 markings, 1405 edges
lola: ========================================
lola: subprocess 7 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((1 <= p17))) OR (((1 <= p19)) U X (F (((1 <= p17))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((1 <= p17))) OR (((1 <= p19)) U X (F (((1 <= p17))))))))
lola: processed formula length: 67
lola: 108 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: 245 markings, 304 edges
lola: ========================================
lola: subprocess 8 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p83)))
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: ((p83 <= 0))
lola: processed formula length: 12
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 9 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p15 <= 0) OR (p97 <= 0))) OR ((p96 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p15 <= 0) OR (p97 <= 0))) OR ((p96 <= 0)))))
lola: processed formula length: 57
lola: 108 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 180105 markings, 997672 edges
lola: ========================================
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p78))) AND F (((1 <= p57))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p57)))
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: ((p57 <= 0))
lola: processed formula length: 12
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 129 markings, 151 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 11 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G (((p26 <= 0)))) AND G ((G (((p6 <= 0))) AND ((p24 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p26 <= 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 (((p26 <= 0))))
lola: processed formula length: 20
lola: 108 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 93
lola: add low 3
lola: add low 83
lola: add low 71
lola: add low 72
lola: add low 94
lola: add low 6
lola: add low 33
lola: add low 103
lola: add low 73
lola: add low 66
lola: add low 95
lola: add low 34
lola: add low 67
lola: add low 9
lola: add low 73
lola: add low 66
lola: add low 108
lola: add low 17
lola: add low 35
lola: add low 110
lola: add low 16
lola: add low 96
lola: add low 0
lola: add low 92
lola: add low 86
lola: add low 68
lola: add low 97
lola: add low 8
lola: add low 42
lola: add low 104
lola: add low 105
lola: add low 73
lola: add low 66
lola: add low 98
lola: add low 43
lola: add low 69
lola: add low 70
lola: add low 7
lola: add low 73
lola: add low 66
lola: add low 107
lola: add low 17
lola: add low 44
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: 333 markings, 770 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((((p37 <= 0)) AND (F ((X (((p41 <= 0) OR (p86 <= 0))) OR ((p83 <= 0)))) OR G (((p37 <= 0))))))) AND ((1 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((((p37 <= 0)) AND (F ((X (((p41 <= 0) OR (p86 <= 0))) OR ((p83 <= 0)))) OR G (((p37 <= 0))))))) AND ((1 <= p52)))))
lola: processed formula length: 129
lola: 108 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: 759916 markings, 3507380 edges, 151983 markings/sec, 0 secs
lola: 1493720 markings, 6771951 edges, 146761 markings/sec, 5 secs
lola: 2161265 markings, 9823812 edges, 133509 markings/sec, 10 secs
lola: 2793202 markings, 12859446 edges, 126387 markings/sec, 15 secs
lola: 3386243 markings, 15809173 edges, 118608 markings/sec, 20 secs
lola: 3936120 markings, 18714386 edges, 109975 markings/sec, 25 secs
lola: 4471316 markings, 21575052 edges, 107039 markings/sec, 30 secs
lola: 4993306 markings, 24553564 edges, 104398 markings/sec, 35 secs
lola: 5518457 markings, 27509807 edges, 105030 markings/sec, 40 secs
lola: 6012908 markings, 30415660 edges, 98890 markings/sec, 45 secs
lola: 6523050 markings, 33373708 edges, 102028 markings/sec, 50 secs
lola: 7052856 markings, 36395770 edges, 105961 markings/sec, 55 secs
lola: 7591245 markings, 39389059 edges, 107678 markings/sec, 60 secs
lola: 8093627 markings, 42290717 edges, 100476 markings/sec, 65 secs
lola: 8592164 markings, 45180045 edges, 99707 markings/sec, 70 secs
lola: 9122318 markings, 48170596 edges, 106031 markings/sec, 75 secs
lola: 9654275 markings, 51210489 edges, 106391 markings/sec, 80 secs
lola: 9985154 markings, 53963901 edges, 66176 markings/sec, 85 secs
lola: 10097332 markings, 56326268 edges, 22436 markings/sec, 90 secs
lola: 10745097 markings, 59578675 edges, 129553 markings/sec, 95 secs
lola: 11374831 markings, 62857496 edges, 125947 markings/sec, 100 secs
lola: 11975118 markings, 66175922 edges, 120057 markings/sec, 105 secs
lola: 12538464 markings, 69587666 edges, 112669 markings/sec, 110 secs
lola: 13120029 markings, 73006796 edges, 116313 markings/sec, 115 secs
lola: 13702835 markings, 76366489 edges, 116561 markings/sec, 120 secs
lola: 14255049 markings, 79742571 edges, 110443 markings/sec, 125 secs
lola: 14850526 markings, 83112885 edges, 119095 markings/sec, 130 secs
lola: 15394911 markings, 86369407 edges, 108877 markings/sec, 135 secs
lola: 15921940 markings, 89469030 edges, 105406 markings/sec, 140 secs
lola: 16449955 markings, 92531676 edges, 105603 markings/sec, 145 secs
lola: 16941104 markings, 95510118 edges, 98230 markings/sec, 150 secs
lola: 17425908 markings, 98561950 edges, 96961 markings/sec, 155 secs
lola: 17867274 markings, 101621674 edges, 88273 markings/sec, 160 secs
lola: 18379217 markings, 104645829 edges, 102389 markings/sec, 165 secs
lola: 18871342 markings, 107682596 edges, 98425 markings/sec, 170 secs
lola: 19430079 markings, 110726328 edges, 111747 markings/sec, 175 secs
lola: 19939808 markings, 113806435 edges, 101946 markings/sec, 180 secs
lola: 20545962 markings, 117142635 edges, 121231 markings/sec, 185 secs
lola: 21088386 markings, 120474672 edges, 108485 markings/sec, 190 secs
lola: 21593390 markings, 123674637 edges, 101001 markings/sec, 195 secs
lola: 22100373 markings, 126892967 edges, 101397 markings/sec, 200 secs
lola: 22510963 markings, 129951199 edges, 82118 markings/sec, 205 secs
lola: 22962477 markings, 133108703 edges, 90303 markings/sec, 210 secs
lola: 23401472 markings, 136176750 edges, 87799 markings/sec, 215 secs
lola: 23804859 markings, 138928606 edges, 80677 markings/sec, 220 secs
lola: 24174965 markings, 141440019 edges, 74021 markings/sec, 225 secs
lola: 24514980 markings, 144025962 edges, 68003 markings/sec, 230 secs
lola: 24846909 markings, 146681217 edges, 66386 markings/sec, 235 secs
lola: 25159574 markings, 149330218 edges, 62533 markings/sec, 240 secs
lola: 25569706 markings, 151995275 edges, 82026 markings/sec, 245 secs
lola: 25921386 markings, 154542063 edges, 70336 markings/sec, 250 secs
lola: 26261001 markings, 157189580 edges, 67923 markings/sec, 255 secs
lola: 26531608 markings, 159786345 edges, 54121 markings/sec, 260 secs
lola: 26845302 markings, 162487424 edges, 62739 markings/sec, 265 secs
lola: 27264218 markings, 165508755 edges, 83783 markings/sec, 270 secs
lola: 27640262 markings, 168309770 edges, 75209 markings/sec, 275 secs
lola: 28131573 markings, 171566868 edges, 98262 markings/sec, 280 secs
lola: 28550737 markings, 174602208 edges, 83833 markings/sec, 285 secs
lola: 29066648 markings, 177992605 edges, 103182 markings/sec, 290 secs
lola: 29526721 markings, 181309770 edges, 92015 markings/sec, 295 secs
lola: 30027263 markings, 184443265 edges, 100108 markings/sec, 300 secs
lola: 30518240 markings, 187328897 edges, 98195 markings/sec, 305 secs
lola: 30957915 markings, 190203105 edges, 87935 markings/sec, 310 secs
lola: 31348711 markings, 192890530 edges, 78159 markings/sec, 315 secs
lola: 31763758 markings, 195602232 edges, 83009 markings/sec, 320 secs
lola: 32216059 markings, 198767991 edges, 90460 markings/sec, 325 secs
lola: 32666012 markings, 202017732 edges, 89991 markings/sec, 330 secs
lola: 33197213 markings, 204953853 edges, 106240 markings/sec, 335 secs
lola: 33650647 markings, 207909413 edges, 90687 markings/sec, 340 secs
lola: 34078024 markings, 210714494 edges, 85475 markings/sec, 345 secs
lola: 34467351 markings, 213366471 edges, 77865 markings/sec, 350 secs
lola: 34917201 markings, 216387063 edges, 89970 markings/sec, 355 secs
lola: 35353435 markings, 219589925 edges, 87247 markings/sec, 360 secs
lola: 35865351 markings, 222634379 edges, 102383 markings/sec, 365 secs
lola: 36326950 markings, 225243521 edges, 92320 markings/sec, 370 secs
lola: 36742412 markings, 227858304 edges, 83092 markings/sec, 375 secs
lola: 37191283 markings, 230651302 edges, 89774 markings/sec, 380 secs
lola: 37542471 markings, 233314366 edges, 70238 markings/sec, 385 secs
lola: 38052652 markings, 236055005 edges, 102036 markings/sec, 390 secs
lola: 38485339 markings, 238629829 edges, 86537 markings/sec, 395 secs
lola: 38904648 markings, 241264079 edges, 83862 markings/sec, 400 secs
lola: 39335825 markings, 244007180 edges, 86235 markings/sec, 405 secs
lola: 39722962 markings, 246660186 edges, 77427 markings/sec, 410 secs
lola: 40199394 markings, 249309235 edges, 95286 markings/sec, 415 secs
lola: 40630132 markings, 251948405 edges, 86148 markings/sec, 420 secs
lola: 41063784 markings, 254671274 edges, 86730 markings/sec, 425 secs
lola: 41461989 markings, 257370444 edges, 79641 markings/sec, 430 secs
lola: 41909384 markings, 260048152 edges, 89479 markings/sec, 435 secs
lola: 42353137 markings, 262622424 edges, 88751 markings/sec, 440 secs
lola: 42764474 markings, 265213524 edges, 82267 markings/sec, 445 secs
lola: 43196927 markings, 267912879 edges, 86491 markings/sec, 450 secs
lola: 43540030 markings, 270486126 edges, 68621 markings/sec, 455 secs
lola: 44030068 markings, 273120891 edges, 98008 markings/sec, 460 secs
lola: 44451764 markings, 275630943 edges, 84339 markings/sec, 465 secs
lola: 44861500 markings, 278199801 edges, 81947 markings/sec, 470 secs
lola: 45274624 markings, 280822416 edges, 82625 markings/sec, 475 secs
lola: 45643448 markings, 283458592 edges, 73765 markings/sec, 480 secs
lola: 46182631 markings, 286408022 edges, 107837 markings/sec, 485 secs
lola: 46653541 markings, 289314423 edges, 94182 markings/sec, 490 secs
lola: 47133831 markings, 292306071 edges, 96058 markings/sec, 495 secs
lola: 47511709 markings, 295189312 edges, 75576 markings/sec, 500 secs
lola: 47875405 markings, 297981102 edges, 72739 markings/sec, 505 secs
lola: 48212870 markings, 300577604 edges, 67493 markings/sec, 510 secs
lola: 48528504 markings, 303055990 edges, 63127 markings/sec, 515 secs
lola: 48895588 markings, 305836459 edges, 73417 markings/sec, 520 secs
lola: 49263269 markings, 308643855 edges, 73536 markings/sec, 525 secs
lola: 49591361 markings, 310971297 edges, 65618 markings/sec, 530 secs
lola: 49891458 markings, 313302970 edges, 60019 markings/sec, 535 secs
lola: 50154349 markings, 315439687 edges, 52578 markings/sec, 540 secs
lola: 50486726 markings, 317837351 edges, 66475 markings/sec, 545 secs
lola: 50810965 markings, 320158077 edges, 64848 markings/sec, 550 secs
lola: 51034955 markings, 322203656 edges, 44798 markings/sec, 555 secs
lola: 51243515 markings, 324104396 edges, 41712 markings/sec, 560 secs
lola: 51518763 markings, 326420667 edges, 55050 markings/sec, 565 secs
lola: 51766313 markings, 328415646 edges, 49510 markings/sec, 570 secs
lola: 52125031 markings, 331021262 edges, 71744 markings/sec, 575 secs
lola: 52469097 markings, 333649609 edges, 68813 markings/sec, 580 secs
lola: 52785616 markings, 336097989 edges, 63304 markings/sec, 585 secs
lola: 53158880 markings, 338865485 edges, 74653 markings/sec, 590 secs
lola: 53538232 markings, 341730541 edges, 75870 markings/sec, 595 secs
lola: 53887405 markings, 344424967 edges, 69835 markings/sec, 600 secs
lola: 54257957 markings, 347214178 edges, 74110 markings/sec, 605 secs
lola: 54647985 markings, 350092488 edges, 78006 markings/sec, 610 secs
lola: 54991990 markings, 352769867 edges, 68801 markings/sec, 615 secs
lola: 55340527 markings, 355460287 edges, 69707 markings/sec, 620 secs
lola: 55768814 markings, 358558096 edges, 85657 markings/sec, 625 secs
lola: 56138262 markings, 361431096 edges, 73890 markings/sec, 630 secs
lola: 56515137 markings, 364359031 edges, 75375 markings/sec, 635 secs
lola: 56936900 markings, 367476431 edges, 84353 markings/sec, 640 secs
lola: 57359561 markings, 370353240 edges, 84532 markings/sec, 645 secs
lola: 57742608 markings, 373055891 edges, 76609 markings/sec, 650 secs
lola: 58153359 markings, 375778816 edges, 82150 markings/sec, 655 secs
lola: 58600272 markings, 378959575 edges, 89383 markings/sec, 660 secs
lola: 59171769 markings, 382073855 edges, 114299 markings/sec, 665 secs
lola: 59688923 markings, 385277066 edges, 103431 markings/sec, 670 secs
lola: 60172868 markings, 388374160 edges, 96789 markings/sec, 675 secs
lola: 60617020 markings, 391322356 edges, 88830 markings/sec, 680 secs
lola: 61078432 markings, 394303333 edges, 92282 markings/sec, 685 secs
lola: 61532127 markings, 397492966 edges, 90739 markings/sec, 690 secs
lola: 61990075 markings, 400765921 edges, 91590 markings/sec, 695 secs
lola: 62635532 markings, 404269949 edges, 129091 markings/sec, 700 secs
lola: 63189304 markings, 407773484 edges, 110754 markings/sec, 705 secs
lola: 63713745 markings, 411124884 edges, 104888 markings/sec, 710 secs
lola: 64193297 markings, 414312869 edges, 95910 markings/sec, 715 secs
lola: 64708469 markings, 417732339 edges, 103034 markings/sec, 720 secs
lola: 65179395 markings, 421165610 edges, 94185 markings/sec, 725 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: 65527874 markings, 423433778 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no no
lola:
preliminary result: no yes no no no no no no no no no no
lola: memory consumption: 34212 KB
lola: time consumption: 1035 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="AutoFlight-PT-01b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is AutoFlight-PT-01b, 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 r011-tall-162038006100190"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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