About the Execution of ITS-LoLa for ShieldPPPt-PT-002A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15739.480 | 3600000.00 | 678246.00 | 195.40 | FTFFTTFFTFFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477700585.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldPPPt-PT-002A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.7K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 19:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 08:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 08:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 14K May 12 20:42 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 ShieldPPPt-PT-002A-00
FORMULA_NAME ShieldPPPt-PT-002A-01
FORMULA_NAME ShieldPPPt-PT-002A-02
FORMULA_NAME ShieldPPPt-PT-002A-03
FORMULA_NAME ShieldPPPt-PT-002A-04
FORMULA_NAME ShieldPPPt-PT-002A-05
FORMULA_NAME ShieldPPPt-PT-002A-06
FORMULA_NAME ShieldPPPt-PT-002A-07
FORMULA_NAME ShieldPPPt-PT-002A-08
FORMULA_NAME ShieldPPPt-PT-002A-09
FORMULA_NAME ShieldPPPt-PT-002A-10
FORMULA_NAME ShieldPPPt-PT-002A-11
FORMULA_NAME ShieldPPPt-PT-002A-12
FORMULA_NAME ShieldPPPt-PT-002A-13
FORMULA_NAME ShieldPPPt-PT-002A-14
FORMULA_NAME ShieldPPPt-PT-002A-15
=== Now, execution of the tool begins
BK_START 1591316457758
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:20:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 00:20:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:20:59] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-06-05 00:20:59] [INFO ] Transformed 53 places.
[2020-06-05 00:20:59] [INFO ] Transformed 39 transitions.
[2020-06-05 00:20:59] [INFO ] Found NUPN structural information;
[2020-06-05 00:20:59] [INFO ] Parsed PT model containing 53 places and 39 transitions in 69 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 181 ms. (steps per millisecond=552 ) properties seen :[0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 38 rows 53 cols
[2020-06-05 00:20:59] [INFO ] Computed 23 place invariants in 3 ms
[2020-06-05 00:20:59] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned sat
[2020-06-05 00:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:20:59] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-05 00:20:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:20:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned unsat
[2020-06-05 00:20:59] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2020-06-05 00:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-05 00:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:21:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 15 ms returned unsat
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2020-06-05 00:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-05 00:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:21:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned unsat
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2020-06-05 00:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-05 00:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:21:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned unsat
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2020-06-05 00:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:00] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-06-05 00:21:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:21:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-05 00:21:00] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 00:21:00] [INFO ] Flatten gal took : 46 ms
FORMULA ShieldPPPt-PT-002A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:21:00] [INFO ] Applying decomposition
[2020-06-05 00:21:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:21:00] [INFO ] Flatten gal took : 6 ms
[2020-06-05 00:21:00] [INFO ] Decomposing Gal with order
[2020-06-05 00:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 00:21:00] [INFO ] Removed a total of 12 redundant transitions.
[2020-06-05 00:21:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:21:00] [INFO ] Flatten gal took : 32 ms
[2020-06-05 00:21:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-06-05 00:21:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-002A-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:21:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-05 00:21:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-002A @ 3570 seconds
FORMULA ShieldPPPt-PT-002A-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-002A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2908
rslt: Output for LTLCardinality @ ShieldPPPt-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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 00:21:00 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((p11 <= 0)) OR ((1 <= p40)))))",
"processed_size": 39,
"rewrites": 55
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X (G (((((1 <= p41)) AND ((p12 <= 0))) OR (((1 <= p30)) AND ((p1 <= 0))))))))",
"processed_size": 84,
"rewrites": 55
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G ((((1 <= p41)) AND ((p44 <= 0)))) OR (X ((((1 <= p41)) AND ((p44 <= 0)))) AND (((1 <= p41)) AND ((p44 <= 0))))))",
"processed_size": 118,
"rewrites": 55
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (X (F ((((p24 <= 0)) OR ((1 <= p37)))))) OR F ((((p50 <= 0)) OR ((1 <= p17))))))",
"processed_size": 88,
"rewrites": 55
},
"result":
{
"edges": 510847893,
"markings": 69887987,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 727
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"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": "X (X (F ((((1 <= p32)) AND ((p31 <= 0))))))",
"processed_size": 43,
"rewrites": 55
},
"result":
{
"edges": 50,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 969
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"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": "(((p37 <= 0)) R X (X (G ((((1 <= p19)) AND ((p48 <= 0)))))))",
"processed_size": 60,
"rewrites": 55
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1454
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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 (F ((((1 <= p21)) AND ((p20 <= 0)))))",
"processed_size": 39,
"rewrites": 55
},
"result":
{
"edges": 34,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 2908
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((((p11 <= 0)) OR ((1 <= p12))) OR (G (F ((((p11 <= 0)) OR ((1 <= p12))))) AND F ((((p11 <= 0)) OR ((1 <= p12)))))))",
"processed_size": 122,
"rewrites": 55
},
"result":
{
"edges": 116,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 26976,
"runtime": 662.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(**)) : G((** OR (G(F(**)) AND F(**)))) : G(F(*)) : X(X(X(G(*)))) : F((G(*) OR (X(*) AND *))) : G((X(X(F(**))) OR F(**))) : X(X(F(*))) : (* R X(X(G(*))))"
},
"net":
{
"arcs": 148,
"conflict_clusters": 25,
"places": 53,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 38
},
"result":
{
"preliminary_value": "yes no no no no yes no no ",
"value": "yes no no no no yes 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: 91/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1696
lola: finding significant places
lola: 53 places, 38 transitions, 30 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: F ((NOT(((0 <= 0) U (0 <= 0))) OR ((((p11 <= 0)) OR ((1 <= p40))) U X ((((p11 <= 0)) OR ((1 <= p40))))))) : G ((NOT(F (NOT(X (G (F ((((p11 <= 0)) OR ((1 <= p12))))))))) U (((p11 <= 0)) OR ((1 <= p12))))) : (G ((F ((((p21 <= 0)) OR ((1 <= p20)))) U (1 <= 0))) OR G (NOT(G (X ((((p21 <= 0)) OR ((1 <= p20)))))))) : NOT(F (X (X (X (((((p41 <= 0)) OR ((1 <= p12))) AND (((p30 <= 0)) OR ((1 <= p1))))))))) : NOT(G ((X ((((p41 <= 0)) OR ((1 <= p44)))) U (((p41 <= 0)) OR ((1 <= p44)))))) : G ((F (X (X ((((p24 <= 0)) OR ((1 <= p37)))))) OR F ((((p50 <= 0)) OR ((1 <= p17)))))) : X (X (NOT(G ((((p32 <= 0)) OR ((1 <= p31))))))) : NOT((((1 <= p37)) U X (X (F ((((p19 <= 0)) OR ((1 <= p48))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p11 <= 0)) OR ((1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p11 <= 0)) OR ((1 <= p40)))))
lola: processed formula length: 39
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((((1 <= p41)) AND ((p12 <= 0))) OR (((1 <= p30)) AND ((p1 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((((1 <= p41)) AND ((p12 <= 0))) OR (((1 <= p30)) AND ((p1 <= 0))))))))
lola: processed formula length: 84
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((1 <= p41)) AND ((p44 <= 0)))) OR (X ((((1 <= p41)) AND ((p44 <= 0)))) AND (((1 <= p41)) AND ((p44 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((1 <= p41)) AND ((p44 <= 0)))) OR (X ((((1 <= p41)) AND ((p44 <= 0)))) AND (((1 <= p41)) AND ((p44 <= 0))))))
lola: processed formula length: 118
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F ((((p24 <= 0)) OR ((1 <= p37)))))) OR F ((((p50 <= 0)) OR ((1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F ((((p24 <= 0)) OR ((1 <= p37)))))) OR F ((((p50 <= 0)) OR ((1 <= p17))))))
lola: processed formula length: 88
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 2089514 markings, 4686667 edges, 417903 markings/sec, 0 secs
lola: 4123171 markings, 9994402 edges, 406731 markings/sec, 5 secs
lola: 5934600 markings, 15293327 edges, 362286 markings/sec, 10 secs
lola: 7504641 markings, 20119536 edges, 314008 markings/sec, 15 secs
lola: 9016285 markings, 24987861 edges, 302329 markings/sec, 20 secs
lola: 10450129 markings, 29725813 edges, 286769 markings/sec, 25 secs
lola: 11851574 markings, 34543213 edges, 280289 markings/sec, 30 secs
lola: 13080993 markings, 38916225 edges, 245884 markings/sec, 35 secs
lola: 14263681 markings, 43167529 edges, 236538 markings/sec, 40 secs
lola: 15429914 markings, 47471108 edges, 233247 markings/sec, 45 secs
lola: 16158728 markings, 50202637 edges, 145763 markings/sec, 50 secs
lola: 16870258 markings, 52911294 edges, 142306 markings/sec, 55 secs
lola: 17554841 markings, 55565699 edges, 136917 markings/sec, 60 secs
lola: 18220684 markings, 58175411 edges, 133169 markings/sec, 65 secs
lola: 19011939 markings, 61227767 edges, 158251 markings/sec, 70 secs
lola: 19928110 markings, 64870269 edges, 183234 markings/sec, 75 secs
lola: 20842739 markings, 68572008 edges, 182926 markings/sec, 80 secs
lola: 21792009 markings, 72423062 edges, 189854 markings/sec, 85 secs
lola: 22703814 markings, 76134381 edges, 182361 markings/sec, 90 secs
lola: 23599701 markings, 79840511 edges, 179177 markings/sec, 95 secs
lola: 24473903 markings, 83515733 edges, 174840 markings/sec, 100 secs
lola: 25077299 markings, 86061241 edges, 120679 markings/sec, 105 secs
lola: 25664416 markings, 88549283 edges, 117423 markings/sec, 110 secs
lola: 26210933 markings, 90889190 edges, 109303 markings/sec, 115 secs
lola: 26778239 markings, 93327228 edges, 113461 markings/sec, 120 secs
lola: 27331289 markings, 95729685 edges, 110610 markings/sec, 125 secs
lola: 27887781 markings, 98135865 edges, 111298 markings/sec, 130 secs
lola: 28473748 markings, 100713159 edges, 117193 markings/sec, 135 secs
lola: 29103685 markings, 103468971 edges, 125987 markings/sec, 140 secs
lola: 29845013 markings, 106749016 edges, 148266 markings/sec, 145 secs
lola: 30574028 markings, 109996061 edges, 145803 markings/sec, 150 secs
lola: 31349496 markings, 113468019 edges, 155094 markings/sec, 155 secs
lola: 32144032 markings, 117032939 edges, 158907 markings/sec, 160 secs
lola: 32894240 markings, 120440446 edges, 150042 markings/sec, 165 secs
lola: 33631236 markings, 123830634 edges, 147399 markings/sec, 170 secs
lola: 34374308 markings, 127269657 edges, 148614 markings/sec, 175 secs
lola: 35093664 markings, 130597688 edges, 143871 markings/sec, 180 secs
lola: 35823047 markings, 133989044 edges, 145877 markings/sec, 185 secs
lola: 36531959 markings, 137341493 edges, 141782 markings/sec, 190 secs
lola: 37253430 markings, 140780824 edges, 144294 markings/sec, 195 secs
lola: 37943433 markings, 144075065 edges, 138001 markings/sec, 200 secs
lola: 38661672 markings, 147528037 edges, 143648 markings/sec, 205 secs
lola: 39404187 markings, 151121577 edges, 148503 markings/sec, 210 secs
lola: 40145618 markings, 154745692 edges, 148286 markings/sec, 215 secs
lola: 40883793 markings, 158397142 edges, 147635 markings/sec, 220 secs
lola: 41622475 markings, 162055583 edges, 147736 markings/sec, 225 secs
lola: 42346650 markings, 165678371 edges, 144835 markings/sec, 230 secs
lola: 43051275 markings, 169215943 edges, 140925 markings/sec, 235 secs
lola: 43743353 markings, 172707711 edges, 138416 markings/sec, 240 secs
lola: 44451708 markings, 176302606 edges, 141671 markings/sec, 245 secs
lola: 45132628 markings, 179807201 edges, 136184 markings/sec, 250 secs
lola: 45839473 markings, 183456527 edges, 141369 markings/sec, 255 secs
lola: 46528571 markings, 187048756 edges, 137820 markings/sec, 260 secs
lola: 47245922 markings, 190809467 edges, 143470 markings/sec, 265 secs
lola: 47957738 markings, 194588323 edges, 142363 markings/sec, 270 secs
lola: 48643463 markings, 198253589 edges, 137145 markings/sec, 275 secs
lola: 49359157 markings, 202095246 edges, 143139 markings/sec, 280 secs
lola: 50067224 markings, 205948033 edges, 141613 markings/sec, 285 secs
lola: 50774831 markings, 209833702 edges, 141521 markings/sec, 290 secs
lola: 51474248 markings, 213694804 edges, 139883 markings/sec, 295 secs
lola: 52193379 markings, 217720946 edges, 143826 markings/sec, 300 secs
lola: 52912393 markings, 221782802 edges, 143803 markings/sec, 305 secs
lola: 53640188 markings, 225929680 edges, 145559 markings/sec, 310 secs
lola: 54363251 markings, 230115399 edges, 144613 markings/sec, 315 secs
lola: 55084408 markings, 234342491 edges, 144231 markings/sec, 320 secs
lola: 55820713 markings, 238719790 edges, 147261 markings/sec, 325 secs
lola: 56558031 markings, 243156574 edges, 147464 markings/sec, 330 secs
lola: 57295268 markings, 247730309 edges, 147447 markings/sec, 335 secs
lola: 58032326 markings, 252390222 edges, 147412 markings/sec, 340 secs
lola: 58803289 markings, 257460001 edges, 154193 markings/sec, 345 secs
lola: 59568554 markings, 262601850 edges, 153053 markings/sec, 350 secs
lola: 60341972 markings, 268542118 edges, 154684 markings/sec, 355 secs
lola: 61134437 markings, 274869728 edges, 158493 markings/sec, 360 secs
lola: 61864960 markings, 279667669 edges, 146105 markings/sec, 365 secs
lola: 62598882 markings, 284817837 edges, 146784 markings/sec, 370 secs
lola: 63334235 markings, 290211027 edges, 147071 markings/sec, 375 secs
lola: 64071987 markings, 295980029 edges, 147550 markings/sec, 380 secs
lola: 64767927 markings, 301824495 edges, 139188 markings/sec, 385 secs
lola: 65494651 markings, 307901218 edges, 145345 markings/sec, 390 secs
lola: 66048364 markings, 313181548 edges, 110743 markings/sec, 395 secs
lola: 66600851 markings, 317131381 edges, 110497 markings/sec, 400 secs
lola: 67134706 markings, 322318534 edges, 106771 markings/sec, 405 secs
lola: 67208328 markings, 325476770 edges, 14724 markings/sec, 410 secs
lola: 67306515 markings, 329859045 edges, 19637 markings/sec, 415 secs
lola: 67402625 markings, 334215939 edges, 19222 markings/sec, 420 secs
lola: 67489567 markings, 338371124 edges, 17388 markings/sec, 425 secs
lola: 67571907 markings, 342449691 edges, 16468 markings/sec, 430 secs
lola: 67653114 markings, 346496005 edges, 16241 markings/sec, 435 secs
lola: 67731057 markings, 350510812 edges, 15589 markings/sec, 440 secs
lola: 67805934 markings, 354487454 edges, 14975 markings/sec, 445 secs
lola: 67881026 markings, 358457022 edges, 15018 markings/sec, 450 secs
lola: 67950835 markings, 362239985 edges, 13962 markings/sec, 455 secs
lola: 68018411 markings, 365951073 edges, 13515 markings/sec, 460 secs
lola: 68085501 markings, 369735201 edges, 13418 markings/sec, 465 secs
lola: 68151064 markings, 373505450 edges, 13113 markings/sec, 470 secs
lola: 68217597 markings, 377291931 edges, 13307 markings/sec, 475 secs
lola: 68284284 markings, 381164914 edges, 13337 markings/sec, 480 secs
lola: 68346663 markings, 384902596 edges, 12476 markings/sec, 485 secs
lola: 68407879 markings, 388622482 edges, 12243 markings/sec, 490 secs
lola: 68468629 markings, 392331595 edges, 12150 markings/sec, 495 secs
lola: 68528831 markings, 396126978 edges, 12040 markings/sec, 500 secs
lola: 68562705 markings, 398344841 edges, 6775 markings/sec, 505 secs
lola: 68607489 markings, 401222393 edges, 8957 markings/sec, 510 secs
lola: 68662643 markings, 404785653 edges, 11031 markings/sec, 515 secs
lola: 68718334 markings, 408456943 edges, 11138 markings/sec, 520 secs
lola: 68770344 markings, 411982875 edges, 10402 markings/sec, 525 secs
lola: 68824196 markings, 415634202 edges, 10770 markings/sec, 530 secs
lola: 68876981 markings, 419304075 edges, 10557 markings/sec, 535 secs
lola: 68926683 markings, 422811169 edges, 9940 markings/sec, 540 secs
lola: 68977719 markings, 426451933 edges, 10207 markings/sec, 545 secs
lola: 69028175 markings, 430193394 edges, 10091 markings/sec, 550 secs
lola: 69078347 markings, 433946280 edges, 10034 markings/sec, 555 secs
lola: 69127485 markings, 437715599 edges, 9828 markings/sec, 560 secs
lola: 69176586 markings, 441560083 edges, 9820 markings/sec, 565 secs
lola: 69224306 markings, 445424275 edges, 9544 markings/sec, 570 secs
lola: 69271223 markings, 449287175 edges, 9383 markings/sec, 575 secs
lola: 69318780 markings, 453146487 edges, 9511 markings/sec, 580 secs
lola: 69364031 markings, 456987781 edges, 9050 markings/sec, 585 secs
lola: 69407036 markings, 460827472 edges, 8601 markings/sec, 590 secs
lola: 69450374 markings, 464676652 edges, 8668 markings/sec, 595 secs
lola: 69492316 markings, 468532861 edges, 8388 markings/sec, 600 secs
lola: 69531593 markings, 472204911 edges, 7855 markings/sec, 605 secs
lola: 69570309 markings, 475903871 edges, 7743 markings/sec, 610 secs
lola: 69609663 markings, 479752715 edges, 7871 markings/sec, 615 secs
lola: 69649258 markings, 483700891 edges, 7919 markings/sec, 620 secs
lola: 69688770 markings, 487726825 edges, 7902 markings/sec, 625 secs
lola: 69727048 markings, 491702376 edges, 7656 markings/sec, 630 secs
lola: 69764414 markings, 495725988 edges, 7473 markings/sec, 635 secs
lola: 69800873 markings, 499819719 edges, 7292 markings/sec, 640 secs
lola: 69836513 markings, 504014035 edges, 7128 markings/sec, 645 secs
lola: 69871694 markings, 508430679 edges, 7036 markings/sec, 650 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 69887987 markings, 510847893 edges
lola: ========================================
lola: subprocess 4 will run for 727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p32)) AND ((p31 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p32)) AND ((p31 <= 0))))))
lola: processed formula length: 43
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 50 markings, 50 edges
lola: ========================================
lola: subprocess 5 will run for 969 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p37 <= 0)) R X (X (G ((((1 <= p19)) AND ((p48 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p37 <= 0)) R X (X (G ((((1 <= p19)) AND ((p48 <= 0)))))))
lola: processed formula length: 60
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 41 markings, 41 edges
lola: ========================================
lola: subprocess 6 will run for 1454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p21)) AND ((p20 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p21)) AND ((p20 <= 0)))))
lola: processed formula length: 39
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 33 markings, 34 edges
lola: ========================================
lola: subprocess 7 will run for 2908 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((p11 <= 0)) OR ((1 <= p12))) OR (G (F ((((p11 <= 0)) OR ((1 <= p12))))) AND F ((((p11 <= 0)) OR ((1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((p11 <= 0)) OR ((1 <= p12))) OR (G (F ((((p11 <= 0)) OR ((1 <= p12))))) AND F ((((p11 <= 0)) OR ((1 <= p12)))))))
lola: processed formula length: 122
lola: 55 rewrites
lola: closed formula file LTLCardinality.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: 104 markings, 116 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no
lola:
preliminary result: yes no no no no yes no no
lola: memory consumption: 26976 KB
lola: time consumption: 662 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="ShieldPPPt-PT-002A"
export BK_EXAMINATION="LTLCardinality"
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 ShieldPPPt-PT-002A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477700585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002A.tgz
mv ShieldPPPt-PT-002A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;