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-162039097100041.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-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097100041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 57K 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-20a-00
FORMULA_NAME DES-PT-20a-01
FORMULA_NAME DES-PT-20a-02
FORMULA_NAME DES-PT-20a-03
FORMULA_NAME DES-PT-20a-04
FORMULA_NAME DES-PT-20a-05
FORMULA_NAME DES-PT-20a-06
FORMULA_NAME DES-PT-20a-07
FORMULA_NAME DES-PT-20a-08
FORMULA_NAME DES-PT-20a-09
FORMULA_NAME DES-PT-20a-10
FORMULA_NAME DES-PT-20a-11
FORMULA_NAME DES-PT-20a-12
FORMULA_NAME DES-PT-20a-13
FORMULA_NAME DES-PT-20a-14
FORMULA_NAME DES-PT-20a-15

=== Now, execution of the tool begins

BK_START 1620506146048

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 20:35:47] [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 20:35:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 20:35:47] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-08 20:35:47] [INFO ] Transformed 195 places.
[2021-05-08 20:35:47] [INFO ] Transformed 152 transitions.
[2021-05-08 20:35:47] [INFO ] Found NUPN structural information;
[2021-05-08 20:35:47] [INFO ] Parsed PT model containing 195 places and 152 transitions in 97 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2226 resets, run finished after 416 ms. (steps per millisecond=240 ) properties seen :[0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 138 rows 195 cols
[2021-05-08 20:35:48] [INFO ] Computed 59 place invariants in 14 ms
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-08 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned unsat
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2021-05-08 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-08 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned unsat
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:49] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-08 20:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-08 20:35:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 20:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:49] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-08 20:35:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 20:35:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2021-05-08 20:35:49] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 13 ms.
[2021-05-08 20:35:49] [INFO ] Added : 91 causal constraints over 19 iterations in 359 ms. Result :sat
[2021-05-08 20:35:49] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:49] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-08 20:35:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned unsat
[2021-05-08 20:35:50] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:50] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-08 20:35:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:50] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:50] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 13 ms.
[2021-05-08 20:35:50] [INFO ] Added : 97 causal constraints over 20 iterations in 302 ms. Result :sat
[2021-05-08 20:35:50] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:35:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-08 20:35:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2021-05-08 20:35:51] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2021-05-08 20:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:51] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-08 20:35:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:51] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 8 ms.
[2021-05-08 20:35:51] [INFO ] Added : 119 causal constraints over 24 iterations in 320 ms. Result :sat
[2021-05-08 20:35:51] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2021-05-08 20:35:51] [INFO ] Deduced a trap composed of 10 places in 36 ms
[2021-05-08 20:35:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2021-05-08 20:35:51] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:51] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-08 20:35:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:52] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:52] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2021-05-08 20:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-08 20:35:52] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 10 ms.
[2021-05-08 20:35:52] [INFO ] Added : 124 causal constraints over 25 iterations in 428 ms. Result :sat
[2021-05-08 20:35:52] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:52] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-08 20:35:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned unsat
[2021-05-08 20:35:52] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:53] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-08 20:35:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 157 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:53] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-08 20:35:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:53] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 6 ms.
[2021-05-08 20:35:53] [INFO ] Added : 108 causal constraints over 22 iterations in 358 ms. Result :sat
[2021-05-08 20:35:54] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2021-05-08 20:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2021-05-08 20:35:54] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:54] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-08 20:35:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 20:35:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 20:35:54] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-08 20:35:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-08 20:35:54] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 9 ms.
[2021-05-08 20:35:54] [INFO ] Added : 135 causal constraints over 28 iterations in 354 ms. Result :sat
[2021-05-08 20:35:54] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2021-05-08 20:35:55] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2021-05-08 20:35:55] [INFO ] Deduced a trap composed of 19 places in 37 ms
[2021-05-08 20:35:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
Successfully simplified 4 atomic propositions for a total of 6 simplifications.
[2021-05-08 20:35:55] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-08 20:35:55] [INFO ] Flatten gal took : 53 ms
FORMULA DES-PT-20a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 20:35:55] [INFO ] Applying decomposition
[2021-05-08 20:35:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-08 20:35:55] [INFO ] Flatten gal took : 22 ms
[2021-05-08 20:35:55] [INFO ] Decomposing Gal with order
[2021-05-08 20:35:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 20:35:55] [INFO ] Removed a total of 153 redundant transitions.
[2021-05-08 20:35:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-08 20:35:55] [INFO ] Flatten gal took : 60 ms
[2021-05-08 20:35:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 12 ms.
[2021-05-08 20:35:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-20a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 20:35:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-08 20:35:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DES-PT-20a @ 3570 seconds

FORMULA DES-PT-20a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

{
"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 20:35:56 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 5,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (X (G ((G ((((p149 <= 0)) OR ((1 <= p131)))) OR (((1 <= p81)) AND ((p149 <= 0)) AND ((1 <= p13)) AND ((p85 <= 0))))))))",
"processed_size": 125,
"rewrites": 43
},
"result":
{
"edges": 233221,
"markings": 51612,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"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": "X (X ((G (((1 <= p9))) AND (((p50 <= 0)) OR ((1 <= p165))))))",
"processed_size": 62,
"rewrites": 43
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p42))) OR ((F ((((p135 <= 0)) OR ((1 <= p44)))) OR G (((1 <= p42)))) AND X (G (((1 <= p42)))))))",
"processed_size": 111,
"rewrites": 43
},
"result":
{
"edges": 45,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p122)) AND ((p111 <= 0)))))",
"processed_size": 41,
"rewrites": 43
},
"result":
{
"edges": 28,
"markings": 27,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 23924,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(G((G(**) OR **))))) : F(G(**)) : X(X((G(**) AND **))) : X(X(G(**))) : F((G(**) OR ((F(**) OR G(**)) AND X(G(**)))))"
},
"net":
{
"arcs": 678,
"conflict_clusters": 46,
"places": 195,
"places_significant": 136,
"singleton_clusters": 0,
"transitions": 138
},
"result":
{
"preliminary_value": "no no no no no ",
"value": "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: 333/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 195
lola: finding significant places
lola: 195 places, 138 transitions, 136 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: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: X (G (X (X ((G ((((p149 <= 0)) OR ((1 <= p131)))) OR (((1 <= p81)) AND ((p149 <= 0)) AND ((1 <= p13)) AND ((p85 <= 0)))))))) : F (X (NOT(G (NOT(((((p122 <= 0)) OR ((1 <= p111))) U G ((((1 <= p122)) AND ((p111 <= 0)))))))))) : X (X ((G (((1 <= p9))) AND (((p50 <= 0)) OR ((1 <= p165)))))) : X (X (G (((1 <= 0) U (((p135 <= 0)) OR ((1 <= p98))))))) : NOT(G (((NOT(F ((((p135 <= 0)) OR ((1 <= p44))))) AND NOT(G (((1 <= p42))))) U NOT(G (X (((1 <= p42))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((G ((((p149 <= 0)) OR ((1 <= p131)))) OR (((1 <= p81)) AND ((p149 <= 0)) AND ((1 <= p13)) AND ((p85 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((G ((((p149 <= 0)) OR ((1 <= p131)))) OR (((1 <= p81)) AND ((p149 <= 0)) AND ((1 <= p13)) AND ((p85 <= 0))))))))
lola: processed formula length: 125
lola: 43 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: 51612 markings, 233221 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((1 <= p9))) AND (((p50 <= 0)) OR ((1 <= p165))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((1 <= p9))) AND (((p50 <= 0)) OR ((1 <= p165))))))
lola: processed formula length: 62
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p135 <= 0)) OR ((1 <= p98))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p135 <= 0)) OR ((1 <= p98))))))
lola: processed formula length: 44
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: ========================================
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: 51612 markings, 233221 edges
lola: ========================================
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p42))) OR ((F ((((p135 <= 0)) OR ((1 <= p44)))) OR G (((1 <= p42)))) AND X (G (((1 <= p42)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p42))) OR ((F ((((p135 <= 0)) OR ((1 <= p44)))) OR G (((1 <= p42)))) AND X (G (((1 <= p42)))))))
lola: processed formula length: 111
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 15 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 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p122)) AND ((p111 <= 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 ((((1 <= p122)) AND ((p111 <= 0)))))
lola: processed formula length: 41
lola: 43 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: 27 markings, 28 edges
lola: RESULT
lola:
SUMMARY: no no no no no
lola:
preliminary result: no no no no no
lola: ========================================
lola: memory consumption: 23924 KB
lola: time consumption: 3 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-20a"
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-20a, 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-162039097100041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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