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.r113-smll-162075355800133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPPP-PT-C0100N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000100000-00
FORMULA_NAME GPPP-PT-C0100N0000100000-01
FORMULA_NAME GPPP-PT-C0100N0000100000-02
FORMULA_NAME GPPP-PT-C0100N0000100000-03
FORMULA_NAME GPPP-PT-C0100N0000100000-04
FORMULA_NAME GPPP-PT-C0100N0000100000-05
FORMULA_NAME GPPP-PT-C0100N0000100000-06
FORMULA_NAME GPPP-PT-C0100N0000100000-07
FORMULA_NAME GPPP-PT-C0100N0000100000-08
FORMULA_NAME GPPP-PT-C0100N0000100000-09
FORMULA_NAME GPPP-PT-C0100N0000100000-10
FORMULA_NAME GPPP-PT-C0100N0000100000-11
FORMULA_NAME GPPP-PT-C0100N0000100000-12
FORMULA_NAME GPPP-PT-C0100N0000100000-13
FORMULA_NAME GPPP-PT-C0100N0000100000-14
FORMULA_NAME GPPP-PT-C0100N0000100000-15

=== Now, execution of the tool begins

BK_START 1620959467265

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 02:31:10] [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-14 02:31:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 02:31:10] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-14 02:31:10] [INFO ] Transformed 33 places.
[2021-05-14 02:31:10] [INFO ] Transformed 22 transitions.
[2021-05-14 02:31:10] [INFO ] Parsed PT model containing 33 places and 22 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100061 steps, including 34 resets, run finished after 130 ms. (steps per millisecond=769 ) properties seen :[0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 02:31:10] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 19 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-14 02:31:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
[2021-05-14 02:31:12] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-14 02:31:12] [INFO ] Flatten gal took : 56 ms
FORMULA GPPP-PT-C0100N0000100000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 02:31:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 02:31:12] [INFO ] Flatten gal took : 16 ms
[2021-05-14 02:31:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPPP-PT-C0100N0000100000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 02:31:12] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-14 02:31:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ GPPP-PT-C0100N0000100000 @ 3570 seconds

FORMULA GPPP-PT-C0100N0000100000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000100000-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0100N0000100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3506
rslt: Output for LTLCardinality @ GPPP-PT-C0100N0000100000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 02:31:13 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((3 <= p27)))",
"processed_size": 18,
"rewrites": 21
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 876
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"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": "X (X (X (G ((p20 <= p26)))))",
"processed_size": 28,
"rewrites": 21
},
"result":
{
"edges": 2819,
"markings": 2817,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p9 <= p23)))",
"processed_size": 19,
"rewrites": 21
},
"result":
{
"edges": 1435,
"markings": 1433,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((p13 <= p23)) AND (F ((p27 <= p20)) OR (p27 <= p20))))",
"processed_size": 61,
"rewrites": 21
},
"result":
{
"edges": 801,
"markings": 802,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"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": 3506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"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": "G (F ((G (((F ((3 <= p18)) U (p11 <= p22)) OR (G ((2 <= p22)) AND F ((p11 <= p22))))) OR ((2 <= p22) AND (1 <= p7)))))",
"processed_size": 118,
"rewrites": 21
},
"result":
{
"edges": 2808,
"markings": 2808,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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": 19012,
"runtime": 64.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(**)) : G(F(**)) : F((F(**) AND (F(**) OR **))) : X(G(**)) : X(X(X(G(**)))) : G(F((G(((F(**) U **) OR (G(**) AND F(**)))) OR **)))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no no yes no no no ",
"value": "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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X (((X ((p30 <= p23)) U (0 <= 0)) AND ((0 <= 0) U F (((p16 <= p9) AND (1 <= p5)))))) : G (X (NOT(G (NOT(F ((p9 <= p23))))))) : F ((F ((p13 <= p23)) AND (F ((p27 <= p20)) OR (p27 <= p20)))) : X (G ((3 <= p27))) : G (X (G (X (X ((p20 <= p26)))))) : G (F ((G ((G ((2 <= p22)) U (F ((3 <= p18)) U (p11 <= p22)))) OR ((2 <= p22) AND (1 <= p7)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p16 <= p9) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p16 <= p9) AND (1 <= p5))))
lola: processed formula length: 35
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: 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: 3734 markings, 3734 edges
lola: ========================================
lola: subprocess 1 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((3 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((3 <= p27)))
lola: processed formula length: 18
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: 2810 markings, 2810 edges
lola: ========================================
lola: subprocess 2 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((p20 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((p20 <= p26)))))
lola: processed formula length: 28
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2817 markings, 2819 edges
lola: ========================================
lola: subprocess 3 will run for 1168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p9 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p9 <= p23)))
lola: processed formula length: 19
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: 1433 markings, 1435 edges
lola: ========================================
lola: subprocess 4 will run for 1753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p13 <= p23)) AND (F ((p27 <= p20)) OR (p27 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p13 <= p23)) AND (F ((p27 <= p20)) OR (p27 <= p20))))
lola: processed formula length: 61
lola: 21 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 802 markings, 801 edges
lola: ========================================
lola: subprocess 5 will run for 3506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((F ((3 <= p18)) U (p11 <= p22)) OR (G ((2 <= p22)) AND F ((p11 <= p22))))) OR ((2 <= p22) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((F ((3 <= p18)) U (p11 <= p22)) OR (G ((2 <= p22)) AND F ((p11 <= p22))))) OR ((2 <= p22) AND (1 <= p7)))))
lola: processed formula length: 118
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 2808 markings, 2808 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no
lola:
preliminary result: no no yes no no no
lola: memory consumption: 19012 KB
lola: time consumption: 64 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="GPPP-PT-C0100N0000100000"
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 GPPP-PT-C0100N0000100000, 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 r113-smll-162075355800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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