fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r075-tall-162039097100033
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DES-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4283.764 3600000.00 37830.00 300.30 TFTTFFFTFTTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097100033.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DES-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K 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 DES-PT-10a-00
FORMULA_NAME DES-PT-10a-01
FORMULA_NAME DES-PT-10a-02
FORMULA_NAME DES-PT-10a-03
FORMULA_NAME DES-PT-10a-04
FORMULA_NAME DES-PT-10a-05
FORMULA_NAME DES-PT-10a-06
FORMULA_NAME DES-PT-10a-07
FORMULA_NAME DES-PT-10a-08
FORMULA_NAME DES-PT-10a-09
FORMULA_NAME DES-PT-10a-10
FORMULA_NAME DES-PT-10a-11
FORMULA_NAME DES-PT-10a-12
FORMULA_NAME DES-PT-10a-13
FORMULA_NAME DES-PT-10a-14
FORMULA_NAME DES-PT-10a-15

=== Now, execution of the tool begins

BK_START 1620502879136

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 19:41:20] [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-08 19:41:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 19:41:20] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2021-05-08 19:41:20] [INFO ] Transformed 155 places.
[2021-05-08 19:41:20] [INFO ] Transformed 112 transitions.
[2021-05-08 19:41:20] [INFO ] Found NUPN structural information;
[2021-05-08 19:41:20] [INFO ] Parsed PT model containing 155 places and 112 transitions in 103 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2211 resets, run finished after 378 ms. (steps per millisecond=264 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 98 rows 155 cols
[2021-05-08 19:41:21] [INFO ] Computed 59 place invariants in 10 ms
[2021-05-08 19:41:21] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2021-05-08 19:41:21] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 11 ms returned sat
[2021-05-08 19:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:21] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 19:41:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2021-05-08 19:41:21] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 29 ms returned sat
[2021-05-08 19:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:21] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-08 19:41:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 19:41:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 19:41:21] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2021-05-08 19:41:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-08 19:41:21] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 11 ms.
[2021-05-08 19:41:21] [INFO ] Added : 94 causal constraints over 19 iterations in 201 ms. Result :sat
[2021-05-08 19:41:21] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2021-05-08 19:41:21] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 10 ms returned sat
[2021-05-08 19:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:22] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-08 19:41:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 9 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:22] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 19:41:22] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 7 ms.
[2021-05-08 19:41:22] [INFO ] Added : 79 causal constraints over 17 iterations in 233 ms. Result :sat
[2021-05-08 19:41:22] [INFO ] Deduced a trap composed of 12 places in 27 ms
[2021-05-08 19:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-08 19:41:22] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 9 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:22] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-08 19:41:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:22] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 19:41:22] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 5 ms.
[2021-05-08 19:41:22] [INFO ] Added : 86 causal constraints over 18 iterations in 184 ms. Result :sat
[2021-05-08 19:41:22] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 8 ms returned sat
[2021-05-08 19:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-08 19:41:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Nat]Absence check using 33 positive and 26 generalized place invariants in 26 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:23] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 19:41:23] [INFO ] Computed and/alt/rep : 97/364/97 causal constraints in 6 ms.
[2021-05-08 19:41:23] [INFO ] Added : 80 causal constraints over 16 iterations in 180 ms. Result :unsat
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 9 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-08 19:41:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned unsat
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 9 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-08 19:41:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned unsat
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using 33 positive and 26 generalized place invariants in 10 ms returned sat
[2021-05-08 19:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 19:41:23] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-08 19:41:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 19:41:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2021-05-08 19:41:24] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-08 19:41:24] [INFO ] Flatten gal took : 45 ms
FORMULA DES-PT-10a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 19:41:24] [INFO ] Applying decomposition
[2021-05-08 19:41:24] [INFO ] Flatten gal took : 14 ms
[2021-05-08 19:41:24] [INFO ] Decomposing Gal with order
[2021-05-08 19:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 19:41:24] [INFO ] Removed a total of 83 redundant transitions.
[2021-05-08 19:41:24] [INFO ] Flatten gal took : 41 ms
[2021-05-08 19:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 8 ms.
[2021-05-08 19:41:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-08 19:41:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DES-PT-10a @ 3570 seconds

FORMULA DES-PT-10a-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3544
rslt: Output for LTLCardinality @ DES-PT-10a

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 8 19:41:25 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((((p74 <= 0)) OR ((1 <= p51)))))) OR F (((((p91 <= 0)) OR ((1 <= p47))) OR ((1 <= p49))))))",
"processed_size": 106,
"rewrites": 21
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 3,
"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 (G ((X (X ((((p32 <= 0)) OR ((1 <= p27))))) AND F (((1 <= p109))))))",
"processed_size": 71,
"rewrites": 21
},
"result":
{
"edges": 47,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((X (F ((X (F ((((p102 <= 0)) OR ((1 <= p49))))) AND (((p73 <= 0)) OR ((1 <= p109)))))) AND F (G ((((p145 <= 0)) OR ((1 <= p17)))))))",
"processed_size": 138,
"rewrites": 21
},
"result":
{
"edges": 20025452,
"markings": 2082431,
"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": 1181
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((((1 <= p69)) AND ((p53 <= 0)))))",
"processed_size": 39,
"rewrites": 21
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"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": 1772
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G (((p77 <= 0))))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 6103,
"markings": 2882,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 ((((p119 <= 0)) OR ((1 <= p148))))",
"processed_size": 37,
"rewrites": 21
},
"result":
{
"edges": 134,
"markings": 123,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 23412,
"runtime": 26.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(X(G(**))) OR F((** OR **)))) : F(G((X(X(**)) AND F(*)))) : G((X(F((X(F(**)) AND **))) AND F(G(**)))) : G(*) : X(G(*)) : F(G(*))"
},
"net":
{
"arcs": 488,
"conflict_clusters": 46,
"places": 155,
"places_significant": 96,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "yes no no no no no ",
"value": "yes no no 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: 253/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 155
lola: finding significant places
lola: 155 places, 98 transitions, 96 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: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: X (((G (X (X ((((p74 <= 0)) OR ((1 <= p51)))))) OR F ((((p91 <= 0)) OR ((1 <= p47))))) OR F (((1 <= p49))))) : F (G ((X (X ((((p32 <= 0)) OR ((1 <= p27))))) AND F (NOT(G (((p109 <= 0)))))))) : G ((F ((X (X (F ((((p102 <= 0)) OR ((1 <= p49)))))) AND X ((((p73 <= 0)) OR ((1 <= p109)))))) AND F (G ((((p145 <= 0)) OR ((1 <= p17))))))) : NOT(F ((((1 <= p119)) AND ((p148 <= 0))))) : NOT(X (F ((((p69 <= 0)) OR ((1 <= p53)))))) : G (F (X (NOT(((1 <= 0) U F (((1 <= p77))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((((p74 <= 0)) OR ((1 <= p51)))))) OR F (((((p91 <= 0)) OR ((1 <= p47))) OR ((1 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((((p74 <= 0)) OR ((1 <= p51)))))) OR F (((((p91 <= 0)) OR ((1 <= p47))) OR ((1 <= p49))))))
lola: processed formula length: 106
lola: 21 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: 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X ((((p32 <= 0)) OR ((1 <= p27))))) AND F (((1 <= p109))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X ((((p32 <= 0)) OR ((1 <= p27))))) AND F (((1 <= p109))))))
lola: processed formula length: 71
lola: 21 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: 46 markings, 47 edges
lola: ========================================
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((X (F ((((p102 <= 0)) OR ((1 <= p49))))) AND (((p73 <= 0)) OR ((1 <= p109)))))) AND F (G ((((p145 <= 0)) OR ((1 <= p17)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((X (F ((((p102 <= 0)) OR ((1 <= p49))))) AND (((p73 <= 0)) OR ((1 <= p109)))))) AND F (G ((((p145 <= 0)) OR ((1 <= p17)))))))
lola: processed formula length: 138
lola: 21 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: 621682 markings, 4448423 edges, 124336 markings/sec, 0 secs
lola: 1126731 markings, 8716692 edges, 101010 markings/sec, 5 secs
lola: 1498221 markings, 13054367 edges, 74298 markings/sec, 10 secs
lola: 1911614 markings, 17231541 edges, 82679 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2082431 markings, 20025452 edges
lola: ========================================
lola: subprocess 3 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p69)) AND ((p53 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p69)) AND ((p53 <= 0)))))
lola: processed formula length: 39
lola: 21 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 4 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p77 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p77 <= 0))))
lola: processed formula length: 20
lola: 21 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: 2882 markings, 6103 edges
lola: ========================================
lola: subprocess 5 will run for 3544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p119 <= 0)) OR ((1 <= p148))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p119 <= 0)) OR ((1 <= p148))))
lola: processed formula length: 37
lola: 21 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: 123 markings, 134 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no
lola:
preliminary result: yes no no no no no
lola: memory consumption: 23412 KB
lola: time consumption: 26 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="DES-PT-10a"
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 DES-PT-10a, 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 r075-tall-162039097100033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a 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 ;