fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r189-tajo-162089432900321
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for RefineWMG-PT-015015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16256.903 3600000.00 317572.00 24736.60 FFF?FFTFTTFFTFFF 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/mcc2021-input.r189-tajo-162089432900321.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is RefineWMG-PT-015015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 35K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1621428947215

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 12:55:48] [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]
[2021-05-19 12:55:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 12:55:48] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-19 12:55:48] [INFO ] Transformed 79 places.
[2021-05-19 12:55:48] [INFO ] Transformed 63 transitions.
[2021-05-19 12:55:48] [INFO ] Parsed PT model containing 79 places and 63 transitions in 66 ms.
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 125 ms. (steps per millisecond=800 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 63 rows 79 cols
[2021-05-19 12:55:49] [INFO ] Computed 32 place invariants in 4 ms
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 18 ms returned sat
[2021-05-19 12:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-19 12:55:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:55:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2021-05-19 12:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:55:49] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-19 12:55:49] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 6 ms.
[2021-05-19 12:55:49] [INFO ] Added : 33 causal constraints over 7 iterations in 53 ms. Result :sat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 3 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 2 ms returned unsat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-19 12:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-19 12:55:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:55:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2021-05-19 12:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:55:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-19 12:55:49] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 6 ms.
[2021-05-19 12:55:49] [INFO ] Added : 34 causal constraints over 7 iterations in 40 ms. Result :sat
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2021-05-19 12:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:55:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-19 12:55:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:55:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2021-05-19 12:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:55:49] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-19 12:55:49] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 5 ms.
[2021-05-19 12:55:49] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2021-05-19 12:55:50] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-19 12:55:50] [INFO ] Flatten gal took : 28 ms
FORMULA RefineWMG-PT-015015-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:55:50] [INFO ] Flatten gal took : 8 ms
[2021-05-19 12:55:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 12:55:50] [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-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3245
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 May 19 12:55:52 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 6,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((G ((p43 <= 0)) R (X (F ((p17 <= 2))) AND (p43 <= 0))) OR (G ((1 <= p43)) AND F ((G ((p43 <= 0)) R (X (F ((p17 <= 2))) AND (p43 <= 0)))))))",
"processed_size": 143,
"rewrites": 67
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 73
},
"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": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((F (G ((F (G ((p51 <= p8))) AND G ((F ((p51 <= p8)) OR G ((p51 <= p8))))))) OR (p68 <= p3))))",
"processed_size": 99,
"rewrites": 67
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 25
},
"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": 567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (F ((2 <= p77))) OR (p4 <= 0)))",
"processed_size": 37,
"rewrites": 67
},
"result":
{
"edges": 16,
"markings": 17,
"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": 681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X ((G ((p1 <= p49)) AND (p27 <= p22)))))",
"processed_size": 46,
"rewrites": 67
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 851
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1135
},
"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": "F (G ((p23 <= p66)))",
"processed_size": 20,
"rewrites": 67
},
"result":
{
"edges": 2353,
"markings": 1347,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1135
},
"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": "F (G ((p15 <= p7)))",
"processed_size": 19,
"rewrites": 67
},
"result":
{
"edges": 3305,
"markings": 1918,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1703
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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 (F ((G ((p26 <= p21)) OR (2 <= p5))))",
"processed_size": 39,
"rewrites": 67
},
"result":
{
"edges": 576,
"markings": 388,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "F ((G (F ((p16 + 1 <= p51))) OR (p46 <= p44)))",
"processed_size": 46,
"rewrites": 67
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3252,
"runtime": 325.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : G(F((G(**) OR **))) : G((X((X(F(**)) AND (F(**) U G(*)))) OR **)) : G(((G(*) R (X(F(*)) AND *)) OR (G(**) AND F((G(*) R (X(F(*)) AND *)))))) : X(X((F(G((F(G(**)) AND G((F(**) OR G(**)))))) OR *))) : X((X(F(**)) OR *)) : X(X(X((G(**) AND **)))) : ((F(G(**)) AND G((F((X(**) OR **)) OR G(**)))) OR **) : F((G(F(*)) OR **))"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "no no unknown no no yes no no no ",
"value": "no no unknown no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: ((1 <= p75) U F (X (X (((3 <= p34) U G (X ((p15 <= p7)))))))) : G (F (X ((X (F (G ((p26 <= p21)))) OR F ((2 <= p5)))))) : G ((X ((F (X ((p20 <= p70))) AND (F ((2 <= p35)) U NOT(F ((2 <= p55)))))) OR (p20 <= p70))) : G ((G ((1 <= p43)) U NOT((F ((1 <= p43)) U (G (X ((3 <= p17))) OR (1 <= p43)))))) : X (NOT(X ((G (F (NOT(G ((F ((p51 <= p8)) U G ((p51 <= p8))))))) AND (p3 + 1 <= p68))))) : (F (X (X (((p47 <= p5) U (F ((1 <= p15)) U (2 <= p77)))))) OR NOT(X ((1 <= p4)))) : X (X (X ((G ((p1 <= p49)) AND (p27 <= p22))))) : (G ((F ((X ((p23 <= p66)) OR ((p44 <= p54) AND (p23 <= p66)))) U G ((p23 <= p66)))) OR (3 <= p45)) : F ((NOT(F (G ((p51 <= p16)))) OR (p46 <= p44)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:519
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((X (F ((p20 <= p70))) AND (F ((2 <= p35)) U G ((p55 <= 1))))) OR (p20 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((X (F ((p20 <= p70))) AND (F ((2 <= p35)) U G ((p55 <= 1))))) OR (p20 <= p70)))
lola: processed formula length: 86
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: 3349194 markings, 5135400 edges, 669839 markings/sec, 0 secs
lola: 6774767 markings, 10387953 edges, 685115 markings/sec, 5 secs
lola: 10078912 markings, 15454309 edges, 660829 markings/sec, 10 secs
lola: 13445689 markings, 20616692 edges, 673355 markings/sec, 15 secs
lola: 17101973 markings, 26222991 edges, 731257 markings/sec, 20 secs
lola: 20587148 markings, 31566937 edges, 697035 markings/sec, 25 secs
lola: 23989556 markings, 36783953 edges, 680482 markings/sec, 30 secs
lola: 27194233 markings, 41697795 edges, 640935 markings/sec, 35 secs
lola: 30379357 markings, 46581651 edges, 637025 markings/sec, 40 secs
lola: 33675450 markings, 51635673 edges, 659219 markings/sec, 45 secs
lola: 37406605 markings, 57356767 edges, 746231 markings/sec, 50 secs
lola: 41071505 markings, 62976272 edges, 732980 markings/sec, 55 secs
lola: 44703697 markings, 68545646 edges, 726438 markings/sec, 60 secs
lola: 48469488 markings, 74319883 edges, 753158 markings/sec, 65 secs
lola: 52297725 markings, 80189829 edges, 765647 markings/sec, 70 secs
lola: 55998120 markings, 85863753 edges, 740079 markings/sec, 75 secs
lola: 59618236 markings, 91414599 edges, 724023 markings/sec, 80 secs
lola: 63021856 markings, 96633496 edges, 680724 markings/sec, 85 secs
lola: 65979214 markings, 101169204 edges, 591472 markings/sec, 90 secs
lola: 67629261 markings, 103698936 edges, 330009 markings/sec, 95 secs
lola: 69219124 markings, 106136399 edges, 317973 markings/sec, 100 secs
lola: 70629837 markings, 108299057 edges, 282143 markings/sec, 105 secs
lola: 72119804 markings, 110583676 edges, 297993 markings/sec, 110 secs
lola: 73163667 markings, 112184267 edges, 208773 markings/sec, 115 secs
lola: 74878281 markings, 114813347 edges, 342923 markings/sec, 120 secs
lola: 76175065 markings, 116801736 edges, 259357 markings/sec, 125 secs
lola: 77596794 markings, 118981731 edges, 284346 markings/sec, 130 secs
lola: 79260799 markings, 121533197 edges, 332801 markings/sec, 135 secs
lola: 80375760 markings, 123242798 edges, 222992 markings/sec, 140 secs
lola: 82050472 markings, 125811888 edges, 334942 markings/sec, 145 secs
lola: 82894849 markings, 127105409 edges, 168875 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((p43 <= 0)) R (X (F ((p17 <= 2))) AND (p43 <= 0))) OR (G ((1 <= p43)) AND F ((G ((p43 <= 0)) R (X (F ((p17 <= 2))) AND (p43 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p43 <= 0)) R (X (F ((p17 <= 2))) AND (p43 <= 0))) OR (G ((1 <= p43)) AND F ((G ((p43 <= 0)) R (X (F ((p17 <= 2))) AND (p43 <= 0)))))))
lola: processed formula length: 143
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 73 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 2 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (G ((F (G ((p51 <= p8))) AND G ((F ((p51 <= p8)) OR G ((p51 <= p8))))))) OR (p68 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (G ((F (G ((p51 <= p8))) AND G ((F ((p51 <= p8)) OR G ((p51 <= p8))))))) OR (p68 <= p3))))
lola: processed formula length: 99
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 25 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 3 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((2 <= p77))) OR (p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((2 <= p77))) OR (p4 <= 0)))
lola: processed formula length: 37
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: 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 4 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((G ((p1 <= p49)) AND (p27 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((G ((p1 <= p49)) AND (p27 <= p22)))))
lola: processed formula length: 46
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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 5 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (G ((p23 <= p66))) AND G ((F ((X ((p23 <= p66)) OR ((p44 <= p54) AND (p23 <= p66)))) OR G ((p23 <= p66))))) OR (3 <= p45))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p45)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p45)
lola: processed formula length: 10
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p23 <= p66)))
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 ((p23 <= p66)))
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: add low 49
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: 1347 markings, 2353 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p15 <= p7)))
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 ((p15 <= p7)))
lola: processed formula length: 19
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: add low 61
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: 1918 markings, 3305 edges
lola: ========================================
lola: subprocess 7 will run for 1703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p26 <= p21)) OR (2 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p26 <= p21)) OR (2 <= p5))))
lola: processed formula length: 39
lola: 67 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: 388 markings, 576 edges
lola: ========================================
lola: subprocess 8 will run for 3406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((p16 + 1 <= p51))) OR (p46 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p16 + 1 <= p51))) OR (p46 <= p44)))
lola: processed formula length: 46
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: 7 markings, 7 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X ((X (F ((p20 <= p70))) AND (F ((2 <= p35)) U G ((p55 <= 1))))) OR (p20 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((X (F ((p20 <= p70))) AND (F ((2 <= p35)) U G ((p55 <= 1))))) OR (p20 <= p70)))
lola: processed formula length: 86
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: 3613743 markings, 5541048 edges, 722749 markings/sec, 0 secs
lola: 7384365 markings, 11322656 edges, 754124 markings/sec, 5 secs
lola: 11095445 markings, 17012983 edges, 742216 markings/sec, 10 secs
lola: 14872593 markings, 22804611 edges, 755430 markings/sec, 15 secs
lola: 18532174 markings, 28415965 edges, 731916 markings/sec, 20 secs
lola: 22316458 markings, 34218541 edges, 756857 markings/sec, 25 secs
lola: 25982548 markings, 39839877 edges, 733218 markings/sec, 30 secs
lola: 29319854 markings, 44957086 edges, 667461 markings/sec, 35 secs
lola: 32566362 markings, 49935058 edges, 649302 markings/sec, 40 secs
lola: 35934107 markings, 55098943 edges, 673549 markings/sec, 45 secs
lola: 39369412 markings, 60366405 edges, 687061 markings/sec, 50 secs
lola: 43023012 markings, 65968591 edges, 730720 markings/sec, 55 secs
lola: 46755116 markings, 71691139 edges, 746421 markings/sec, 60 secs
lola: 50579825 markings, 77555703 edges, 764942 markings/sec, 65 secs
lola: 54268077 markings, 83211021 edges, 737650 markings/sec, 70 secs
lola: 57922249 markings, 88814082 edges, 730834 markings/sec, 75 secs
lola: 61479198 markings, 94268080 edges, 711390 markings/sec, 80 secs
lola: 65079843 markings, 99789074 edges, 720129 markings/sec, 85 secs
lola: 66857088 markings, 102514343 edges, 355449 markings/sec, 90 secs
lola: 68727812 markings, 105382784 edges, 374145 markings/sec, 95 secs
lola: 70144527 markings, 107555102 edges, 283343 markings/sec, 100 secs
lola: 71444806 markings, 109548688 edges, 260056 markings/sec, 105 secs
lola: 72906782 markings, 111791042 edges, 292395 markings/sec, 110 secs
lola: 74341140 markings, 113989716 edges, 286872 markings/sec, 115 secs
lola: 75961248 markings, 116473889 edges, 324022 markings/sec, 120 secs
lola: 77740442 markings, 119201989 edges, 355839 markings/sec, 125 secs
lola: 79216484 markings, 121465248 edges, 295208 markings/sec, 130 secs
lola: 80335879 markings, 123181656 edges, 223879 markings/sec, 135 secs
lola: 81757023 markings, 125360744 edges, 284229 markings/sec, 140 secs
lola: 82492044 markings, 126487766 edges, 147004 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no no yes no no no
lola:
preliminary result: no no unknown no no yes no no no
lola: memory consumption: 3252 KB
lola: time consumption: 325 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="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is 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 r189-tajo-162089432900321"
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 ;