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

About the Execution of 2020-gold for SmartHome-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4277.504 3600000.00 10579.00 330.80 TFTFFTTTFTFFTTTF 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.r265-tall-162106800300077.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 SmartHome-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:52 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 SmartHome-PT-01-00
FORMULA_NAME SmartHome-PT-01-01
FORMULA_NAME SmartHome-PT-01-02
FORMULA_NAME SmartHome-PT-01-03
FORMULA_NAME SmartHome-PT-01-04
FORMULA_NAME SmartHome-PT-01-05
FORMULA_NAME SmartHome-PT-01-06
FORMULA_NAME SmartHome-PT-01-07
FORMULA_NAME SmartHome-PT-01-08
FORMULA_NAME SmartHome-PT-01-09
FORMULA_NAME SmartHome-PT-01-10
FORMULA_NAME SmartHome-PT-01-11
FORMULA_NAME SmartHome-PT-01-12
FORMULA_NAME SmartHome-PT-01-13
FORMULA_NAME SmartHome-PT-01-14
FORMULA_NAME SmartHome-PT-01-15

=== Now, execution of the tool begins

BK_START 1621197382107

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:36:23] [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-16 20:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:36:23] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-16 20:36:23] [INFO ] Transformed 38 places.
[2021-05-16 20:36:23] [INFO ] Transformed 113 transitions.
[2021-05-16 20:36:23] [INFO ] Found NUPN structural information;
[2021-05-16 20:36:23] [INFO ] Parsed PT model containing 38 places and 113 transitions in 80 ms.
Ensure Unique test removed 58 transitions
Reduce redundant transitions removed 58 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 0 resets, run finished after 308 ms. (steps per millisecond=324 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
[2021-05-16 20:36:24] [INFO ] Flow matrix only has 34 transitions (discarded 21 similar events)
// Phase 1: matrix 34 rows 38 cols
[2021-05-16 20:36:24] [INFO ] Computed 15 place invariants in 4 ms
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using state equation in 18 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-16 20:36:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-16 20:36:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2021-05-16 20:36:24] [INFO ] Computed and/alt/rep : 54/133/33 causal constraints in 5 ms.
[2021-05-16 20:36:24] [INFO ] Added : 29 causal constraints over 7 iterations in 50 ms. Result :sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned unsat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using 14 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 20:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:36:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 20:36:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:36:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
[2021-05-16 20:36:24] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2021-05-16 20:36:24] [INFO ] Flatten gal took : 26 ms
FORMULA SmartHome-PT-01-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-01-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:36:24] [INFO ] Applying decomposition
[2021-05-16 20:36:24] [INFO ] Flatten gal took : 6 ms
[2021-05-16 20:36:24] [INFO ] Decomposing Gal with order
[2021-05-16 20:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:36:25] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-16 20:36:25] [INFO ] Flatten gal took : 28 ms
[2021-05-16 20:36:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2021-05-16 20:36:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-16 20:36:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-01 @ 3570 seconds

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

FORMULA SmartHome-PT-01-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-01-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ SmartHome-PT-01

{
"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": "Sun May 16 20:36:26 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 13,
"adisj": 5,
"aneg": 5,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((G ((((p29 <= 0)) AND ((1 <= p33)) AND ((p32 <= 0)))) AND (F ((G ((((1 <= p33)) AND ((p32 <= 0)))) OR (((p29 <= 0) OR (((1 <= p24)) AND ((p1 <= 0)))) AND (((1 <= p33)) AND ((p32 <= 0)))))) OR G ((((p29 <= 0)) AND ((1 <= p33)) AND ((p32 <= 0))))))))",
"processed_size": 255,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 1783
},
"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 <= p20)) AND ((p22 <= 0)))))",
"processed_size": 39,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 10,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F (G ((((1 <= p27)) AND ((p37 <= 0))))) AND (((p27 <= 0)) OR ((1 <= p37))))))",
"processed_size": 85,
"rewrites": 32
},
"result":
{
"edges": 6,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 22436,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((G(*) AND (F((G(*) OR (* AND *))) OR G(*))))) : X(G(*)) : F(G((F(G(**)) AND **)))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 14,
"places": 38,
"places_significant": 23,
"singleton_clusters": 0,
"transitions": 55
},
"result":
{
"preliminary_value": "no no no ",
"value": "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: 93/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 38
lola: finding significant places
lola: 38 places, 55 transitions, 23 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: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: F (X (NOT(G ((G ((((1 <= p29) AND (((p24 <= 0)) OR ((1 <= p1)))) U (((p33 <= 0)) OR ((1 <= p32))))) U F ((((1 <= p29)) OR ((p33 <= 0)) OR ((1 <= p32))))))))) : NOT(F ((X (F (((X (((p36 <= 0))) U X ((((p20 <= 0)) OR ((1 <= p22))))) U (((p24 <= 0)) OR ((1 <= p9)))))) U X ((((p20 <= 0)) OR ((1 <= p22))))))) : G (F (G ((X (X (G (F (G ((((1 <= p27)) AND ((p37 <= 0)))))))) AND (((p27 <= 0)) OR ((1 <= p37)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((p29 <= 0)) AND ((1 <= p33)) AND ((p32 <= 0)))) AND (F ((G ((((1 <= p33)) AND ((p32 <= 0)))) OR (((p29 <= 0) OR (((1 <= p24)) AND ((p1 <= 0)))) AND (((1 <= p33)) AND ((p32 <= 0)))))) OR G ((((p29 <= 0)) AND ((1 <= p33)) AND ((p32 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((((p29 <= 0)) AND ((1 <= p33)) AND ((p32 <= 0)))) AND (F ((G ((((1 <= p33)) AND ((p32 <= 0)))) OR (((p29 <= 0) OR (((1 <= p24)) AND ((p1 <= 0)))) AND (((1 <= p33)) AND ((p32 <= 0)))))) OR G ((((p29 <= 0)) AND ((1 <= p33)) AND ((p32 <= 0))))))))
lola: processed formula length: 255
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p20)) AND ((p22 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p20)) AND ((p22 <= 0)))))
lola: processed formula length: 39
lola: 32 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G ((((1 <= p27)) AND ((p37 <= 0))))) AND (((p27 <= 0)) OR ((1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G ((((1 <= p27)) AND ((p37 <= 0))))) AND (((p27 <= 0)) OR ((1 <= p37))))))
lola: processed formula length: 85
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no
lola:
preliminary result: no no no
lola: memory consumption: 22436 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="SmartHome-PT-01"
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 SmartHome-PT-01, 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 r265-tall-162106800300077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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