fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987938500065
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for RefineWMG-PT-015015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15799.930 3600000.00 291307.00 99042.20 FFTFFFFFFFT?FFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RefineWMG-PT-015015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 35K Mar 24 05:38 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 RefineWMG-PT-015015-00
FORMULA_NAME RefineWMG-PT-015015-01
FORMULA_NAME RefineWMG-PT-015015-02
FORMULA_NAME RefineWMG-PT-015015-03
FORMULA_NAME RefineWMG-PT-015015-04
FORMULA_NAME RefineWMG-PT-015015-05
FORMULA_NAME RefineWMG-PT-015015-06
FORMULA_NAME RefineWMG-PT-015015-07
FORMULA_NAME RefineWMG-PT-015015-08
FORMULA_NAME RefineWMG-PT-015015-09
FORMULA_NAME RefineWMG-PT-015015-10
FORMULA_NAME RefineWMG-PT-015015-11
FORMULA_NAME RefineWMG-PT-015015-12
FORMULA_NAME RefineWMG-PT-015015-13
FORMULA_NAME RefineWMG-PT-015015-14
FORMULA_NAME RefineWMG-PT-015015-15

=== Now, execution of the tool begins

BK_START 1591224854436

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:54:16] [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-03 22:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:54:16] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-03 22:54:16] [INFO ] Transformed 79 places.
[2020-06-03 22:54:16] [INFO ] Transformed 63 transitions.
[2020-06-03 22:54:16] [INFO ] Parsed PT model containing 79 places and 63 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 157 ms. (steps per millisecond=636 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-06-03 22:54:16] [INFO ] Computed 32 place invariants in 3 ms
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2020-06-03 22:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-03 22:54:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:54:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2020-06-03 22:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:17] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-03 22:54:17] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 10 ms.
[2020-06-03 22:54:17] [INFO ] Added : 35 causal constraints over 7 iterations in 75 ms. Result :sat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned unsat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-03 22:54:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:54:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 22:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:17] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-03 22:54:17] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 5 ms.
[2020-06-03 22:54:17] [INFO ] Added : 33 causal constraints over 7 iterations in 35 ms. Result :sat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned unsat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 3 ms returned unsat
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 22:54:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-03 22:54:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:54:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 22:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:17] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-03 22:54:17] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 2 ms.
[2020-06-03 22:54:18] [INFO ] Added : 34 causal constraints over 7 iterations in 101 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 22:54:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 22:54:18] [INFO ] Flatten gal took : 60 ms
FORMULA RefineWMG-PT-015015-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:54:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 22:54:18] [INFO ] Flatten gal took : 7 ms
[2020-06-03 22:54:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RefineWMG-PT-015015-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:54:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 22:54:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-015015 @ 3570 seconds

FORMULA RefineWMG-PT-015015-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3079
rslt: Output for LTLCardinality @ RefineWMG-PT-015015

{
"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": "Wed Jun 3 22:54:18 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74))) OR (G ((1 <= p74)) AND F ((((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74)))))))",
"processed_size": 139,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G (((X (G ((p62 <= 1))) R (p37 + 1 <= p43)) AND (p52 <= p11))))",
"processed_size": 66,
"rewrites": 67
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X (X (G ((G (((p30 <= p11) AND (p45 + 1 <= p73))) AND (p30 <= p11))))))",
"processed_size": 74,
"rewrites": 67
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X ((p69 + 1 <= p4)) AND (X (X ((p4 <= p69))) OR (p1 <= 2)))))",
"processed_size": 68,
"rewrites": 67
},
"result":
{
"edges": 16,
"markings": 16,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F ((p69 + 1 <= p32))) AND (p58 <= 0)))",
"processed_size": 45,
"rewrites": 67
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1643
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p15 <= p59)))",
"processed_size": 20,
"rewrites": 67
},
"result":
{
"edges": 418,
"markings": 321,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 3286
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p25)) AND (3 <= p1))))",
"processed_size": 38,
"rewrites": 67
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 3212,
"runtime": 491.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((((** U **) AND G(**)) OR (G(**) AND F(((** U **) AND G(**)))))) : F(G(((X(G(*)) R *) AND *))) : F(G((F(**) AND **))) : X(X(X(G((G(**) AND *))))) : X(F((X(**) AND (X(X(**)) OR **)))) : F((X(F(*)) AND *)) : X((G(**) OR G(**))) : G(F(**)) : G((X(G(*)) OR **))"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "no no no no no yes unknown no no ",
"value": "no no no no no yes unknown 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: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 63 transitions, 47 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: X ((G ((1 <= p74)) U (((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74))))) : X (F (G (NOT(F (((F (X ((2 <= p62))) U (p43 <= p37)) OR (p11 + 1 <= p52))))))) : X (G (F ((G (X (F (X (F ((1 <= p25)))))) AND G ((3 <= p1)))))) : G (NOT(X (X (X ((NOT(G (((p30 <= p11) AND (p45 + 1 <= p73)))) OR (p11 + 1 <= p30))))))) : X (F ((X ((p69 + 1 <= p4)) AND (NOT(X (NOT(X ((p4 <= p69))))) OR (p1 <= 2))))) : NOT(G ((X (G ((p32 <= p69))) OR (1 <= p58)))) : (X (G ((p30 <= p55))) OR G (X ((p30 <= p55)))) : G (NOT(X (X (F (NOT(F (X (X (((2 <= p29) U (p15 <= p59))))))))))) : G ((NOT(F (X ((2 <= p72)))) OR (p76 + 1 <= p32)))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:300
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:350
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74))) OR (G ((1 <= p74)) AND F ((((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74))) OR (G ((1 <= p74)) AND F ((((2 <= p77) U (1 <= p74)) AND G ((p57 + 1 <= p74)))))))
lola: processed formula length: 139
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (G ((p62 <= 1))) R (p37 + 1 <= p43)) AND (p52 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (G ((p62 <= 1))) R (p37 + 1 <= p43)) AND (p52 <= p11))))
lola: processed formula length: 66
lola: 67 rewrites
lola: closed formula file LTLCardinality.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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((G (((p30 <= p11) AND (p45 + 1 <= p73))) AND (p30 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((G (((p30 <= p11) AND (p45 + 1 <= p73))) AND (p30 <= p11))))))
lola: processed formula length: 74
lola: 67 rewrites
lola: closed formula file LTLCardinality.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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p69 + 1 <= p4)) AND (X (X ((p4 <= p69))) OR (p1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p69 + 1 <= p4)) AND (X (X ((p4 <= p69))) OR (p1 <= 2)))))
lola: processed formula length: 68
lola: 67 rewrites
lola: closed formula file LTLCardinality.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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p69 + 1 <= p32))) AND (p58 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p69 + 1 <= p32))) AND (p58 <= 0)))
lola: processed formula length: 45
lola: 67 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p30 <= p55)) OR G ((p30 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p30 <= p55)) OR G ((p30 <= p55))))
lola: processed formula length: 42
lola: 67 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: 4199515 markings, 6439242 edges, 839903 markings/sec, 0 secs
lola: 8290920 markings, 12712726 edges, 818281 markings/sec, 5 secs
lola: 12563930 markings, 19264672 edges, 854602 markings/sec, 10 secs
lola: 17014463 markings, 26088821 edges, 890107 markings/sec, 15 secs
lola: 21161632 markings, 32447812 edges, 829434 markings/sec, 20 secs
lola: 25143062 markings, 38552667 edges, 796286 markings/sec, 25 secs
lola: 28977450 markings, 44432064 edges, 766878 markings/sec, 30 secs
lola: 32877761 markings, 50412543 edges, 780062 markings/sec, 35 secs
lola: 36948154 markings, 56653810 edges, 814079 markings/sec, 40 secs
lola: 40979386 markings, 62835028 edges, 806246 markings/sec, 45 secs
lola: 44988454 markings, 68982270 edges, 801814 markings/sec, 50 secs
lola: 49019988 markings, 75163953 edges, 806307 markings/sec, 55 secs
lola: 53025021 markings, 81304996 edges, 801007 markings/sec, 60 secs
lola: 56948189 markings, 87320529 edges, 784634 markings/sec, 65 secs
lola: 60776114 markings, 93190013 edges, 765585 markings/sec, 70 secs
lola: 64632352 markings, 99102925 edges, 771248 markings/sec, 75 secs
lola: 66010522 markings, 101216403 edges, 275634 markings/sec, 80 secs
lola: 67586533 markings, 103644676 edges, 315202 markings/sec, 85 secs
lola: 69168743 markings, 106058715 edges, 316442 markings/sec, 90 secs
lola: 70801492 markings, 108562974 edges, 326550 markings/sec, 95 secs
lola: 71581350 markings, 109758052 edges, 155972 markings/sec, 100 secs
lola: 71716263 markings, 109964912 edges, 26983 markings/sec, 105 secs
lola: 72351157 markings, 110938417 edges, 126979 markings/sec, 110 secs
lola: 72818466 markings, 111654955 edges, 93462 markings/sec, 115 secs
lola: 73400908 markings, 112548044 edges, 116488 markings/sec, 120 secs
lola: 74356570 markings, 114013376 edges, 191132 markings/sec, 125 secs
lola: 75258163 markings, 115395820 edges, 180319 markings/sec, 130 secs
lola: 75258163 markings, 115395820 edges, 0 markings/sec, 135 secs
lola: 75536740 markings, 115822978 edges, 55715 markings/sec, 140 secs
lola: 77297625 markings, 118522998 edges, 352177 markings/sec, 145 secs
lola: 77297625 markings, 118522998 edges, 0 markings/sec, 150 secs
lola: 77297625 markings, 118522998 edges, 0 markings/sec, 155 secs
lola: 77474253 markings, 118793831 edges, 35326 markings/sec, 160 secs
lola: 77923461 markings, 119482614 edges, 89842 markings/sec, 165 secs
lola: 78168714 markings, 119858666 edges, 49051 markings/sec, 170 secs
lola: 79022797 markings, 121168253 edges, 170817 markings/sec, 175 secs
lola: 79022797 markings, 121168253 edges, 0 markings/sec, 180 secs
lola: 79022797 markings, 121168253 edges, 0 markings/sec, 185 secs
lola: 80245290 markings, 123042748 edges, 244499 markings/sec, 190 secs
lola: 81651120 markings, 125198356 edges, 281166 markings/sec, 195 secs
lola: 81651120 markings, 125198356 edges, 0 markings/sec, 200 secs
lola: 81651120 markings, 125198356 edges, 0 markings/sec, 205 secs
lola: 82780224 markings, 126929896 edges, 225821 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 1095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((p72 <= 1))) OR (p76 + 1 <= p32)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((p72 <= 1))) OR (p76 + 1 <= p32)))
lola: processed formula length: 44
lola: 67 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: 16 markings, 16 edges
lola: subprocess 7 will run for 1643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((p15 <= p59)))
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 ((p15 <= p59)))
lola: processed formula length: 20
lola: 67 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: 321 markings, 418 edges
lola: ========================================
lola: subprocess 8 will run for 3286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p25)) AND (3 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p25)) AND (3 <= p1))))
lola: processed formula length: 38
lola: 67 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: 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: 9 markings, 10 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((p30 <= p55)) OR G ((p30 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p30 <= p55)) OR G ((p30 <= p55))))
lola: processed formula length: 42
lola: 67 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: 4399867 markings, 6746439 edges, 879973 markings/sec, 0 secs
lola: 8600035 markings, 13186701 edges, 840034 markings/sec, 5 secs
lola: 12829308 markings, 19671588 edges, 845855 markings/sec, 10 secs
lola: 17099202 markings, 26218751 edges, 853979 markings/sec, 15 secs
lola: 21228011 markings, 32549595 edges, 825762 markings/sec, 20 secs
lola: 25232737 markings, 38690175 edges, 800945 markings/sec, 25 secs
lola: 29105010 markings, 44627661 edges, 774455 markings/sec, 30 secs
lola: 33097767 markings, 50749888 edges, 798551 markings/sec, 35 secs
lola: 37170689 markings, 56995033 edges, 814584 markings/sec, 40 secs
lola: 41095509 markings, 63013076 edges, 784964 markings/sec, 45 secs
lola: 44991312 markings, 68986644 edges, 779161 markings/sec, 50 secs
lola: 49021436 markings, 75166182 edges, 806025 markings/sec, 55 secs
lola: 53078412 markings, 81386868 edges, 811395 markings/sec, 60 secs
lola: 57020622 markings, 87431588 edges, 788442 markings/sec, 65 secs
lola: 60821341 markings, 93259368 edges, 760144 markings/sec, 70 secs
lola: 64701287 markings, 99208617 edges, 775989 markings/sec, 75 secs
lola: 67013640 markings, 102754848 edges, 462471 markings/sec, 80 secs
lola: 68041695 markings, 104331298 edges, 205611 markings/sec, 85 secs
lola: 70732451 markings, 108460196 edges, 538151 markings/sec, 90 secs
lola: 73400320 markings, 112547166 edges, 533574 markings/sec, 95 secs
lola: 75360571 markings, 115552852 edges, 392050 markings/sec, 100 secs
lola: 75429888 markings, 115659138 edges, 13863 markings/sec, 105 secs
lola: 75429888 markings, 115659138 edges, 0 markings/sec, 110 secs
lola: 76116823 markings, 116712432 edges, 137387 markings/sec, 115 secs
lola: 77708060 markings, 119152335 edges, 318247 markings/sec, 120 secs
lola: 78623935 markings, 120556672 edges, 183175 markings/sec, 125 secs
lola: 78624755 markings, 120557927 edges, 164 markings/sec, 130 secs
lola: 80151129 markings, 122898371 edges, 305275 markings/sec, 135 secs
lola: 81157308 markings, 124441178 edges, 201236 markings/sec, 140 secs
lola: 81157308 markings, 124441178 edges, 0 markings/sec, 145 secs
lola: 81157308 markings, 124441178 edges, 0 markings/sec, 150 secs
lola: 81157308 markings, 124441178 edges, 0 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes unknown no no
lola:
preliminary result: no no no no no yes unknown no no
lola: memory consumption: 3212 KB
lola: time consumption: 491 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="RefineWMG-PT-015015"
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 RefineWMG-PT-015015, 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 r186-oct2-158987938500065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-015015.tgz
mv RefineWMG-PT-015015 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;