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.r132-tall-162075428300186.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 IOTPpurchase-PT-C05M04P03D02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428300186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-15

=== Now, execution of the tool begins

BK_START 1620916646050

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 14:37:27] [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-13 14:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:37:27] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-13 14:37:27] [INFO ] Transformed 111 places.
[2021-05-13 14:37:27] [INFO ] Transformed 45 transitions.
[2021-05-13 14:37:27] [INFO ] Parsed PT model containing 111 places and 45 transitions in 75 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2335 steps, including 0 resets, run visited all 37 properties in 22 ms. (steps per millisecond=106 )
[2021-05-13 14:37:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 14:37:27] [INFO ] Flatten gal took : 34 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:37:27] [INFO ] Flatten gal took : 13 ms
[2021-05-13 14:37:27] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-13 14:37:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ IOTPpurchase-PT-C05M04P03D02 @ 3570 seconds

FORMULA IOTPpurchase-PT-C05M04P03D02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3028
rslt: Output for LTLFireability @ IOTPpurchase-PT-C05M04P03D02

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))",
"processed_size": 65,
"rewrites": 76
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p104)))",
"processed_size": 19,
"rewrites": 76
},
"result":
{
"edges": 36042064,
"markings": 7997092,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (((p97 <= 0) U ((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))))",
"processed_size": 80,
"rewrites": 76
},
"result":
{
"edges": 105570,
"markings": 30235,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))",
"processed_size": 65,
"rewrites": 76
},
"result":
{
"edges": 160,
"markings": 159,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (((1 <= p62) AND (1 <= p65))))",
"processed_size": 35,
"rewrites": 76
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 15,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (G ((X ((F (G ((((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))) AND ((1 <= p5) AND ((1 <= p20) AND ((1 <= p21) AND ((1 <= p27) AND ((1 <= p40) AND ((1 <= p51) AND (1 <= p78))))))))) OR (G (((1 <= p45) AND (1 <= p84))) AND X (F ((F (G ((((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))) AND ((1 <= p5) AND ((1 <= p20) AND ((1 <= p21) AND ((1 <= p27) AND ((1 <= p40) AND ((1 <= p51) AND (1 <= p78))))))))))))))",
"processed_size": 676,
"rewrites": 76
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 36
},
"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": 504
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p2)",
"processed_size": 9,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((1 <= p2) OR (1 <= p82)))",
"processed_size": 30,
"rewrites": 76
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((F (G ((p4 <= 0))) AND G ((X (F ((1 <= p4))) OR G ((p4 <= 0))))))",
"processed_size": 68,
"rewrites": 76
},
"result":
{
"edges": 423351225,
"markings": 52218434,
"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": 606
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 3,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((((1 <= p15) AND (1 <= p99)) OR ((1 <= p10) AND (1 <= p13))) R (p4 <= 0)) U (X (((p61 <= 0) OR (p64 <= 0))) OR F (((1 <= p15) AND (1 <= p99)))))",
"processed_size": 148,
"rewrites": 76
},
"result":
{
"edges": 2930034,
"markings": 671853,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 757
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p45) AND (1 <= p84))))",
"processed_size": 35,
"rewrites": 76
},
"result":
{
"edges": 338,
"markings": 330,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1009
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(F (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))) U (G (F (((1 <= p66) AND (1 <= p79)))) OR (1 <= p4)))",
"processed_size": 116,
"rewrites": 76
},
"result":
{
"edges": 80,
"markings": 55,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 1514
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1514
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": 6,
"visible_transitions": 0
},
"processed": "((1 <= p6) AND (1 <= p22) AND (1 <= p26) AND (1 <= p41) AND (1 <= p52) AND (1 <= p63))",
"processed_size": 86,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3029
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))",
"processed_size": 109,
"rewrites": 76
},
"result":
{
"edges": 1345,
"markings": 937,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3029
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))",
"processed_size": 57,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (((((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U G ((1 <= p2))) AND (1 <= p2)))",
"processed_size": 95,
"rewrites": 76
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))",
"processed_size": 57,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "G (F (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))))",
"processed_size": 65,
"rewrites": 76
},
"result":
{
"edges": 4534,
"markings": 2285,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 34180,
"runtime": 542.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G((X(*) OR (* OR *)))) AND G((X((** U **)) OR G((X(*) OR (* OR *)))))) : X(G(**)) : F(G(**)) : X(F(**)) : X(X((** U **))) : (G(F(**)) OR (F(((** U G(**)) AND **)) OR **)) : (X(X(**)) OR (F(G(*)) AND (X(G(**)) U **))) : X(G((X((F(G(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))) OR (G(**) AND X(F((F(G(**)) AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))) : (X((F(**) OR G(**))) AND (X(**) OR **)) : X((F(G(**)) AND G((X(F(**)) OR G(**))))) : ((* R *) U (X(**) OR F(**))) : (G(F(*)) OR **) : (F(*) U (G(F(**)) OR **))"
},
"net":
{
"arcs": 224,
"conflict_clusters": 44,
"places": 111,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "no no no yes yes yes no no no no yes yes yes ",
"value": "no no no yes yes yes no no no no 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: 156/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3552
lola: finding significant places
lola: 111 places, 45 transitions, 44 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: G ((X ((((1 <= p62) AND (1 <= p65)) U ((p14 <= 0) OR (p102 <= 0)))) U NOT(F (((X (((1 <= p15) AND (1 <= p99))) AND (1 <= p15)) AND (1 <= p99)))))) : G (X (((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93)))) : NOT(G (NOT(X (F (X (G (((1 <= p45) AND (1 <= p84))))))))) : X (F ((1 <= p104))) : X ((X ((p97 <= 0)) U X (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))))) : ((G (F (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))) OR F (((((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U G ((1 <= p2))) AND (1 <= p2)))) OR ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))) : (X (X (((1 <= p62) AND (1 <= p65)))) OR (F (NOT(F (X (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80)))))) AND (X (G (((1 <= p62) AND (1 <= p65)))) U ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))))) : X (G ((G (((1 <= p45) AND (1 <= p84))) U X ((((((((F (G ((((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))) AND (1 <= p5)) AND (1 <= p20)) AND (1 <= p21)) AND (1 <= p27)) AND (1 <= p40)) AND (1 <= p51)) AND (1 <= p78)))))) : (X ((F ((1 <= p2)) OR G ((1 <= p82)))) AND (X (((1 <= p2) OR (1 <= p82))) OR (1 <= p2))) : X (G ((X (F ((1 <= p4))) U G ((p4 <= 0))))) : (NOT(((((p15 <= 0) OR (p99 <= 0)) AND ((p10 <= 0) OR (p13 <= 0))) U (1 <= p4))) U (X (((p61 <= 0) OR (p64 <= 0))) OR F (((1 <= p15) AND (1 <= p99))))) : (X (G (F (X (NOT(X (G (X (((p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0)))))))))) OR ((1 <= p6) AND (1 <= p22) AND (1 <= p26) AND (1 <= p41) AND (1 <= p52) AND (1 <= p63))) : (F (NOT(G (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))))) U (G (F (((1 <= p66) AND (1 <= p79)))) OR (1 <= p4)))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k: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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:335
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:356
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((X (((p15 <= 0) OR (p99 <= 0))) OR ((p15 <= 0) OR (p99 <= 0))))) AND G ((X ((((1 <= p62) AND (1 <= p65)) U ((p14 <= 0) OR (p102 <= 0)))) OR G ((X (((p15 <= 0) OR (p99 <= 0))) OR ((p15 <= 0) OR (p99 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p15 <= 0) OR (p99 <= 0))) OR ((p15 <= 0) OR (p99 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p15 <= 0) OR (p99 <= 0))) OR ((p15 <= 0) OR (p99 <= 0)))))
lola: processed formula length: 71
lola: 76 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 113 markings, 132 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))
lola: processed formula length: 65
lola: 76 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: 87 markings, 87 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p104)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p104)))
lola: processed formula length: 19
lola: 76 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: 1513637 markings, 5607419 edges, 302727 markings/sec, 0 secs
lola: 2627788 markings, 11142716 edges, 222830 markings/sec, 5 secs
lola: 3860862 markings, 16645819 edges, 246615 markings/sec, 10 secs
lola: 4978999 markings, 21870060 edges, 223627 markings/sec, 15 secs
lola: 6159251 markings, 27117562 edges, 236050 markings/sec, 20 secs
lola: 7274621 markings, 32462389 edges, 223074 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7997092 markings, 36042064 edges
lola: ========================================
lola: subprocess 3 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p97 <= 0) U ((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p97 <= 0) U ((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))))
lola: processed formula length: 80
lola: 76 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: 30235 markings, 105570 edges
lola: ========================================
lola: subprocess 4 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p62) AND (1 <= p65)))) OR (F (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))) AND (X (G (((1 <= p62) AND (1 <= p65)))) U ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))
lola: processed formula length: 65
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 159 markings, 160 edges
lola: ========================================
lola: subprocess 5 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p62) AND (1 <= p65))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p62) AND (1 <= p65))))
lola: processed formula length: 35
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 87 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((F (G ((((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))) AND ((1 <= p5) AND ((1 <= p20) AND ((1 <= p21) AND ((1 <= p27) AND ((1 <= p40) AND ((1 <= p51) AND (1 <= p78))))))))) OR (G (((1 <= p45) AND (1 <= p84))) AND X (F ((F (G ((((1 <= p35) AND (1 <= p47) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((F (G ((((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))) AND ((1 <= p5) AND ((1 <= p20) AND ((1 <= p21) AND ((1 <= p27) AND ((1 <= p40) AND ((1 <= p51) AND (1 <= p78))))))))) OR (G (((1 <= p45) AND (1 <= p84))) AND X (F ((F (G ((((1 <= p35) AND (1 <= p47) A... (shortened)
lola: processed formula length: 676
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 36 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: 87 markings, 87 edges
lola: ========================================
lola: subprocess 6 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((1 <= p2)) OR G ((1 <= p82)))) AND (X (((1 <= p2) OR (1 <= p82))) OR (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2)
lola: processed formula length: 9
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p2) OR (1 <= p82)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p2) OR (1 <= p82)))
lola: processed formula length: 30
lola: 76 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: 87 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((p4 <= 0))) AND G ((X (F ((1 <= p4))) OR G ((p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((p4 <= 0))) AND G ((X (F ((1 <= p4))) OR G ((p4 <= 0))))))
lola: processed formula length: 68
lola: 76 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: 1746281 markings, 5216332 edges, 349256 markings/sec, 0 secs
lola: 2889576 markings, 10743385 edges, 228659 markings/sec, 5 secs
lola: 3809559 markings, 16328296 edges, 183997 markings/sec, 10 secs
lola: 4747064 markings, 21937221 edges, 187501 markings/sec, 15 secs
lola: 5728674 markings, 27015538 edges, 196322 markings/sec, 20 secs
lola: 6779870 markings, 31716814 edges, 210239 markings/sec, 25 secs
lola: 7847416 markings, 36263348 edges, 213509 markings/sec, 30 secs
lola: 8604172 markings, 40969236 edges, 151351 markings/sec, 35 secs
lola: 9392391 markings, 45701003 edges, 157644 markings/sec, 40 secs
lola: 10371912 markings, 50561386 edges, 195904 markings/sec, 45 secs
lola: 11138021 markings, 55150988 edges, 153222 markings/sec, 50 secs
lola: 11998681 markings, 59981095 edges, 172132 markings/sec, 55 secs
lola: 12888539 markings, 65571761 edges, 177972 markings/sec, 60 secs
lola: 13804273 markings, 71098403 edges, 183147 markings/sec, 65 secs
lola: 14825927 markings, 76516269 edges, 204331 markings/sec, 70 secs
lola: 15693155 markings, 81860658 edges, 173446 markings/sec, 75 secs
lola: 16493277 markings, 87282975 edges, 160024 markings/sec, 80 secs
lola: 17399646 markings, 92585378 edges, 181274 markings/sec, 85 secs
lola: 18190073 markings, 97406740 edges, 158085 markings/sec, 90 secs
lola: 18935716 markings, 102017009 edges, 149129 markings/sec, 95 secs
lola: 19698041 markings, 106738835 edges, 152465 markings/sec, 100 secs
lola: 20514849 markings, 111664670 edges, 163362 markings/sec, 105 secs
lola: 21432737 markings, 116406579 edges, 183578 markings/sec, 110 secs
lola: 22209648 markings, 121105837 edges, 155382 markings/sec, 115 secs
lola: 22924787 markings, 125953084 edges, 143028 markings/sec, 120 secs
lola: 23696984 markings, 130810159 edges, 154439 markings/sec, 125 secs
lola: 24483386 markings, 135414470 edges, 157280 markings/sec, 130 secs
lola: 25298659 markings, 139962298 edges, 163055 markings/sec, 135 secs
lola: 26170754 markings, 145427315 edges, 174419 markings/sec, 140 secs
lola: 27034947 markings, 150705736 edges, 172839 markings/sec, 145 secs
lola: 27836498 markings, 155714075 edges, 160310 markings/sec, 150 secs
lola: 28615690 markings, 160651385 edges, 155838 markings/sec, 155 secs
lola: 29511442 markings, 165702303 edges, 179150 markings/sec, 160 secs
lola: 30348451 markings, 170746926 edges, 167402 markings/sec, 165 secs
lola: 31192285 markings, 175548879 edges, 168767 markings/sec, 170 secs
lola: 31954680 markings, 180257330 edges, 152479 markings/sec, 175 secs
lola: 32744419 markings, 185062734 edges, 157948 markings/sec, 180 secs
lola: 33531999 markings, 189858081 edges, 157516 markings/sec, 185 secs
lola: 34358922 markings, 194629784 edges, 165385 markings/sec, 190 secs
lola: 35048492 markings, 198923944 edges, 137914 markings/sec, 195 secs
lola: 35640893 markings, 203012753 edges, 118480 markings/sec, 200 secs
lola: 36173391 markings, 207001406 edges, 106500 markings/sec, 205 secs
lola: 36679297 markings, 210969609 edges, 101181 markings/sec, 210 secs
lola: 37167031 markings, 214931695 edges, 97547 markings/sec, 215 secs
lola: 37642408 markings, 218902496 edges, 95075 markings/sec, 220 secs
lola: 38099659 markings, 222833470 edges, 91450 markings/sec, 225 secs
lola: 38551254 markings, 226778408 edges, 90319 markings/sec, 230 secs
lola: 38994421 markings, 230748349 edges, 88633 markings/sec, 235 secs
lola: 39429097 markings, 234672993 edges, 86935 markings/sec, 240 secs
lola: 39855967 markings, 238595977 edges, 85374 markings/sec, 245 secs
lola: 40275336 markings, 242506923 edges, 83874 markings/sec, 250 secs
lola: 40689583 markings, 246411579 edges, 82849 markings/sec, 255 secs
lola: 41097361 markings, 250289435 edges, 81556 markings/sec, 260 secs
lola: 41499251 markings, 254152498 edges, 80378 markings/sec, 265 secs
lola: 41893687 markings, 258018722 edges, 78887 markings/sec, 270 secs
lola: 42285064 markings, 261853218 edges, 78275 markings/sec, 275 secs
lola: 42674544 markings, 265681822 edges, 77896 markings/sec, 280 secs
lola: 43056495 markings, 269487277 edges, 76390 markings/sec, 285 secs
lola: 43437233 markings, 273293382 edges, 76148 markings/sec, 290 secs
lola: 43811709 markings, 277104243 edges, 74895 markings/sec, 295 secs
lola: 44183396 markings, 280910038 edges, 74337 markings/sec, 300 secs
lola: 44556913 markings, 284719699 edges, 74703 markings/sec, 305 secs
lola: 44926493 markings, 288498372 edges, 73916 markings/sec, 310 secs
lola: 45292038 markings, 292271929 edges, 73109 markings/sec, 315 secs
lola: 45653108 markings, 296032013 edges, 72214 markings/sec, 320 secs
lola: 46005046 markings, 299718655 edges, 70388 markings/sec, 325 secs
lola: 46357257 markings, 303426770 edges, 70442 markings/sec, 330 secs
lola: 46700218 markings, 307077167 edges, 68592 markings/sec, 335 secs
lola: 47045058 markings, 310759858 edges, 68968 markings/sec, 340 secs
lola: 47392187 markings, 314481117 edges, 69426 markings/sec, 345 secs
lola: 47739065 markings, 318158459 edges, 69376 markings/sec, 350 secs
lola: 48086345 markings, 321881643 edges, 69456 markings/sec, 355 secs
lola: 48433503 markings, 325620329 edges, 69432 markings/sec, 360 secs
lola: 48781754 markings, 329361431 edges, 69650 markings/sec, 365 secs
lola: 49136149 markings, 333112350 edges, 70879 markings/sec, 370 secs
lola: 49485372 markings, 336847692 edges, 69845 markings/sec, 375 secs
lola: 49833170 markings, 340585540 edges, 69560 markings/sec, 380 secs
lola: 50185577 markings, 344392580 edges, 70481 markings/sec, 385 secs
lola: 50536160 markings, 348222847 edges, 70117 markings/sec, 390 secs
lola: 50889402 markings, 352169287 edges, 70648 markings/sec, 395 secs
lola: 51238521 markings, 356118860 edges, 69824 markings/sec, 400 secs
lola: 51585713 markings, 360157847 edges, 69438 markings/sec, 405 secs
lola: 51931562 markings, 364304259 edges, 69170 markings/sec, 410 secs
lola: 52190661 markings, 368568574 edges, 51820 markings/sec, 415 secs
lola: 52203551 markings, 371839087 edges, 2578 markings/sec, 420 secs
lola: 52206162 markings, 375012014 edges, 522 markings/sec, 425 secs
lola: 52207990 markings, 378148163 edges, 366 markings/sec, 430 secs
lola: 52209964 markings, 381295278 edges, 395 markings/sec, 435 secs
lola: 52211743 markings, 384484052 edges, 356 markings/sec, 440 secs
lola: 52214235 markings, 387702897 edges, 498 markings/sec, 445 secs
lola: 52215184 markings, 390952898 edges, 190 markings/sec, 450 secs
lola: 52215961 markings, 394231013 edges, 155 markings/sec, 455 secs
lola: 52216604 markings, 397519704 edges, 129 markings/sec, 460 secs
lola: 52217132 markings, 400834276 edges, 106 markings/sec, 465 secs
lola: 52217484 markings, 404205790 edges, 70 markings/sec, 470 secs
lola: 52217675 markings, 407607618 edges, 38 markings/sec, 475 secs
lola: 52217844 markings, 411025399 edges, 34 markings/sec, 480 secs
lola: 52217955 markings, 414507689 edges, 22 markings/sec, 485 secs
lola: 52218021 markings, 418050177 edges, 13 markings/sec, 490 secs
lola: 52218070 markings, 421680620 edges, 10 markings/sec, 495 secs
lola: add low 18
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: 52218434 markings, 423351225 edges
lola: ========================================
lola: subprocess 8 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p15) AND (1 <= p99)) OR ((1 <= p10) AND (1 <= p13))) R (p4 <= 0)) U (X (((p61 <= 0) OR (p64 <= 0))) OR F (((1 <= p15) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p15) AND (1 <= p99)) OR ((1 <= p10) AND (1 <= p13))) R (p4 <= 0)) U (X (((p61 <= 0) OR (p64 <= 0))) OR F (((1 <= p15) AND (1 <= p99)))))
lola: processed formula length: 148
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 671853 markings, 2930034 edges
lola: ========================================
lola: subprocess 9 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p45) AND (1 <= p84))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p45) AND (1 <= p84))))
lola: processed formula length: 35
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 330 markings, 338 edges
lola: subprocess 10 will run for 1009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))) U (G (F (((1 <= p66) AND (1 <= p79)))) OR (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))) U (G (F (((1 <= p66) AND (1 <= p79)))) OR (1 <= p4)))
lola: processed formula length: 116
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 55 markings, 80 edges
lola: ========================================
lola: subprocess 11 will run for 1514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78)))) OR ((1 <= p6) AND (1 <= p22) AND (1 <= p26) AND (1 <= p41) AND (1 <= p52) AND (1 <= p63)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p22) AND (1 <= p26) AND (1 <= p41) AND (1 <= p52) AND (1 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p22) AND (1 <= p26) AND (1 <= p41) AND (1 <= p52) AND (1 <= p63))
lola: processed formula length: 86
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))
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 <= p5) AND (1 <= p20) AND (1 <= p21) AND (1 <= p27) AND (1 <= p40) AND (1 <= p51) AND (1 <= p78))))
lola: processed formula length: 109
lola: 76 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: 937 markings, 1345 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 3029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))) OR (F (((((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U G ((1 <= p2))) AND (1 <= p2))) OR ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))
lola: processed formula length: 57
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U G ((1 <= p2))) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U G ((1 <= p2))) AND (1 <= p2)))
lola: processed formula length: 95
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)))) OR (F (((((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94)) U G ((1 <= p2))) AND (1 <= p2))) OR ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))
lola: processed formula length: 57
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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: G (F (((1 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))))
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 <= p30) AND (1 <= p44) AND (1 <= p56) AND (1 <= p94))))
lola: processed formula length: 65
lola: 76 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: 2285 markings, 4534 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no no no yes yes yes
lola:
preliminary result: no no no yes yes yes no no no no yes yes yes
lola: ========================================
lola: memory consumption: 34180 KB
lola: time consumption: 542 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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r132-tall-162075428300186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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