About the Execution of ITS-LoLa for Solitaire-PT-EngNC7x7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.250 | 3600000.00 | 259632.00 | 1164.70 | FFFFFFFFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389600162.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Solitaire-PT-EngNC7x7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389600162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 9 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 69K Apr 27 15:14 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Solitaire-PT-EngNC7x7-00
FORMULA_NAME Solitaire-PT-EngNC7x7-01
FORMULA_NAME Solitaire-PT-EngNC7x7-02
FORMULA_NAME Solitaire-PT-EngNC7x7-03
FORMULA_NAME Solitaire-PT-EngNC7x7-04
FORMULA_NAME Solitaire-PT-EngNC7x7-05
FORMULA_NAME Solitaire-PT-EngNC7x7-06
FORMULA_NAME Solitaire-PT-EngNC7x7-07
FORMULA_NAME Solitaire-PT-EngNC7x7-08
FORMULA_NAME Solitaire-PT-EngNC7x7-09
FORMULA_NAME Solitaire-PT-EngNC7x7-10
FORMULA_NAME Solitaire-PT-EngNC7x7-11
FORMULA_NAME Solitaire-PT-EngNC7x7-12
FORMULA_NAME Solitaire-PT-EngNC7x7-13
FORMULA_NAME Solitaire-PT-EngNC7x7-14
FORMULA_NAME Solitaire-PT-EngNC7x7-15
=== Now, execution of the tool begins
BK_START 1591204552505
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:15:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 17:15:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:15:54] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-06-03 17:15:54] [INFO ] Transformed 66 places.
[2020-06-03 17:15:54] [INFO ] Transformed 76 transitions.
[2020-06-03 17:15:54] [INFO ] Parsed PT model containing 66 places and 76 transitions in 110 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 341 steps, including 13 resets, run visited all 45 properties in 14 ms. (steps per millisecond=24 )
[2020-06-03 17:15:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:15:55] [INFO ] Flatten gal took : 61 ms
FORMULA Solitaire-PT-EngNC7x7-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:15:55] [INFO ] Flatten gal took : 35 ms
[2020-06-03 17:15:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-03 17:15:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Solitaire-PT-EngNC7x7 @ 3570 seconds
FORMULA Solitaire-PT-EngNC7x7-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Solitaire-PT-EngNC7x7-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3321
rslt: Output for LTLFireability @ Solitaire-PT-EngNC7x7
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:15:55 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "G (((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))",
"processed_size": 45,
"rewrites": 124
},
"result":
{
"edges": 843,
"markings": 381,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((1 <= p6) AND (1 <= p11) AND (1 <= p53)))))",
"processed_size": 103,
"rewrites": 124
},
"result":
{
"edges": 45,
"markings": 44,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(X (((1 <= p8) AND (1 <= p13) AND (1 <= p53))) U ((X (F (((1 <= p43) AND (1 <= p47) AND (1 <= p48)))) AND ((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0))) R ((p8 <= 0) OR (p14 <= 0) OR (p23 <= 0))))",
"processed_size": 195,
"rewrites": 124
},
"result":
{
"edges": 71,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F ((F ((G (F (((1 <= p8) AND (1 <= p29) AND (1 <= p34)))) OR ((1 <= p54) AND (1 <= p58) AND (1 <= p63)))) AND X (G (((1 <= p28) AND (1 <= p36) AND (1 <= p43)))))))",
"processed_size": 166,
"rewrites": 124
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 6,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((X ((F (((1 <= p43) AND (1 <= p46) AND (1 <= p49))) AND ((1 <= p43) AND ((1 <= p46) AND (1 <= p49))))) AND ((1 <= p31) AND ((1 <= p54) AND (1 <= p56))))))",
"processed_size": 160,
"rewrites": 124
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (F ((X (G (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0)))) AND ((1 <= p29) AND ((1 <= p36) AND (1 <= p42)))))))",
"processed_size": 113,
"rewrites": 124
},
"result":
{
"edges": 82931,
"markings": 24937,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((G (((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0))) AND ((F (((p36 <= 0) OR (p43 <= 0) OR (p51 <= 0))) OR G (((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)))) AND F (((p16 <= 0) OR (p29 <= 0) OR (p36 <= 0))))) R X (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0))))",
"processed_size": 249,
"rewrites": 124
},
"result":
{
"edges": 1176263,
"markings": 258002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 44
},
"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": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p17) AND (1 <= p20) AND (1 <= p33))",
"processed_size": 42,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p17 <= 0) OR (p20 <= 0) OR (p33 <= 0))",
"processed_size": 42,
"rewrites": 126
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p31) AND (1 <= p34) AND (1 <= p44))))",
"processed_size": 50,
"rewrites": 124
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 5,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (X (X (X ((F (((1 <= p19) AND (1 <= p31) AND (1 <= p35))) AND X (F ((((1 <= p37) AND (1 <= p45) AND (1 <= p60)) OR ((1 <= p21) AND (1 <= p24) AND (1 <= p27))))))))))",
"processed_size": 168,
"rewrites": 124
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((((p15 <= 0) OR (p17 <= 0) OR (p31 <= 0)) AND ((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))))",
"processed_size": 98,
"rewrites": 124
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 4,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (G ((X (X (F ((X (((p4 <= 0) OR (p36 <= 0) OR (p44 <= 0))) AND ((p37 <= 0) OR (p43 <= 0) OR (p50 <= 0)))))) AND F (G (((1 <= p41) AND (1 <= p45) AND (1 <= p48)))))))",
"processed_size": 171,
"rewrites": 124
},
"result":
{
"edges": 189687697,
"markings": 52570300,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 830
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 830
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "G (((1 <= p4) AND (1 <= p39) AND (1 <= p46)))",
"processed_size": 45,
"rewrites": 124
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1107
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR (G (((1 <= p4) AND (1 <= p39) AND (1 <= p46))) AND F (((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)))))))",
"processed_size": 150,
"rewrites": 124
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1107
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p16) AND (1 <= p29) AND (1 <= p36))) OR X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR ((1 <= p16) AND (1 <= p29) AND (1 <= p36)))))))",
"processed_size": 152,
"rewrites": 124
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1661
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p18 <= 0) OR (p23 <= 0) OR (p33 <= 0))",
"processed_size": 42,
"rewrites": 126
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3322
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3322
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))",
"processed_size": 46,
"rewrites": 124
},
"result":
{
"edges": 25,
"markings": 25,
"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": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))",
"processed_size": 46,
"rewrites": 124
},
"result":
{
"edges": 25,
"markings": 25,
"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"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "F (G (((1 <= p57) AND (1 <= p60) AND (1 <= p64))))",
"processed_size": 50,
"rewrites": 124
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 39436,
"runtime": 249.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((X(F(*)) AND **))) OR G(**)) : (X(**) U ((X(F(**)) AND *) R *)) : X(F((F((G(F(*)) OR **)) AND X(G(**))))) : G(F((X((F(**) AND (** AND (** AND **)))) AND (** AND (** AND **))))) : X(X(F((X(G(**)) AND (* AND (* AND *)))))) : ((G(*) AND ((F(*) OR G(*)) AND F(*))) R X(*)) : (** OR (G((F(**) AND ((** U **) OR X(F(**))))) AND F(**))) : X(G(**)) : X(X(X(X((F(**) AND X(F(**))))))) : F(**) : X(G(*)) : (G(**) OR (F(G(**)) AND F(G((G(*) OR (* OR (* OR *))))))) : X(G((X(X(F((X(*) AND *)))) AND F(G(**))))) : (X(F((* OR (G(**) AND F(*))))) OR G(**)) : X((F(**) OR X(F((** OR **)))))"
},
"net":
{
"arcs": 456,
"conflict_clusters": 1,
"places": 66,
"places_significant": 33,
"singleton_clusters": 0,
"transitions": 76
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no no yes yes ",
"value": "no no no no no no no no no no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2112
lola: finding significant places
lola: 66 places, 76 transitions, 33 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: (F ((NOT(X (G (X (((1 <= p3) AND (1 <= p4) AND (1 <= p7)))))) AND X (((1 <= p6) AND (1 <= p11) AND (1 <= p53))))) OR G (((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))) : (X (((1 <= p8) AND (1 <= p13) AND (1 <= p53))) U NOT(((X (NOT(F (((1 <= p43) AND (1 <= p47) AND (1 <= p48))))) OR ((1 <= p18) AND (1 <= p31) AND (1 <= p34))) U ((1 <= p8) AND (1 <= p14) AND (1 <= p23))))) : F (X (F ((F ((G (NOT(G (((p8 <= 0) OR (p29 <= 0) OR (p34 <= 0))))) OR ((1 <= p54) AND (1 <= p58) AND (1 <= p63)))) AND G (X (((1 <= p28) AND (1 <= p36) AND (1 <= p43)))))))) : G (F ((((X ((((F (((1 <= p43) AND (1 <= p46) AND (1 <= p49))) AND (1 <= p43)) AND (1 <= p46)) AND (1 <= p49))) AND (1 <= p31)) AND (1 <= p54)) AND (1 <= p56)))) : F (NOT(X (X (G ((((NOT(G (X (G (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0)))))) OR (p29 <= 0)) OR (p36 <= 0)) OR (p42 <= 0))))))) : NOT((((G (((1 <= p36) AND (1 <= p43) AND (1 <= p51))) U F ((X (((1 <= p14) AND (1 <= p23) AND (1 <= p25))) U ((1 <= p2) AND (1 <= p5) AND (1 <= p7))))) OR G (((1 <= p16) AND (1 <= p29) AND (1 <= p36)))) U X (((1 <= p43) AND (1 <= p47) AND (1 <= p48))))) : (G (((((1 <= p37) AND (1 <= p43) AND (1 <= p50)) U ((p17 <= 0) OR (p20 <= 0) OR (p33 <= 0))) U X (F (((1 <= p37) AND (1 <= p43) AND (1 <= p50)))))) U ((1 <= p17) AND (1 <= p20) AND (1 <= p33))) : G (X (((1 <= p31) AND (1 <= p34) AND (1 <= p44)))) : X (X (X ((X (F (((1 <= p19) AND (1 <= p31) AND (1 <= p35)))) AND NOT(G (X (NOT(X ((((1 <= p37) AND (1 <= p45) AND (1 <= p60)) OR ((1 <= p21) AND (1 <= p24) AND (1 <= p27)))))))))))) : F (((1 <= p18) AND (1 <= p23) AND (1 <= p33))) : NOT(F (X ((((1 <= p15) AND (1 <= p17) AND (1 <= p31)) OR ((1 <= p6) AND (1 <= p11) AND (1 <= p53)))))) : (G (NOT(X (G (F ((((F (((p37 <= 0) OR (p45 <= 0) OR (p60 <= 0) OR (p1 <= 0) OR (p11 <= 0) OR (p14 <= 0))) AND (1 <= p1)) AND (1 <= p11)) AND (1 <= p14))))))) U G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))) : G (X ((NOT(X (X (G ((X (((1 <= p4) AND (1 <= p36) AND (1 <= p44))) OR ((1 <= p37) AND (1 <= p43) AND (1 <= p50))))))) AND F (G (((1 <= p41) AND (1 <= p45) AND (1 <= p48))))))) : (F ((G (X (((1 <= p4) AND (1 <= p39) AND (1 <= p46)))) U NOT(X (((1 <= p4) AND (1 <= p9) AND (1 <= p47)))))) OR G (((1 <= p4) AND (1 <= p39) AND (1 <= p46)))) : X (((F (((1 <= p16) AND (1 <= p29) AND (1 <= p36))) OR F (X (((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0))))) OR F (X (((1 <= p16) AND (1 <= p29) AND (1 <= p36))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((1 <= p6) AND (1 <= p11) AND (1 <= p53))))) OR G (((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))
lola: processed formula length: 45
lola: 124 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: 381 markings, 843 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((1 <= p6) AND (1 <= p11) AND (1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((1 <= p6) AND (1 <= p11) AND (1 <= p53)))))
lola: processed formula length: 103
lola: 124 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: 44 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p8) AND (1 <= p13) AND (1 <= p53))) U ((X (F (((1 <= p43) AND (1 <= p47) AND (1 <= p48)))) AND ((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0))) R ((p8 <= 0) OR (p14 <= 0) OR (p23 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p8) AND (1 <= p13) AND (1 <= p53))) U ((X (F (((1 <= p43) AND (1 <= p47) AND (1 <= p48)))) AND ((p18 <= 0) OR (p31 <= 0) OR (p34 <= 0))) R ((p8 <= 0) OR (p14 <= 0) OR (p23 <= 0))))
lola: processed formula length: 195
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 49 markings, 71 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((G (F (((1 <= p8) AND (1 <= p29) AND (1 <= p34)))) OR ((1 <= p54) AND (1 <= p58) AND (1 <= p63)))) AND X (G (((1 <= p28) AND (1 <= p36) AND (1 <= p43)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((G (F (((1 <= p8) AND (1 <= p29) AND (1 <= p34)))) OR ((1 <= p54) AND (1 <= p58) AND (1 <= p63)))) AND X (G (((1 <= p28) AND (1 <= p36) AND (1 <= p43)))))))
lola: processed formula length: 166
lola: 124 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((F (((1 <= p43) AND (1 <= p46) AND (1 <= p49))) AND ((1 <= p43) AND ((1 <= p46) AND (1 <= p49))))) AND ((1 <= p31) AND ((1 <= p54) AND (1 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((F (((1 <= p43) AND (1 <= p46) AND (1 <= p49))) AND ((1 <= p43) AND ((1 <= p46) AND (1 <= p49))))) AND ((1 <= p31) AND ((1 <= p54) AND (1 <= p56))))))
lola: processed formula length: 160
lola: 124 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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (G (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0)))) AND ((1 <= p29) AND ((1 <= p36) AND (1 <= p42)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (G (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0)))) AND ((1 <= p29) AND ((1 <= p36) AND (1 <= p42)))))))
lola: processed formula length: 113
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 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: 24937 markings, 82931 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0))) AND ((F (((p36 <= 0) OR (p43 <= 0) OR (p51 <= 0))) OR G (((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)))) AND F (((p16 <= 0) OR (p29 <= 0) OR (p36 <= 0))))) R X (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0))) AND ((F (((p36 <= 0) OR (p43 <= 0) OR (p51 <= 0))) OR G (((p2 <= 0) OR (p5 <= 0) OR (p7 <= 0)))) AND F (((p16 <= 0) OR (p29 <= 0) OR (p36 <= 0))))) R X (((p43 <= 0) OR (p47 <= 0) OR (p48 <= 0))))
lola: processed formula length: 249
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 44 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: 258002 markings, 1176263 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p17) AND (1 <= p20) AND (1 <= p33)) OR (G ((F (((1 <= p37) AND (1 <= p43) AND (1 <= p50))) AND ((((1 <= p37) AND (1 <= p43) AND (1 <= p50)) U ((p17 <= 0) OR (p20 <= 0) OR (p33 <= 0))) OR X (F (((1 <= p37) AND (1 <= p43) AND (1 <= p50))))))) AND F (((1 <= p17) AND (1 <= p20) AND (1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p17) AND (1 <= p20) AND (1 <= p33))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p17) AND (1 <= p20) AND (1 <= p33))
lola: processed formula length: 42
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p17) AND (1 <= p20) AND (1 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p17 <= 0) OR (p20 <= 0) OR (p33 <= 0))
lola: processed formula length: 42
lola: 126 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 25 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p31) AND (1 <= p34) AND (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p31) AND (1 <= p34) AND (1 <= p44))))
lola: processed formula length: 50
lola: 124 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X ((F (((1 <= p19) AND (1 <= p31) AND (1 <= p35))) AND X (F ((((1 <= p37) AND (1 <= p45) AND (1 <= p60)) OR ((1 <= p21) AND (1 <= p24) AND (1 <= p27))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X ((F (((1 <= p19) AND (1 <= p31) AND (1 <= p35))) AND X (F ((((1 <= p37) AND (1 <= p45) AND (1 <= p60)) OR ((1 <= p21) AND (1 <= p24) AND (1 <= p27))))))))))
lola: processed formula length: 168
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p15 <= 0) OR (p17 <= 0) OR (p31 <= 0)) AND ((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p15 <= 0) OR (p17 <= 0) OR (p31 <= 0)) AND ((p6 <= 0) OR (p11 <= 0) OR (p53 <= 0)))))
lola: processed formula length: 98
lola: 124 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (F ((X (((p4 <= 0) OR (p36 <= 0) OR (p44 <= 0))) AND ((p37 <= 0) OR (p43 <= 0) OR (p50 <= 0)))))) AND F (G (((1 <= p41) AND (1 <= p45) AND (1 <= p48)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (F ((X (((p4 <= 0) OR (p36 <= 0) OR (p44 <= 0))) AND ((p37 <= 0) OR (p43 <= 0) OR (p50 <= 0)))))) AND F (G (((1 <= p41) AND (1 <= p45) AND (1 <= p48)))))))
lola: processed formula length: 171
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2255482 markings, 3888377 edges, 451096 markings/sec, 0 secs
lola: 3825664 markings, 8810115 edges, 314036 markings/sec, 5 secs
lola: 5194986 markings, 13379932 edges, 273864 markings/sec, 10 secs
lola: 6414589 markings, 17789733 edges, 243921 markings/sec, 15 secs
lola: 7817836 markings, 22161432 edges, 280649 markings/sec, 20 secs
lola: 9094852 markings, 26408363 edges, 255403 markings/sec, 25 secs
lola: 10307228 markings, 30102367 edges, 242475 markings/sec, 30 secs
lola: 11342765 markings, 33818456 edges, 207107 markings/sec, 35 secs
lola: 12559021 markings, 37897492 edges, 243251 markings/sec, 40 secs
lola: 13732032 markings, 41835147 edges, 234602 markings/sec, 45 secs
lola: 14802592 markings, 45569683 edges, 214112 markings/sec, 50 secs
lola: 15745618 markings, 49200611 edges, 188605 markings/sec, 55 secs
lola: 16656314 markings, 52824876 edges, 182139 markings/sec, 60 secs
lola: 17739879 markings, 56573807 edges, 216713 markings/sec, 65 secs
lola: 18794361 markings, 60381594 edges, 210896 markings/sec, 70 secs
lola: 20005015 markings, 64517614 edges, 242131 markings/sec, 75 secs
lola: 21186709 markings, 68875245 edges, 236339 markings/sec, 80 secs
lola: 22476600 markings, 73060408 edges, 257978 markings/sec, 85 secs
lola: 23590827 markings, 77242335 edges, 222845 markings/sec, 90 secs
lola: 24574560 markings, 81482854 edges, 196747 markings/sec, 95 secs
lola: 25570354 markings, 85708276 edges, 199159 markings/sec, 100 secs
lola: 26736933 markings, 89748155 edges, 233316 markings/sec, 105 secs
lola: 27929962 markings, 93969444 edges, 238606 markings/sec, 110 secs
lola: 28917359 markings, 97926021 edges, 197479 markings/sec, 115 secs
lola: 29967793 markings, 102014897 edges, 210087 markings/sec, 120 secs
lola: 30946973 markings, 106090220 edges, 195836 markings/sec, 125 secs
lola: 31873357 markings, 110279820 edges, 185277 markings/sec, 130 secs
lola: 32828010 markings, 114061579 edges, 190931 markings/sec, 135 secs
lola: 33910077 markings, 117759062 edges, 216413 markings/sec, 140 secs
lola: 35078232 markings, 122004196 edges, 233631 markings/sec, 145 secs
lola: 36067573 markings, 125990143 edges, 197868 markings/sec, 150 secs
lola: 36943729 markings, 129830136 edges, 175231 markings/sec, 155 secs
lola: 38067628 markings, 133739255 edges, 224780 markings/sec, 160 secs
lola: 38999287 markings, 137372079 edges, 186332 markings/sec, 165 secs
lola: 40002404 markings, 141136581 edges, 200623 markings/sec, 170 secs
lola: 41236952 markings, 144540316 edges, 246910 markings/sec, 175 secs
lola: 42169682 markings, 148202168 edges, 186546 markings/sec, 180 secs
lola: 43067388 markings, 151813587 edges, 179541 markings/sec, 185 secs
lola: 44053523 markings, 155548545 edges, 197227 markings/sec, 190 secs
lola: 44973644 markings, 159531959 edges, 184024 markings/sec, 195 secs
lola: 45896254 markings, 163165070 edges, 184522 markings/sec, 200 secs
lola: 46855521 markings, 166801660 edges, 191853 markings/sec, 205 secs
lola: 47791586 markings, 170329903 edges, 187213 markings/sec, 210 secs
lola: 48731836 markings, 173771254 edges, 188050 markings/sec, 215 secs
lola: 49483679 markings, 176994927 edges, 150369 markings/sec, 220 secs
lola: 50236435 markings, 180232530 edges, 150551 markings/sec, 225 secs
lola: 51198893 markings, 183714914 edges, 192492 markings/sec, 230 secs
lola: 52005509 markings, 187247325 edges, 161323 markings/sec, 235 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 52570300 markings, 189687697 edges
lola: ========================================
lola: subprocess 11 will run for 830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR (G (((1 <= p4) AND (1 <= p39) AND (1 <= p46))) AND F (((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0))))))) OR G (((1 <= p4) AND (1 <= p39) AND (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p4) AND (1 <= p39) AND (1 <= p46)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p4) AND (1 <= p39) AND (1 <= p46)))
lola: processed formula length: 45
lola: 124 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 12 will run for 1107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR (G (((1 <= p4) AND (1 <= p39) AND (1 <= p46))) AND F (((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR (G (((1 <= p4) AND (1 <= p39) AND (1 <= p46))) AND F (((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)))))))
lola: processed formula length: 150
lola: 124 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 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: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 1107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p16) AND (1 <= p29) AND (1 <= p36))) OR X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR ((1 <= p16) AND (1 <= p29) AND (1 <= p36)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p16) AND (1 <= p29) AND (1 <= p36))) OR X (F ((((p4 <= 0) OR (p9 <= 0) OR (p47 <= 0)) OR ((1 <= p16) AND (1 <= p29) AND (1 <= p36)))))))
lola: processed formula length: 152
lola: 124 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: 14 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p18) AND (1 <= p23) AND (1 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p18 <= 0) OR (p23 <= 0) OR (p33 <= 0))
lola: processed formula length: 42
lola: 126 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 14 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p57) AND (1 <= p60) AND (1 <= p64))) OR (F (G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))) AND F (G ((G (((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p1) AND (1 <= p11) AND (1 <= p14))) OR ((p1 <= 0) OR ((p11 <= 0) OR (p14 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))
lola: processed formula length: 46
lola: 124 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: 25 markings, 25 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p1) AND (1 <= p11) AND (1 <= p14))) OR ((p1 <= 0) OR ((p11 <= 0) OR (p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p1) AND (1 <= p11) AND (1 <= p14))) OR ((p1 <= 0) OR ((p11 <= 0) OR (p14 <= 0))))))
lola: processed formula length: 145
lola: 124 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: local time limit reached - aborting
lola:
preliminary result: no no no no no no no no no no no unknown no yes yes
lola: memory consumption: 64416 KB
lola: time consumption: 249 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p57) AND (1 <= p60) AND (1 <= p64))) OR (F (G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))) AND F (G ((G (((1 <= p37) AND (1 <= p45) AND (1 <= p60) AND (1 <= p1) AND (1 <= p11) AND (1 <= p14))) OR ((p1 <= 0) OR ((p11 <= 0) OR (p14 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p57) AND (1 <= p60) AND (1 <= p64)))
lola: processed formula length: 46
lola: 124 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: 25 markings, 25 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p57) AND (1 <= p60) AND (1 <= p64))))
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 <= p57) AND (1 <= p60) AND (1 <= p64))))
lola: processed formula length: 50
lola: 124 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: 26 markings, 27 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no yes yes
lola:
preliminary result: no no no no no no no no no no no no no yes yes
lola: ========================================
lola: memory consumption: 39436 KB
lola: time consumption: 249 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="Solitaire-PT-EngNC7x7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Solitaire-PT-EngNC7x7, 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 r194-csrt-159033389600162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Solitaire-PT-EngNC7x7.tgz
mv Solitaire-PT-EngNC7x7 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 ;