fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r228-oct2-159033547100090
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for SmartHome-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.220 3600000.00 441543.00 350.90 FTTT???TF??F???? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r228-oct2-159033547100090.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is SmartHome-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547100090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.2K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 90K May 12 20:42 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-12-00
FORMULA_NAME SmartHome-PT-12-01
FORMULA_NAME SmartHome-PT-12-02
FORMULA_NAME SmartHome-PT-12-03
FORMULA_NAME SmartHome-PT-12-04
FORMULA_NAME SmartHome-PT-12-05
FORMULA_NAME SmartHome-PT-12-06
FORMULA_NAME SmartHome-PT-12-07
FORMULA_NAME SmartHome-PT-12-08
FORMULA_NAME SmartHome-PT-12-09
FORMULA_NAME SmartHome-PT-12-10
FORMULA_NAME SmartHome-PT-12-11
FORMULA_NAME SmartHome-PT-12-12
FORMULA_NAME SmartHome-PT-12-13
FORMULA_NAME SmartHome-PT-12-14
FORMULA_NAME SmartHome-PT-12-15

=== Now, execution of the tool begins

BK_START 1591290700631

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:11:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 17:11:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:11:42] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2020-06-04 17:11:42] [INFO ] Transformed 376 places.
[2020-06-04 17:11:42] [INFO ] Transformed 399 transitions.
[2020-06-04 17:11:42] [INFO ] Found NUPN structural information;
[2020-06-04 17:11:42] [INFO ] Parsed PT model containing 376 places and 399 transitions in 105 ms.
Deduced a syphon composed of 104 places in 4 ms
Reduce places removed 104 places and 80 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 482 resets, run finished after 156 ms. (steps per millisecond=641 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 319 rows 272 cols
[2020-06-04 17:11:43] [INFO ] Computed 13 place invariants in 7 ms
[2020-06-04 17:11:43] [INFO ] [Real]Absence check using 13 positive place invariants in 49 ms returned sat
[2020-06-04 17:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:11:43] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2020-06-04 17:11:43] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 100 ms.
[2020-06-04 17:11:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:11:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 68 ms returned sat
[2020-06-04 17:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:11:44] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-04 17:11:44] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 36 ms.
[2020-06-04 17:11:45] [INFO ] Added : 288 causal constraints over 58 iterations in 1451 ms. Result :sat
[2020-06-04 17:11:45] [INFO ] Deduced a trap composed of 54 places in 114 ms
[2020-06-04 17:11:45] [INFO ] Deduced a trap composed of 50 places in 28 ms
[2020-06-04 17:11:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2020-06-04 17:11:46] [INFO ] [Real]Absence check using 13 positive place invariants in 101 ms returned sat
[2020-06-04 17:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:11:46] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-06-04 17:11:46] [INFO ] Deduced a trap composed of 32 places in 16 ms
[2020-06-04 17:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-06-04 17:11:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:11:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 77 ms returned sat
[2020-06-04 17:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:11:46] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2020-06-04 17:11:46] [INFO ] Deduced a trap composed of 32 places in 84 ms
[2020-06-04 17:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-06-04 17:11:46] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 16 ms.
[2020-06-04 17:11:48] [INFO ] Added : 309 causal constraints over 62 iterations in 1596 ms. Result :sat
[2020-06-04 17:11:48] [INFO ] Deduced a trap composed of 45 places in 38 ms
[2020-06-04 17:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2020-06-04 17:11:48] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 17:11:48] [INFO ] Flatten gal took : 82 ms
FORMULA SmartHome-PT-12-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:11:48] [INFO ] Applying decomposition
[2020-06-04 17:11:48] [INFO ] Flatten gal took : 22 ms
[2020-06-04 17:11:48] [INFO ] Decomposing Gal with order
[2020-06-04 17:11:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 17:11:48] [INFO ] Removed a total of 17 redundant transitions.
[2020-06-04 17:11:49] [INFO ] Flatten gal took : 70 ms
[2020-06-04 17:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 8 ms.
[2020-06-04 17:11:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2020-06-04 17:11:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SmartHome-PT-12 @ 3570 seconds

FORMULA SmartHome-PT-12-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLFireability @ SmartHome-PT-12

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:11:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 5,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 3,
"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 (X (X (X ((X (G (((1 <= p169)))) U ((p210 <= 0) OR (p243 <= 0)))))))",
"processed_size": 71,
"rewrites": 60
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 4705856,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(X((X(G(**)) U *))))) : (X((* AND (F(G(*)) OR G(*)))) OR G((F(**) AND (** OR **)))) : X(F((* OR G(*)))) : X((F(G(**)) AND G(**))) : G((G(F(*)) AND **)) : F(**) : F(G(*)) : G(F(*)) : ((X(G(*)) U (X(**) AND **)) OR (X(G(**)) AND **)) : ((F(**) U **) AND (F(**) U (X(X(**)) AND **)))"
},
"net":
{
"arcs": 715,
"conflict_clusters": 252,
"places": 272,
"places_significant": 259,
"singleton_clusters": 0,
"transitions": 319
},
"result":
{
"interim_value": "yes unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "yes unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 591/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8704
lola: finding significant places
lola: 272 places, 319 transitions, 259 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p169 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: X (X ((G (X (X (X (((1 <= p169)))))) U X (NOT(X (((1 <= p210) AND (1 <= p243)))))))) : (X (NOT((G (F (((1 <= p8)))) U ((1 <= p163))))) OR G ((((1 <= p240)) U ((1 <= p77))))) : F (X ((NOT(G (((((1 <= p238)) U (1 <= 0)) OR ((1 <= p95))))) OR NOT(G (F (((1 <= p152)))))))) : X ((F (G (((1 <= p191)))) AND G (((1 <= p19))))) : G ((X (G (X (F (NOT(X (X (X (((1 <= p2) AND (1 <= p120)))))))))) AND ((p2 <= 0) OR (p120 <= 0)))) : (((p122 <= 0)) U F (((1 <= p65)))) : X (F (G (F (NOT(X (F (((1 <= p59))))))))) : G (NOT(G (((1 <= p120))))) : ((G (NOT(X (((1 <= p221))))) U (X (((1 <= p20))) AND ((1 <= p20)))) OR (G (X (((1 <= p221)))) AND ((1 <= p20)))) : ((F (((1 <= p40))) U ((1 <= p32))) AND (F (((1 <= p24))) U (X (X (((1 <= p159)))) AND ((1 <= p40)))))
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X ((X (G (((1 <= p169)))) U ((p210 <= 0) OR (p243 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X ((X (G (((1 <= p169)))) U ((p210 <= 0) OR (p243 <= 0)))))))
lola: processed formula length: 71
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p163 <= 0)) AND (F (G (((p8 <= 0)))) OR G (((p163 <= 0)))))) OR G ((F (((1 <= p77))) AND (((1 <= p240)) OR ((1 <= p77))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p77))) AND (((1 <= p240)) OR ((1 <= p77)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p77))) AND (((1 <= p240)) OR ((1 <= p77)))))
lola: processed formula length: 58
lola: 60 rewrites
lola: closed formula file LTLFireability.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: 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p163 <= 0)) AND (F (G (((p8 <= 0)))) OR G (((p163 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p163 <= 0)) AND (F (G (((p8 <= 0)))) OR G (((p163 <= 0))))))
lola: processed formula length: 66
lola: 60 rewrites
lola: closed formula file LTLFireability.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: 702813 markings, 2786036 edges, 140563 markings/sec, 0 secs
lola: 1146239 markings, 5481677 edges, 88685 markings/sec, 5 secs
lola: 1656360 markings, 7800855 edges, 102024 markings/sec, 10 secs
lola: 2053115 markings, 10166906 edges, 79351 markings/sec, 15 secs
lola: 2502520 markings, 12427354 edges, 89881 markings/sec, 20 secs
lola: 2909459 markings, 14869248 edges, 81388 markings/sec, 25 secs
lola: 3144828 markings, 17180121 edges, 47074 markings/sec, 30 secs
lola: 3673196 markings, 19625131 edges, 105674 markings/sec, 35 secs
lola: 3991220 markings, 22054597 edges, 63605 markings/sec, 40 secs
lola: 4401484 markings, 24273294 edges, 82053 markings/sec, 45 secs
lola: 4784570 markings, 26609076 edges, 76617 markings/sec, 50 secs
lola: 5021170 markings, 28807358 edges, 47320 markings/sec, 55 secs
lola: 5458633 markings, 31028892 edges, 87493 markings/sec, 60 secs
lola: 5774495 markings, 33453302 edges, 63172 markings/sec, 65 secs
lola: 5978927 markings, 35789620 edges, 40886 markings/sec, 70 secs
lola: 6468342 markings, 38109146 edges, 97883 markings/sec, 75 secs
lola: 6801923 markings, 40540932 edges, 66716 markings/sec, 80 secs
lola: 7227281 markings, 42897430 edges, 85072 markings/sec, 85 secs
lola: 7629795 markings, 45294575 edges, 80503 markings/sec, 90 secs
lola: 7879084 markings, 47620818 edges, 49858 markings/sec, 95 secs
lola: 8389969 markings, 49750652 edges, 102177 markings/sec, 100 secs
lola: 8746018 markings, 51957741 edges, 71210 markings/sec, 105 secs
lola: 9201996 markings, 54089202 edges, 91196 markings/sec, 110 secs
lola: 9620065 markings, 56213090 edges, 83614 markings/sec, 115 secs
lola: 9911526 markings, 58313761 edges, 58292 markings/sec, 120 secs
lola: 10440610 markings, 60582756 edges, 105817 markings/sec, 125 secs
lola: 10779374 markings, 62933869 edges, 67753 markings/sec, 130 secs
lola: 11219999 markings, 65321258 edges, 88125 markings/sec, 135 secs
lola: 11675758 markings, 67568440 edges, 91152 markings/sec, 140 secs
lola: 11984243 markings, 69592479 edges, 61697 markings/sec, 145 secs
lola: 12310805 markings, 71602454 edges, 65312 markings/sec, 150 secs
lola: 12585905 markings, 73628328 edges, 55020 markings/sec, 155 secs
lola: 12923465 markings, 75726692 edges, 67512 markings/sec, 160 secs
lola: 13242296 markings, 77737484 edges, 63766 markings/sec, 165 secs
lola: 13544499 markings, 79470309 edges, 60441 markings/sec, 170 secs
lola: 14056042 markings, 81779054 edges, 102309 markings/sec, 175 secs
lola: 14567840 markings, 84577103 edges, 102360 markings/sec, 180 secs
lola: 15049918 markings, 87179844 edges, 96416 markings/sec, 185 secs
lola: 15574511 markings, 89724663 edges, 104919 markings/sec, 190 secs
lola: 16032014 markings, 92239227 edges, 91501 markings/sec, 195 secs
lola: 16404351 markings, 94592079 edges, 74467 markings/sec, 200 secs
lola: 16727737 markings, 96843107 edges, 64677 markings/sec, 205 secs
lola: 17138584 markings, 98924455 edges, 82169 markings/sec, 210 secs
lola: 17494965 markings, 100903788 edges, 71276 markings/sec, 215 secs
lola: 17808889 markings, 103015304 edges, 62785 markings/sec, 220 secs
lola: 18202867 markings, 105092085 edges, 78796 markings/sec, 225 secs
lola: 18602933 markings, 107259839 edges, 80013 markings/sec, 230 secs
lola: 18956632 markings, 109400533 edges, 70740 markings/sec, 235 secs
lola: 19406636 markings, 111793610 edges, 90001 markings/sec, 240 secs
lola: 19762021 markings, 114120768 edges, 71077 markings/sec, 245 secs
lola: 20164736 markings, 116650250 edges, 80543 markings/sec, 250 secs
lola: 20597921 markings, 119111715 edges, 86637 markings/sec, 255 secs
lola: 20970203 markings, 121519904 edges, 74456 markings/sec, 260 secs
lola: 21319221 markings, 123844958 edges, 69804 markings/sec, 265 secs
lola: 21685060 markings, 126106809 edges, 73168 markings/sec, 270 secs
lola: 21920061 markings, 128391177 edges, 47000 markings/sec, 275 secs
lola: 22314503 markings, 130616527 edges, 78888 markings/sec, 280 secs
lola: 22550006 markings, 132784507 edges, 47101 markings/sec, 285 secs
lola: 22930995 markings, 134823205 edges, 76198 markings/sec, 290 secs
lola: 23237368 markings, 136841105 edges, 61275 markings/sec, 295 secs
lola: 23513656 markings, 138994940 edges, 55258 markings/sec, 300 secs
lola: 23843356 markings, 141086830 edges, 65940 markings/sec, 305 secs
lola: 24124528 markings, 143217577 edges, 56234 markings/sec, 310 secs
lola: 24514219 markings, 145313257 edges, 77938 markings/sec, 315 secs
lola: 24775002 markings, 147388234 edges, 52157 markings/sec, 320 secs
lola: 25158375 markings, 149792838 edges, 76675 markings/sec, 325 secs
lola: 25529875 markings, 152241920 edges, 74300 markings/sec, 330 secs
lola: 25902249 markings, 154898608 edges, 74475 markings/sec, 335 secs
lola: 26325909 markings, 157499301 edges, 84732 markings/sec, 340 secs
lola: 26818692 markings, 160008440 edges, 98557 markings/sec, 345 secs
lola: 27277459 markings, 162419016 edges, 91753 markings/sec, 350 secs
lola: 27735276 markings, 164843456 edges, 91563 markings/sec, 355 secs
lola: 28165786 markings, 167522810 edges, 86102 markings/sec, 360 secs
lola: 28528694 markings, 169853216 edges, 72582 markings/sec, 365 secs
lola: 28974179 markings, 172381548 edges, 89097 markings/sec, 370 secs
lola: 29323696 markings, 174752392 edges, 69903 markings/sec, 375 secs
lola: 29829826 markings, 177290007 edges, 101226 markings/sec, 380 secs
lola: 30234820 markings, 178971558 edges, 80999 markings/sec, 385 secs
lola: 30531512 markings, 180774957 edges, 59338 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4705568 KB
lola: time consumption: 399 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4705856 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427460 kB
MemFree: 11430324 kB
After kill :
MemTotal: 16427460 kB
MemFree: 11430348 kB

--------------------
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-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is SmartHome-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r228-oct2-159033547100090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-12.tgz
mv SmartHome-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;