About the Execution of 2020-gold for ShieldPPPs-PT-002A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16243.203 | 3600000.00 | 1966567.00 | 16502.70 | TFFFFTFFFT?FTFFF | normal |
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.r227-tall-162098231100266.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 ShieldPPPs-PT-002A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231100266
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 12:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 12:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 18K May 5 16:52 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 ShieldPPPs-PT-002A-00
FORMULA_NAME ShieldPPPs-PT-002A-01
FORMULA_NAME ShieldPPPs-PT-002A-02
FORMULA_NAME ShieldPPPs-PT-002A-03
FORMULA_NAME ShieldPPPs-PT-002A-04
FORMULA_NAME ShieldPPPs-PT-002A-05
FORMULA_NAME ShieldPPPs-PT-002A-06
FORMULA_NAME ShieldPPPs-PT-002A-07
FORMULA_NAME ShieldPPPs-PT-002A-08
FORMULA_NAME ShieldPPPs-PT-002A-09
FORMULA_NAME ShieldPPPs-PT-002A-10
FORMULA_NAME ShieldPPPs-PT-002A-11
FORMULA_NAME ShieldPPPs-PT-002A-12
FORMULA_NAME ShieldPPPs-PT-002A-13
FORMULA_NAME ShieldPPPs-PT-002A-14
FORMULA_NAME ShieldPPPs-PT-002A-15
=== Now, execution of the tool begins
BK_START 1621156420070
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 09:13:41] [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-16 09:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 09:13:41] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-16 09:13:41] [INFO ] Transformed 65 places.
[2021-05-16 09:13:41] [INFO ] Transformed 55 transitions.
[2021-05-16 09:13:41] [INFO ] Found NUPN structural information;
[2021-05-16 09:13:41] [INFO ] Parsed PT model containing 65 places and 55 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 969 steps, including 5 resets, run visited all 37 properties in 16 ms. (steps per millisecond=60 )
[2021-05-16 09:13:41] [INFO ] Flatten gal took : 31 ms
[2021-05-16 09:13:41] [INFO ] Applying decomposition
[2021-05-16 09:13:41] [INFO ] Flatten gal took : 9 ms
[2021-05-16 09:13:41] [INFO ] Decomposing Gal with order
[2021-05-16 09:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 09:13:41] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-16 09:13:42] [INFO ] Flatten gal took : 39 ms
[2021-05-16 09:13:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 7 ms.
[2021-05-16 09:13:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-16 09:13:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPs-PT-002A @ 3570 seconds
FORMULA ShieldPPPs-PT-002A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-002A-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1611
rslt: Output for LTLFireability @ ShieldPPPs-PT-002A
{
"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": "Sun May 16 09:13:42 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((X (((p20 <= 0) OR (p41 <= 0))) OR G ((((p42 <= 0) OR (p52 <= 0)) R X (G (((1 <= p47) AND (1 <= p64))))))))",
"processed_size": 112,
"rewrites": 55
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p49) AND (1 <= p58)) U (F (((1 <= p49) AND (1 <= p58))) AND ((1 <= p52))))",
"processed_size": 82,
"rewrites": 55
},
"result":
{
"edges": 298,
"markings": 298,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p49) AND (1 <= p58))))",
"processed_size": 35,
"rewrites": 55
},
"result":
{
"edges": 259,
"markings": 259,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p6) AND (1 <= p23)))",
"processed_size": 30,
"rewrites": 55
},
"result":
{
"edges": 180,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p4 <= 0) OR (p25 <= 0))))",
"processed_size": 34,
"rewrites": 55
},
"result":
{
"edges": 1973,
"markings": 1514,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p44) AND (1 <= p63))",
"processed_size": 27,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (F (((1 <= p18) AND (1 <= p29))))))",
"processed_size": 43,
"rewrites": 55
},
"result":
{
"edges": 493,
"markings": 280,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p6) AND (1 <= p23))))",
"processed_size": 34,
"rewrites": 55
},
"result":
{
"edges": 58819,
"markings": 22963,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p43) AND (1 <= p45)))) U (X (F (((1 <= p18) AND (1 <= p29)))) AND (((1 <= p18)) AND (((1 <= p27)) AND (((1 <= p43)) AND ((1 <= p45)))))))",
"processed_size": 151,
"rewrites": 55
},
"result":
{
"edges": 2720,
"markings": 1095,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F (((F (((1 <= p58))) U ((1 <= p53))) OR (F (((1 <= p15) AND (1 <= p57))) OR ((1 <= p53)))))))",
"processed_size": 100,
"rewrites": 55
},
"result":
{
"edges": 535,
"markings": 280,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X (F (((1 <= p3) AND (1 <= p30)))) AND (((1 <= p3)) AND ((1 <= p30))))))",
"processed_size": 79,
"rewrites": 55
},
"result":
{
"edges": 1199140,
"markings": 480994,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 452
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 452
},
"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": "((p22 <= 0))",
"processed_size": 12,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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 ((((p49 <= 0) OR (p58 <= 0)) R ((p22 <= 0))))",
"processed_size": 48,
"rewrites": 55
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 528
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 4,
"aconj": 7,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (((X (((1 <= p4) AND (1 <= p25))) U ((1 <= p6) AND (1 <= p22))) AND X ((F (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27))))) AND G ((((1 <= p18) AND (1 <= p27)) OR X (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27)))))))))))",
"processed_size": 256,
"rewrites": 55
},
"result":
{
"edges": 259,
"markings": 259,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 10,
"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": 633
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 3,
"U": 2,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G ((F (((1 <= p59))) AND (F (((1 <= p46))) OR (((1 <= p46)) U ((1 <= p59)))))) OR (G (((p1 <= 0) OR (p26 <= 0) OR ((1 <= p49) AND (1 <= p58)))) AND F (G ((F (((1 <= p59))) AND (F (((1 <= p46))) OR (((1 <= p46)) U ((1 <= p59))))))))))",
"processed_size": 239,
"rewrites": 55
},
"result":
{
"edges": 271,
"markings": 271,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 32
},
"compoundnumber": 11,
"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": 792
},
"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 <= p44) AND (1 <= p63) AND (1 <= p3) AND (1 <= p30))))",
"processed_size": 64,
"rewrites": 55
},
"result":
{
"edges": 282,
"markings": 282,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1056
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1056
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((p62 <= 0) OR ((1 <= p5) AND (1 <= p24)))",
"processed_size": 43,
"rewrites": 55
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p47 <= 0) OR (p62 <= 0)))",
"processed_size": 31,
"rewrites": 55
},
"result":
{
"edges": 215,
"markings": 215,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1584
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1584
},
"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 <= p37) AND (1 <= p53))))",
"processed_size": 35,
"rewrites": 55
},
"result":
{
"edges": 284,
"markings": 283,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3169
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((G ((((1 <= p35) AND (1 <= p56)) OR ((1 <= p13) AND (1 <= p32)))) AND (((1 <= p6)) AND ((1 <= p23)))))",
"processed_size": 106,
"rewrites": 55
},
"result":
{
"edges": 180,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3169
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3169
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p37 <= 0) OR (p53 <= 0)))",
"processed_size": 31,
"rewrites": 55
},
"result":
{
"edges": 196,
"markings": 196,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((G (F (((1 <= p37) AND (1 <= p53)))) OR F (((1 <= p52))))))",
"processed_size": 65,
"rewrites": 55
},
"result":
{
"edges": 282,
"markings": 281,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3492,
"runtime": 1959.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((X(*) OR G((* R X(G(*)))))) : ((** U (F(**) AND **)) OR X(G(**))) : (G(*) AND **) : (G(**) OR (F(G(**)) AND F(G((G(F(**)) OR F(**)))))) : ((X(**) OR (G(**) AND X(F(**)))) AND (F(G(*)) AND X(**))) : (X(X(X(F(**)))) OR **) : X(F(**)) : G(F(**)) : (X(G(**)) U (X(F(**)) AND (** AND (** AND (** AND **))))) : X(X(F(((F(**) U **) OR (F(**) OR **))))) : X((G(F(*)) OR **)) : X(G((X(F(**)) AND (** AND **)))) : (X((* R *)) AND **) : X(((X(**) U **) AND X((F(G(**)) AND G((** OR X(G(**)))))))) : (G((G(**) AND (** AND **))) OR F(G(**))) : X((G((F(**) AND (F(**) OR (** U **)))) OR (G(**) AND F(G((F(**) AND (F(**) OR (** U **))))))))"
},
"net":
{
"arcs": 206,
"conflict_clusters": 25,
"places": 65,
"places_significant": 42,
"singleton_clusters": 0,
"transitions": 55
},
"result":
{
"preliminary_value": "yes no no no no yes no no no yes unknown no yes no no no ",
"value": "yes no no no no yes no no no yes unknown no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 120/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 65
lola: finding significant places
lola: 65 places, 55 transitions, 42 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: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: F ((NOT(X (((1 <= p20) AND (1 <= p41)))) OR G (NOT((((1 <= p42) AND (1 <= p52)) U NOT(X (NOT(F (((p47 <= 0) OR (p64 <= 0))))))))))) : ((((1 <= p49) AND (1 <= p58)) U (F (((1 <= p49) AND (1 <= p58))) AND ((1 <= p52)))) OR G (X (((1 <= p49) AND (1 <= p58))))) : (NOT(F (((1 <= p47) AND (1 <= p62)))) AND ((p62 <= 0) OR ((1 <= p5) AND (1 <= p24)))) : (F (G ((G (F (((1 <= p37) AND (1 <= p53)))) OR F (((1 <= p52)))))) U G (((p37 <= 0) OR (p53 <= 0)))) : (((G (((1 <= p6) AND (1 <= p23))) U X (((1 <= p63)))) AND NOT(G (F (((1 <= p4) AND (1 <= p25)))))) AND X (((1 <= p6) AND (1 <= p23)))) : (X (X (F (X (((1 <= p18) AND (1 <= p29)))))) OR ((1 <= p44) AND (1 <= p63))) : F (X (((1 <= p6) AND (1 <= p23)))) : G (F (((1 <= p44) AND (1 <= p63) AND (1 <= p3) AND (1 <= p30)))) : (G (X (G (((1 <= p43) AND (1 <= p45))))) U ((((F (X (((1 <= p18) AND (1 <= p29)))) AND ((1 <= p18))) AND ((1 <= p27))) AND ((1 <= p43))) AND ((1 <= p45)))) : X (X (F ((((F ((((1 <= p53)) U ((1 <= p58)))) U ((1 <= p53))) OR F (((1 <= p15) AND (1 <= p57)))) OR ((1 <= p53)))))) : X ((F (G (NOT(G (((1 <= p6) AND (1 <= p22)))))) OR ((1 <= p22)))) : X (G (((F (X (((1 <= p3) AND (1 <= p30)))) AND ((1 <= p3))) AND ((1 <= p30))))) : (NOT(X ((((1 <= p49) AND (1 <= p58)) U ((1 <= p22))))) AND ((p22 <= 0))) : X (((X (((1 <= p4) AND (1 <= p25))) U ((1 <= p6) AND (1 <= p22))) AND X (G ((((1 <= p18) AND (1 <= p27)) U X (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27)))))))))) : (G (((G ((((1 <= p35) AND (1 <= p56)) OR ((1 <= p13) AND (1 <= p32)))) AND ((1 <= p6))) AND ((1 <= p23)))) OR X (G (F (G (((1 <= p37) AND (1 <= p53))))))) : X ((G (((p1 <= 0) OR (p26 <= 0) OR ((1 <= p49) AND (1 <= p58)))) U G ((F (((1 <= p46))) U (((1 <= p46)) U ((1 <= p59)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p20 <= 0) OR (p41 <= 0))) OR G ((((p42 <= 0) OR (p52 <= 0)) R X (G (((1 <= p47) AND (1 <= p64))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p20 <= 0) OR (p41 <= 0))) OR G ((((p42 <= 0) OR (p52 <= 0)) R X (G (((1 <= p47) AND (1 <= p64))))))))
lola: processed formula length: 112
lola: 55 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p49) AND (1 <= p58)) U (F (((1 <= p49) AND (1 <= p58))) AND ((1 <= p52)))) OR X (G (((1 <= p49) AND (1 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p49) AND (1 <= p58)) U (F (((1 <= p49) AND (1 <= p58))) AND ((1 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p49) AND (1 <= p58)) U (F (((1 <= p49) AND (1 <= p58))) AND ((1 <= p52))))
lola: processed formula length: 82
lola: 55 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: 298 markings, 298 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p49) AND (1 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p49) AND (1 <= p58))))
lola: processed formula length: 35
lola: 55 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: 259 markings, 259 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p63))) OR (G (((1 <= p6) AND (1 <= p23))) AND X (F (((1 <= p63)))))) AND (F (G (((p4 <= 0) OR (p25 <= 0)))) AND X (((1 <= p6) AND (1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p6) AND (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p6) AND (1 <= p23)))
lola: processed formula length: 30
lola: 55 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: 180 markings, 180 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p4 <= 0) OR (p25 <= 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 (((p4 <= 0) OR (p25 <= 0))))
lola: processed formula length: 34
lola: 55 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 52
lola: add low 1
lola: add low 21
lola: add low 22
lola: add low 42
lola: add low 43
lola: add low 51
lola: add low 2
lola: add low 23
lola: add low 27
lola: add low 31
lola: add low 9
lola: add low 34
lola: add low 33
lola: add low 35
lola: add low 37
lola: add low 10
lola: add low 24
lola: add low 36
lola: add low 11
lola: add low 19
lola: add low 14
lola: add low 12
lola: add low 20
lola: add low 31
lola: add low 12
lola: add low 20
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: 1514 markings, 1973 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (F (((1 <= p18) AND (1 <= p29)))))) OR ((1 <= p44) AND (1 <= p63)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p44) AND (1 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p44) AND (1 <= p63))
lola: processed formula length: 27
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p18) AND (1 <= p29))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p18) AND (1 <= p29))))))
lola: processed formula length: 43
lola: 55 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: 280 markings, 493 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p6) AND (1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p6) AND (1 <= p23))))
lola: processed formula length: 34
lola: 55 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: 22963 markings, 58819 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p43) AND (1 <= p45)))) U (X (F (((1 <= p18) AND (1 <= p29)))) AND (((1 <= p18)) AND (((1 <= p27)) AND (((1 <= p43)) AND ((1 <= p45)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p43) AND (1 <= p45)))) U (X (F (((1 <= p18) AND (1 <= p29)))) AND (((1 <= p18)) AND (((1 <= p27)) AND (((1 <= p43)) AND ((1 <= p45)))))))
lola: processed formula length: 151
lola: 55 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: 1095 markings, 2720 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((F (((1 <= p58))) U ((1 <= p53))) OR (F (((1 <= p15) AND (1 <= p57))) OR ((1 <= p53)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((F (((1 <= p58))) U ((1 <= p53))) OR (F (((1 <= p15) AND (1 <= p57))) OR ((1 <= p53)))))))
lola: processed formula length: 100
lola: 55 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: 280 markings, 535 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p6 <= 0) OR (p22 <= 0)))) OR ((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p6 <= 0) OR (p22 <= 0)))) OR ((1 <= p22))))
lola: processed formula length: 56
lola: 55 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: 1037759 markings, 5479637 edges, 207552 markings/sec, 0 secs
lola: 1946356 markings, 10191564 edges, 181719 markings/sec, 5 secs
lola: 2721326 markings, 15037708 edges, 154994 markings/sec, 10 secs
lola: 3563266 markings, 19347208 edges, 168388 markings/sec, 15 secs
lola: 4033563 markings, 23711513 edges, 94059 markings/sec, 20 secs
lola: 4801300 markings, 28029480 edges, 153547 markings/sec, 25 secs
lola: 5389126 markings, 32570735 edges, 117565 markings/sec, 30 secs
lola: 6193875 markings, 36494050 edges, 160950 markings/sec, 35 secs
lola: 6558314 markings, 40294659 edges, 72888 markings/sec, 40 secs
lola: 7336107 markings, 44886624 edges, 155559 markings/sec, 45 secs
lola: 8310574 markings, 49204696 edges, 194893 markings/sec, 50 secs
lola: 9023973 markings, 52945015 edges, 142680 markings/sec, 55 secs
lola: 9465922 markings, 57149906 edges, 88390 markings/sec, 60 secs
lola: 9874115 markings, 61036717 edges, 81639 markings/sec, 65 secs
lola: 10612635 markings, 65216539 edges, 147704 markings/sec, 70 secs
lola: 11314648 markings, 69342177 edges, 140403 markings/sec, 75 secs
lola: 12009669 markings, 73362182 edges, 139004 markings/sec, 80 secs
lola: 12926147 markings, 76789947 edges, 183296 markings/sec, 85 secs
lola: 13450165 markings, 80457607 edges, 104804 markings/sec, 90 secs
lola: 13883986 markings, 84107063 edges, 86764 markings/sec, 95 secs
lola: 14116368 markings, 87537829 edges, 46476 markings/sec, 100 secs
lola: 14505423 markings, 91356734 edges, 77811 markings/sec, 105 secs
lola: 15202318 markings, 95730379 edges, 139379 markings/sec, 110 secs
lola: 15938121 markings, 100019399 edges, 147161 markings/sec, 115 secs
lola: 16489706 markings, 104182493 edges, 110317 markings/sec, 120 secs
lola: 17220614 markings, 108036906 edges, 146182 markings/sec, 125 secs
lola: 17801104 markings, 112231851 edges, 116098 markings/sec, 130 secs
lola: 18623086 markings, 116106770 edges, 164396 markings/sec, 135 secs
lola: 19084026 markings, 120064728 edges, 92188 markings/sec, 140 secs
lola: 19677715 markings, 124022364 edges, 118738 markings/sec, 145 secs
lola: 20536261 markings, 127328957 edges, 171709 markings/sec, 150 secs
lola: 21067951 markings, 130415160 edges, 106338 markings/sec, 155 secs
lola: 21499858 markings, 133963270 edges, 86381 markings/sec, 160 secs
lola: 21649373 markings, 137039882 edges, 29903 markings/sec, 165 secs
lola: 21873233 markings, 140326997 edges, 44772 markings/sec, 170 secs
lola: 22624666 markings, 144293168 edges, 150287 markings/sec, 175 secs
lola: 22983195 markings, 147744408 edges, 71706 markings/sec, 180 secs
lola: 23487528 markings, 151872441 edges, 100867 markings/sec, 185 secs
lola: 24128885 markings, 155820138 edges, 128271 markings/sec, 190 secs
lola: 24584576 markings, 159595609 edges, 91138 markings/sec, 195 secs
lola: 25355730 markings, 162856618 edges, 154231 markings/sec, 200 secs
lola: 25882675 markings, 165988642 edges, 105389 markings/sec, 205 secs
lola: 26359840 markings, 169395458 edges, 95433 markings/sec, 210 secs
lola: 26504408 markings, 172382914 edges, 28914 markings/sec, 215 secs
lola: 26739513 markings, 175317892 edges, 47021 markings/sec, 220 secs
lola: 27715986 markings, 179519089 edges, 195295 markings/sec, 225 secs
lola: 28269182 markings, 183194392 edges, 110639 markings/sec, 230 secs
lola: 28457213 markings, 186735242 edges, 37606 markings/sec, 235 secs
lola: 29044996 markings, 190652678 edges, 117557 markings/sec, 240 secs
lola: 29838016 markings, 194666487 edges, 158604 markings/sec, 245 secs
lola: 30614546 markings, 198356345 edges, 155306 markings/sec, 250 secs
lola: 31312961 markings, 201343654 edges, 139683 markings/sec, 255 secs
lola: 31830372 markings, 204400429 edges, 103482 markings/sec, 260 secs
lola: 32282116 markings, 207836173 edges, 90349 markings/sec, 265 secs
lola: 32633682 markings, 211776982 edges, 70313 markings/sec, 270 secs
lola: 32642026 markings, 214747685 edges, 1669 markings/sec, 275 secs
lola: 33047299 markings, 218338158 edges, 81055 markings/sec, 280 secs
lola: 33987034 markings, 222573558 edges, 187947 markings/sec, 285 secs
lola: 34535438 markings, 226591890 edges, 109681 markings/sec, 290 secs
lola: 34923396 markings, 230505331 edges, 77592 markings/sec, 295 secs
lola: 35586282 markings, 235057707 edges, 132577 markings/sec, 300 secs
lola: 36709249 markings, 238503229 edges, 224593 markings/sec, 305 secs
lola: 37444841 markings, 241615085 edges, 147118 markings/sec, 310 secs
lola: 37957474 markings, 244776947 edges, 102527 markings/sec, 315 secs
lola: 38351744 markings, 247967677 edges, 78854 markings/sec, 320 secs
lola: 38716302 markings, 251534550 edges, 72912 markings/sec, 325 secs
lola: 38851591 markings, 254728014 edges, 27058 markings/sec, 330 secs
lola: 38854942 markings, 257372699 edges, 670 markings/sec, 335 secs
lola: 39376676 markings, 260584331 edges, 104347 markings/sec, 340 secs
lola: 40142355 markings, 264334607 edges, 153136 markings/sec, 345 secs
lola: 40783256 markings, 267485719 edges, 128180 markings/sec, 350 secs
lola: 41256221 markings, 270662505 edges, 94593 markings/sec, 355 secs
lola: 41688977 markings, 274247281 edges, 86551 markings/sec, 360 secs
lola: 41778198 markings, 277329250 edges, 17844 markings/sec, 365 secs
lola: 42130237 markings, 280594113 edges, 70408 markings/sec, 370 secs
lola: 42893245 markings, 284357372 edges, 152602 markings/sec, 375 secs
lola: 43407450 markings, 288173513 edges, 102841 markings/sec, 380 secs
lola: 43629993 markings, 291571510 edges, 44509 markings/sec, 385 secs
lola: 44459277 markings, 294869304 edges, 165857 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes no unknown unknown no yes no unknown no yes unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6229832 KB
lola: time consumption: 399 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 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F (((1 <= p3) AND (1 <= p30)))) AND (((1 <= p3)) AND ((1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F (((1 <= p3) AND (1 <= p30)))) AND (((1 <= p3)) AND ((1 <= p30))))))
lola: processed formula length: 79
lola: 55 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: 480994 markings, 1199140 edges
lola: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p49 <= 0) OR (p58 <= 0)) R ((p22 <= 0)))) AND ((p22 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p22 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p22 <= 0))
lola: processed formula length: 12
lola: 55 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 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p49 <= 0) OR (p58 <= 0)) R ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p49 <= 0) OR (p58 <= 0)) R ((p22 <= 0))))
lola: processed formula length: 48
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((1 <= p4) AND (1 <= p25))) U ((1 <= p6) AND (1 <= p22))) AND X ((F (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27))))) AND G ((((1 <= p18) AND (1 <= p27)) OR X (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((1 <= p4) AND (1 <= p25))) U ((1 <= p6) AND (1 <= p22))) AND X ((F (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27))))) AND G ((((1 <= p18) AND (1 <= p27)) OR X (G ((((1 <= p4) AND (1 <= p25)) OR ((1 <= p18) AND (1 <= p27)))))))))))
lola: processed formula length: 256
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 259 markings, 259 edges
lola: ========================================
lola: subprocess 11 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((F (((1 <= p59))) AND (F (((1 <= p46))) OR (((1 <= p46)) U ((1 <= p59)))))) OR (G (((p1 <= 0) OR (p26 <= 0) OR ((1 <= p49) AND (1 <= p58)))) AND F (G ((F (((1 <= p59))) AND (F (((1 <= p46))) OR (((1 <= p46)) U ((1 <= p59))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((F (((1 <= p59))) AND (F (((1 <= p46))) OR (((1 <= p46)) U ((1 <= p59)))))) OR (G (((p1 <= 0) OR (p26 <= 0) OR ((1 <= p49) AND (1 <= p58)))) AND F (G ((F (((1 <= p59))) AND (F (((1 <= p46))) OR (((1 <= p46)) U ((1 <= p59))))))))))
lola: processed formula length: 239
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 32 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 271 markings, 271 edges
lola: ========================================
lola: subprocess 12 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p44) AND (1 <= p63) AND (1 <= p3) AND (1 <= p30))))
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 <= p44) AND (1 <= p63) AND (1 <= p3) AND (1 <= p30))))
lola: processed formula length: 64
lola: 55 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: 282 markings, 282 edges
lola: ========================================
lola: subprocess 13 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p47 <= 0) OR (p62 <= 0))) AND ((p62 <= 0) OR ((1 <= p5) AND (1 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p62 <= 0) OR ((1 <= p5) AND (1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p62 <= 0) OR ((1 <= p5) AND (1 <= p24)))
lola: processed formula length: 43
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 14 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p47 <= 0) OR (p62 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p47 <= 0) OR (p62 <= 0)))
lola: processed formula length: 31
lola: 55 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: 215 markings, 215 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G ((((1 <= p35) AND (1 <= p56)) OR ((1 <= p13) AND (1 <= p32)))) AND (((1 <= p6)) AND ((1 <= p23))))) OR F (G (((1 <= p37) AND (1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p37) AND (1 <= p53))))
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 <= p37) AND (1 <= p53))))
lola: processed formula length: 35
lola: 55 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: 283 markings, 284 edges
lola: ========================================
lola: subprocess 15 will run for 3169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((1 <= p35) AND (1 <= p56)) OR ((1 <= p13) AND (1 <= p32)))) AND (((1 <= p6)) AND ((1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((1 <= p35) AND (1 <= p56)) OR ((1 <= p13) AND (1 <= p32)))) AND (((1 <= p6)) AND ((1 <= p23)))))
lola: processed formula length: 106
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 180 markings, 180 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p37 <= 0) OR (p53 <= 0))) OR (F (G (((p37 <= 0) OR (p53 <= 0)))) AND F (G ((G (F (((1 <= p37) AND (1 <= p53)))) OR F (((1 <= p52))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p37 <= 0) OR (p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p37 <= 0) OR (p53 <= 0)))
lola: processed formula length: 31
lola: 55 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: 196 markings, 196 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((1 <= p37) AND (1 <= p53)))) OR F (((1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((1 <= p37) AND (1 <= p53)))) OR F (((1 <= p52))))))
lola: processed formula length: 65
lola: 55 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 281 markings, 282 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p6 <= 0) OR (p22 <= 0)))) OR ((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p6 <= 0) OR (p22 <= 0)))) OR ((1 <= p22))))
lola: processed formula length: 56
lola: 55 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: 1012986 markings, 5375744 edges, 202597 markings/sec, 0 secs
lola: 1931144 markings, 10096586 edges, 183632 markings/sec, 5 secs
lola: 2720120 markings, 15029382 edges, 157795 markings/sec, 10 secs
lola: 3569734 markings, 19402124 edges, 169923 markings/sec, 15 secs
lola: 4089027 markings, 24061959 edges, 103859 markings/sec, 20 secs
lola: 4825052 markings, 28490658 edges, 147205 markings/sec, 25 secs
lola: 5533506 markings, 33257287 edges, 141691 markings/sec, 30 secs
lola: 6315580 markings, 37290723 edges, 156415 markings/sec, 35 secs
lola: 6703594 markings, 41290702 edges, 77603 markings/sec, 40 secs
lola: 7572201 markings, 46103303 edges, 173721 markings/sec, 45 secs
lola: 8587448 markings, 50252907 edges, 203049 markings/sec, 50 secs
lola: 9202201 markings, 54252677 edges, 122951 markings/sec, 55 secs
lola: 9473810 markings, 58371958 edges, 54322 markings/sec, 60 secs
lola: 10257247 markings, 62542046 edges, 156687 markings/sec, 65 secs
lola: 10768460 markings, 66831688 edges, 102243 markings/sec, 70 secs
lola: 11539005 markings, 71338158 edges, 154109 markings/sec, 75 secs
lola: 12508217 markings, 74903081 edges, 193842 markings/sec, 80 secs
lola: 13179679 markings, 78411275 edges, 134292 markings/sec, 85 secs
lola: 13658043 markings, 82125840 edges, 95673 markings/sec, 90 secs
lola: 14083533 markings, 85891597 edges, 85098 markings/sec, 95 secs
lola: 14117451 markings, 88728581 edges, 6784 markings/sec, 100 secs
lola: 14930482 markings, 93425927 edges, 162606 markings/sec, 105 secs
lola: 15533928 markings, 97947350 edges, 120689 markings/sec, 110 secs
lola: 16061716 markings, 101768696 edges, 105558 markings/sec, 115 secs
lola: 16958718 markings, 106045766 edges, 179400 markings/sec, 120 secs
lola: 17335153 markings, 109780375 edges, 75287 markings/sec, 125 secs
lola: 18268026 markings, 114060188 edges, 186575 markings/sec, 130 secs
lola: 18777512 markings, 117645361 edges, 101897 markings/sec, 135 secs
lola: 19408106 markings, 121455657 edges, 126119 markings/sec, 140 secs
lola: 19958087 markings, 125219852 edges, 109996 markings/sec, 145 secs
lola: 20730503 markings, 128342091 edges, 154483 markings/sec, 150 secs
lola: 21225926 markings, 131511151 edges, 99085 markings/sec, 155 secs
lola: 21614774 markings, 135219352 edges, 77770 markings/sec, 160 secs
lola: 21649993 markings, 137918572 edges, 7044 markings/sec, 165 secs
lola: 22095962 markings, 141892866 edges, 89194 markings/sec, 170 secs
lola: 22796199 markings, 145429222 edges, 140047 markings/sec, 175 secs
lola: 23039559 markings, 148834234 edges, 48672 markings/sec, 180 secs
lola: 23764986 markings, 153169358 edges, 145085 markings/sec, 185 secs
lola: 24169786 markings, 156840475 edges, 80960 markings/sec, 190 secs
lola: 24827504 markings, 160682648 edges, 131544 markings/sec, 195 secs
lola: 25523204 markings, 163768531 edges, 139140 markings/sec, 200 secs
lola: 26014115 markings, 166874429 edges, 98182 markings/sec, 205 secs
lola: 26474579 markings, 170454337 edges, 92093 markings/sec, 210 secs
lola: 26504984 markings, 173082001 edges, 6081 markings/sec, 215 secs
lola: 26940008 markings, 176665397 edges, 87005 markings/sec, 220 secs
lola: 27939165 markings, 180641419 edges, 199831 markings/sec, 225 secs
lola: 28435913 markings, 185007434 edges, 99350 markings/sec, 230 secs
lola: 28884405 markings, 188919616 edges, 89698 markings/sec, 235 secs
lola: 29643425 markings, 193243456 edges, 151804 markings/sec, 240 secs
lola: 30381887 markings, 197642491 edges, 147692 markings/sec, 245 secs
lola: 31268283 markings, 201111393 edges, 177279 markings/sec, 250 secs
lola: 31837637 markings, 204450139 edges, 113871 markings/sec, 255 secs
lola: 32308356 markings, 208056362 edges, 94144 markings/sec, 260 secs
lola: 32636180 markings, 211936775 edges, 65565 markings/sec, 265 secs
lola: 32642090 markings, 214878429 edges, 1182 markings/sec, 270 secs
lola: 33062498 markings, 218476878 edges, 84082 markings/sec, 275 secs
lola: 33942604 markings, 222394748 edges, 176021 markings/sec, 280 secs
lola: 34473854 markings, 225919046 edges, 106250 markings/sec, 285 secs
lola: 34632957 markings, 229410063 edges, 31821 markings/sec, 290 secs
lola: 35391278 markings, 233613720 edges, 151664 markings/sec, 295 secs
lola: 36324111 markings, 237252056 edges, 186567 markings/sec, 300 secs
lola: 37207082 markings, 240440115 edges, 176594 markings/sec, 305 secs
lola: 37790218 markings, 243650184 edges, 116627 markings/sec, 310 secs
lola: 38233612 markings, 246955880 edges, 88679 markings/sec, 315 secs
lola: 38625232 markings, 250539704 edges, 78324 markings/sec, 320 secs
lola: 38850369 markings, 254184711 edges, 45027 markings/sec, 325 secs
lola: 38854877 markings, 257043078 edges, 902 markings/sec, 330 secs
lola: 39302506 markings, 260244177 edges, 89526 markings/sec, 335 secs
lola: 40050934 markings, 264015161 edges, 149686 markings/sec, 340 secs
lola: 40721609 markings, 267115329 edges, 134135 markings/sec, 345 secs
lola: 41178087 markings, 270116682 edges, 91296 markings/sec, 350 secs
lola: 41596782 markings, 273332578 edges, 83739 markings/sec, 355 secs
lola: 41776995 markings, 276361678 edges, 36043 markings/sec, 360 secs
lola: 41778616 markings, 278892929 edges, 324 markings/sec, 365 secs
lola: 42498939 markings, 282098439 edges, 144065 markings/sec, 370 secs
lola: 43041944 markings, 285352423 edges, 108601 markings/sec, 375 secs
lola: 43472122 markings, 288704142 edges, 86036 markings/sec, 380 secs
lola: 43629988 markings, 291545504 edges, 31573 markings/sec, 385 secs
lola: 44410757 markings, 294723483 edges, 156154 markings/sec, 390 secs
lola: 45330428 markings, 297583039 edges, 183934 markings/sec, 395 secs
lola: 46003412 markings, 300239032 edges, 134597 markings/sec, 400 secs
lola: 46548032 markings, 302982220 edges, 108924 markings/sec, 405 secs
lola: 47005524 markings, 305692782 edges, 91498 markings/sec, 410 secs
lola: 47432806 markings, 308450840 edges, 85456 markings/sec, 415 secs
lola: 47844930 markings, 311180995 edges, 82425 markings/sec, 420 secs
lola: 48259316 markings, 314063941 edges, 82877 markings/sec, 425 secs
lola: 48650417 markings, 316994349 edges, 78220 markings/sec, 430 secs
lola: 49012474 markings, 320341386 edges, 72411 markings/sec, 435 secs
lola: 49343815 markings, 323913328 edges, 66268 markings/sec, 440 secs
lola: 49371905 markings, 326491133 edges, 5618 markings/sec, 445 secs
lola: 49388432 markings, 328916678 edges, 3305 markings/sec, 450 secs
lola: 49391220 markings, 331306449 edges, 558 markings/sec, 455 secs
lola: 49391963 markings, 333730859 edges, 149 markings/sec, 460 secs
lola: 49457057 markings, 336412553 edges, 13019 markings/sec, 465 secs
lola: 50153528 markings, 340819696 edges, 139294 markings/sec, 470 secs
lola: 50749186 markings, 344855084 edges, 119132 markings/sec, 475 secs
lola: 51433637 markings, 348768569 edges, 136890 markings/sec, 480 secs
lola: 52118741 markings, 352146518 edges, 137021 markings/sec, 485 secs
lola: 52647003 markings, 355397340 edges, 105652 markings/sec, 490 secs
lola: 53106890 markings, 358786361 edges, 91977 markings/sec, 495 secs
lola: 53247462 markings, 361728572 edges, 28114 markings/sec, 500 secs
lola: 53584097 markings, 365099735 edges, 67327 markings/sec, 505 secs
lola: 54465525 markings, 369102048 edges, 176286 markings/sec, 510 secs
lola: 54982920 markings, 373568847 edges, 103479 markings/sec, 515 secs
lola: 55703557 markings, 377600778 edges, 144127 markings/sec, 520 secs
lola: 56316734 markings, 382194313 edges, 122635 markings/sec, 525 secs
lola: 57268857 markings, 385831550 edges, 190425 markings/sec, 530 secs
lola: 58113007 markings, 389396656 edges, 168830 markings/sec, 535 secs
lola: 58667032 markings, 393231969 edges, 110805 markings/sec, 540 secs
lola: 59098844 markings, 396615763 edges, 86362 markings/sec, 545 secs
lola: 59490363 markings, 400251110 edges, 78304 markings/sec, 550 secs
lola: 59599365 markings, 403454904 edges, 21800 markings/sec, 555 secs
lola: 59832720 markings, 406265410 edges, 46671 markings/sec, 560 secs
lola: 60445641 markings, 410548311 edges, 122584 markings/sec, 565 secs
lola: 61201607 markings, 414003626 edges, 151193 markings/sec, 570 secs
lola: 61757865 markings, 417943149 edges, 111252 markings/sec, 575 secs
lola: 62063333 markings, 421889133 edges, 61094 markings/sec, 580 secs
lola: 62996015 markings, 425441584 edges, 186536 markings/sec, 585 secs
lola: 63475676 markings, 429686309 edges, 95932 markings/sec, 590 secs
lola: 63809517 markings, 433742968 edges, 66768 markings/sec, 595 secs
lola: 64928762 markings, 437160946 edges, 223849 markings/sec, 600 secs
lola: 65726206 markings, 440350438 edges, 159489 markings/sec, 605 secs
lola: 66261371 markings, 443784245 edges, 107033 markings/sec, 610 secs
lola: 66699530 markings, 447188470 edges, 87632 markings/sec, 615 secs
lola: 67092900 markings, 450620001 edges, 78674 markings/sec, 620 secs
lola: 67483921 markings, 454324506 edges, 78204 markings/sec, 625 secs
lola: 67637327 markings, 457579381 edges, 30681 markings/sec, 630 secs
lola: 67639161 markings, 460461014 edges, 367 markings/sec, 635 secs
lola: 68303655 markings, 464641596 edges, 132899 markings/sec, 640 secs
lola: 68785862 markings, 468830773 edges, 96441 markings/sec, 645 secs
lola: 69269905 markings, 472688080 edges, 96809 markings/sec, 650 secs
lola: 70104461 markings, 475743719 edges, 166911 markings/sec, 655 secs
lola: 70666215 markings, 478568532 edges, 112351 markings/sec, 660 secs
lola: 71135787 markings, 481571306 edges, 93914 markings/sec, 665 secs
lola: 71570891 markings, 485019683 edges, 87021 markings/sec, 670 secs
lola: 71708641 markings, 487935455 edges, 27550 markings/sec, 675 secs
lola: 71716665 markings, 490382178 edges, 1605 markings/sec, 680 secs
lola: 72052954 markings, 493871155 edges, 67258 markings/sec, 685 secs
lola: 72701375 markings, 497814207 edges, 129684 markings/sec, 690 secs
lola: 73062254 markings, 501629599 edges, 72176 markings/sec, 695 secs
lola: 73729384 markings, 505461060 edges, 133426 markings/sec, 700 secs
lola: 74382455 markings, 508607581 edges, 130614 markings/sec, 705 secs
lola: 74874606 markings, 511920859 edges, 98430 markings/sec, 710 secs
lola: 75278763 markings, 515500974 edges, 80831 markings/sec, 715 secs
lola: 75294130 markings, 518030283 edges, 3073 markings/sec, 720 secs
lola: 75788768 markings, 521282524 edges, 98928 markings/sec, 725 secs
lola: 76182993 markings, 524759219 edges, 78845 markings/sec, 730 secs
lola: 76855836 markings, 527708637 edges, 134569 markings/sec, 735 secs
lola: 77522534 markings, 530470465 edges, 133340 markings/sec, 740 secs
lola: 78065364 markings, 533160933 edges, 108566 markings/sec, 745 secs
lola: 78540786 markings, 535867972 edges, 95084 markings/sec, 750 secs
lola: 78984004 markings, 538578593 edges, 88644 markings/sec, 755 secs
lola: 79404897 markings, 541365272 edges, 84179 markings/sec, 760 secs
lola: 79828770 markings, 544397959 edges, 84775 markings/sec, 765 secs
lola: 80265994 markings, 547906639 edges, 87445 markings/sec, 770 secs
lola: 80409211 markings, 550764962 edges, 28643 markings/sec, 775 secs
lola: 80421105 markings, 553138275 edges, 2379 markings/sec, 780 secs
lola: 80423909 markings, 555436217 edges, 561 markings/sec, 785 secs
lola: 80424768 markings, 557765724 edges, 172 markings/sec, 790 secs
lola: 80927822 markings, 561073020 edges, 100611 markings/sec, 795 secs
lola: 81517785 markings, 565409671 edges, 117993 markings/sec, 800 secs
lola: 82307523 markings, 569049841 edges, 157948 markings/sec, 805 secs
lola: 82825177 markings, 572625369 edges, 103531 markings/sec, 810 secs
lola: 83263499 markings, 576565679 edges, 87664 markings/sec, 815 secs
lola: 83511967 markings, 579826036 edges, 49694 markings/sec, 820 secs
lola: 84206463 markings, 584282196 edges, 138899 markings/sec, 825 secs
lola: 85181067 markings, 587989776 edges, 194921 markings/sec, 830 secs
lola: 86177469 markings, 591375612 edges, 199280 markings/sec, 835 secs
lola: 86759588 markings, 594351927 edges, 116424 markings/sec, 840 secs
lola: 87204962 markings, 597334360 edges, 89075 markings/sec, 845 secs
lola: 87605293 markings, 600518598 edges, 80066 markings/sec, 850 secs
lola: 87986996 markings, 604227992 edges, 76341 markings/sec, 855 secs
lola: 88262437 markings, 607914179 edges, 55088 markings/sec, 860 secs
lola: 88273738 markings, 610633823 edges, 2260 markings/sec, 865 secs
lola: 88274723 markings, 613186895 edges, 197 markings/sec, 870 secs
lola: 88979650 markings, 616586137 edges, 140985 markings/sec, 875 secs
lola: 89522676 markings, 620503880 edges, 108605 markings/sec, 880 secs
lola: 89931639 markings, 624482269 edges, 81793 markings/sec, 885 secs
lola: 90870683 markings, 627740366 edges, 187809 markings/sec, 890 secs
lola: 91765274 markings, 630619950 edges, 178918 markings/sec, 895 secs
lola: 92426114 markings, 633298392 edges, 132168 markings/sec, 900 secs
lola: 92981993 markings, 635962946 edges, 111176 markings/sec, 905 secs
lola: 93474988 markings, 638643867 edges, 98599 markings/sec, 910 secs
lola: 93937811 markings, 641390269 edges, 92565 markings/sec, 915 secs
lola: 94368032 markings, 644279483 edges, 86044 markings/sec, 920 secs
lola: 94775967 markings, 647327631 edges, 81587 markings/sec, 925 secs
lola: 95164587 markings, 650548126 edges, 77724 markings/sec, 930 secs
lola: 95538019 markings, 653804762 edges, 74686 markings/sec, 935 secs
lola: 95885448 markings, 657238417 edges, 69486 markings/sec, 940 secs
lola: 96058010 markings, 660540063 edges, 34512 markings/sec, 945 secs
lola: 96067038 markings, 663058896 edges, 1806 markings/sec, 950 secs
lola: 96068501 markings, 665549981 edges, 293 markings/sec, 955 secs
lola: 96069661 markings, 668026197 edges, 232 markings/sec, 960 secs
lola: 96070600 markings, 670532646 edges, 188 markings/sec, 965 secs
lola: 96305516 markings, 673345415 edges, 46983 markings/sec, 970 secs
lola: 97104994 markings, 677470961 edges, 159896 markings/sec, 975 secs
lola: 97580065 markings, 681403844 edges, 95014 markings/sec, 980 secs
lola: 98269295 markings, 685297251 edges, 137846 markings/sec, 985 secs
lola: 98974326 markings, 688743296 edges, 141006 markings/sec, 990 secs
lola: 99853507 markings, 691742934 edges, 175836 markings/sec, 995 secs
lola: 100499392 markings, 694672340 edges, 129177 markings/sec, 1000 secs
lola: 100983482 markings, 697709551 edges, 96818 markings/sec, 1005 secs
lola: 101386848 markings, 700918471 edges, 80673 markings/sec, 1010 secs
lola: 101728625 markings, 704238309 edges, 68355 markings/sec, 1015 secs
lola: 101936613 markings, 707583869 edges, 41598 markings/sec, 1020 secs
lola: 101954053 markings, 710235447 edges, 3488 markings/sec, 1025 secs
lola: 101957856 markings, 712883021 edges, 761 markings/sec, 1030 secs
lola: 102710539 markings, 716328014 edges, 150537 markings/sec, 1035 secs
lola: 103328544 markings, 720180918 edges, 123601 markings/sec, 1040 secs
lola: 103821111 markings, 724247791 edges, 98513 markings/sec, 1045 secs
lola: 104041027 markings, 727704075 edges, 43983 markings/sec, 1050 secs
lola: 104970701 markings, 730777272 edges, 185935 markings/sec, 1055 secs
lola: 105929452 markings, 733840951 edges, 191750 markings/sec, 1060 secs
lola: 106744307 markings, 736698160 edges, 162971 markings/sec, 1065 secs
lola: 107481482 markings, 739593804 edges, 147435 markings/sec, 1070 secs
lola: 108097586 markings, 742394462 edges, 123221 markings/sec, 1075 secs
lola: 108621823 markings, 745192849 edges, 104847 markings/sec, 1080 secs
lola: 109095093 markings, 748063136 edges, 94654 markings/sec, 1085 secs
lola: 109507964 markings, 750968471 edges, 82574 markings/sec, 1090 secs
lola: 109898890 markings, 753900213 edges, 78185 markings/sec, 1095 secs
lola: 110271261 markings, 756878191 edges, 74474 markings/sec, 1100 secs
lola: 110629202 markings, 759925779 edges, 71588 markings/sec, 1105 secs
lola: 110976537 markings, 763179909 edges, 69467 markings/sec, 1110 secs
lola: 111317286 markings, 766791920 edges, 68150 markings/sec, 1115 secs
lola: 111429801 markings, 769743909 edges, 22503 markings/sec, 1120 secs
lola: 111439077 markings, 772284290 edges, 1855 markings/sec, 1125 secs
lola: 111443127 markings, 774752662 edges, 810 markings/sec, 1130 secs
lola: 111444375 markings, 777178775 edges, 250 markings/sec, 1135 secs
lola: 111444921 markings, 779589960 edges, 109 markings/sec, 1140 secs
lola: 111445120 markings, 782004980 edges, 40 markings/sec, 1145 secs
lola: 112139727 markings, 785206384 edges, 138921 markings/sec, 1150 secs
lola: 112679416 markings, 788792670 edges, 107938 markings/sec, 1155 secs
lola: 112914548 markings, 792151174 edges, 47026 markings/sec, 1160 secs
lola: 113885159 markings, 795475556 edges, 194122 markings/sec, 1165 secs
lola: 114750080 markings, 798403872 edges, 172984 markings/sec, 1170 secs
lola: 115367739 markings, 801216583 edges, 123532 markings/sec, 1175 secs
lola: 115755056 markings, 803448880 edges, 77463 markings/sec, 1180 secs
lola: 116105745 markings, 805755327 edges, 70138 markings/sec, 1185 secs
lola: 116487927 markings, 808488442 edges, 76436 markings/sec, 1190 secs
lola: 116874546 markings, 811317626 edges, 77324 markings/sec, 1195 secs
lola: 117274650 markings, 814235255 edges, 80021 markings/sec, 1200 secs
lola: 117670483 markings, 817263234 edges, 79167 markings/sec, 1205 secs
lola: 118026022 markings, 820218636 edges, 71108 markings/sec, 1210 secs
lola: 118172738 markings, 823140829 edges, 29343 markings/sec, 1215 secs
lola: 118181115 markings, 825650491 edges, 1675 markings/sec, 1220 secs
lola: 118183862 markings, 827896496 edges, 549 markings/sec, 1225 secs
lola: 118184677 markings, 830166674 edges, 163 markings/sec, 1230 secs
lola: 118184869 markings, 832505990 edges, 38 markings/sec, 1235 secs
lola: 118879048 markings, 835282484 edges, 138836 markings/sec, 1240 secs
lola: 119445263 markings, 838096242 edges, 113243 markings/sec, 1245 secs
lola: 119898704 markings, 840975800 edges, 90688 markings/sec, 1250 secs
lola: 120244458 markings, 843463760 edges, 69151 markings/sec, 1255 secs
lola: 120575859 markings, 846192057 edges, 66280 markings/sec, 1260 secs
lola: 120900799 markings, 848982041 edges, 64988 markings/sec, 1265 secs
lola: 120976225 markings, 851448166 edges, 15085 markings/sec, 1270 secs
lola: 121043809 markings, 853818196 edges, 13517 markings/sec, 1275 secs
lola: 122024965 markings, 856721833 edges, 196231 markings/sec, 1280 secs
lola: 122852580 markings, 859324506 edges, 165523 markings/sec, 1285 secs
lola: 123572361 markings, 861586922 edges, 143956 markings/sec, 1290 secs
lola: 124211334 markings, 863755904 edges, 127795 markings/sec, 1295 secs
lola: 124749263 markings, 865851885 edges, 107586 markings/sec, 1300 secs
lola: 125227472 markings, 868057981 edges, 95642 markings/sec, 1305 secs
lola: 125692040 markings, 870478404 edges, 92914 markings/sec, 1310 secs
lola: 126098495 markings, 872758484 edges, 81291 markings/sec, 1315 secs
lola: 126510676 markings, 875122066 edges, 82436 markings/sec, 1320 secs
lola: 126882847 markings, 877355431 edges, 74434 markings/sec, 1325 secs
lola: 127251374 markings, 879640897 edges, 73705 markings/sec, 1330 secs
lola: 127594027 markings, 881841704 edges, 68531 markings/sec, 1335 secs
lola: 127937913 markings, 884083804 edges, 68777 markings/sec, 1340 secs
lola: 128256889 markings, 886228436 edges, 63795 markings/sec, 1345 secs
lola: 128608458 markings, 888621289 edges, 70314 markings/sec, 1350 secs
lola: 128936474 markings, 890967793 edges, 65603 markings/sec, 1355 secs
lola: 129231180 markings, 893130857 edges, 58941 markings/sec, 1360 secs
lola: 129557191 markings, 895572630 edges, 65202 markings/sec, 1365 secs
lola: 129865674 markings, 897977740 edges, 61697 markings/sec, 1370 secs
lola: 130185563 markings, 900530292 edges, 63978 markings/sec, 1375 secs
lola: 130482572 markings, 903095279 edges, 59402 markings/sec, 1380 secs
lola: 130795660 markings, 906041035 edges, 62618 markings/sec, 1385 secs
lola: 130982002 markings, 908942033 edges, 37268 markings/sec, 1390 secs
lola: 131005076 markings, 911193441 edges, 4615 markings/sec, 1395 secs
lola: 131010542 markings, 913394704 edges, 1093 markings/sec, 1400 secs
lola: 131013456 markings, 915609030 edges, 583 markings/sec, 1405 secs
lola: 131015771 markings, 917822789 edges, 463 markings/sec, 1410 secs
lola: 131016635 markings, 920039693 edges, 173 markings/sec, 1415 secs
lola: 131017504 markings, 922234436 edges, 174 markings/sec, 1420 secs
lola: 131018650 markings, 924425125 edges, 229 markings/sec, 1425 secs
lola: 131019608 markings, 926634785 edges, 192 markings/sec, 1430 secs
lola: 131020045 markings, 928842644 edges, 87 markings/sec, 1435 secs
lola: 131020163 markings, 931060371 edges, 24 markings/sec, 1440 secs
lola: 131435071 markings, 934602057 edges, 82982 markings/sec, 1445 secs
lola: 132022590 markings, 938527349 edges, 117504 markings/sec, 1450 secs
lola: 132591057 markings, 942390546 edges, 113693 markings/sec, 1455 secs
lola: 133154825 markings, 946170636 edges, 112754 markings/sec, 1460 secs
lola: 133742115 markings, 949668022 edges, 117458 markings/sec, 1465 secs
lola: 134513624 markings, 952808540 edges, 154302 markings/sec, 1470 secs
lola: 134935453 markings, 956053831 edges, 84366 markings/sec, 1475 secs
lola: 135143692 markings, 959256270 edges, 41648 markings/sec, 1480 secs
lola: 135779444 markings, 962555042 edges, 127150 markings/sec, 1485 secs
lola: 136012553 markings, 965559762 edges, 46622 markings/sec, 1490 secs
lola: 136597992 markings, 968926252 edges, 117088 markings/sec, 1495 secs
lola: 137158791 markings, 971578099 edges, 112160 markings/sec, 1500 secs
lola: 137723106 markings, 974270107 edges, 112863 markings/sec, 1505 secs
lola: 138153033 markings, 976888393 edges, 85985 markings/sec, 1510 secs
lola: 138494441 markings, 979618573 edges, 68282 markings/sec, 1515 secs
lola: 138657952 markings, 982461709 edges, 32702 markings/sec, 1520 secs
lola: 138678613 markings, 985026948 edges, 4132 markings/sec, 1525 secs
lola: 139307220 markings, 988989922 edges, 125721 markings/sec, 1530 secs
lola: 139760236 markings, 992314893 edges, 90603 markings/sec, 1535 secs
lola: 140144010 markings, 995186174 edges, 76755 markings/sec, 1540 secs
lola: 140596535 markings, 998158508 edges, 90505 markings/sec, 1545 secs
lola: 140875110 markings, 999424336 edges, 55715 markings/sec, 1550 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no yes unknown no yes no no no
lola:
preliminary result: yes no no no no yes no no no yes unknown no yes no no no
lola: memory consumption: 3492 KB
lola: time consumption: 1959 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="ShieldPPPs-PT-002A"
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 ShieldPPPs-PT-002A, 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 r227-tall-162098231100266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-002A.tgz
mv ShieldPPPs-PT-002A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;