fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987899800180
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DES-PT-00a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15756.630 3600000.00 298049.00 1457.70 ???F?????F?????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899800180.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DES-PT-00a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899800180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.1K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 31K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-00a-CTLFireability-00
FORMULA_NAME DES-PT-00a-CTLFireability-01
FORMULA_NAME DES-PT-00a-CTLFireability-02
FORMULA_NAME DES-PT-00a-CTLFireability-03
FORMULA_NAME DES-PT-00a-CTLFireability-04
FORMULA_NAME DES-PT-00a-CTLFireability-05
FORMULA_NAME DES-PT-00a-CTLFireability-06
FORMULA_NAME DES-PT-00a-CTLFireability-07
FORMULA_NAME DES-PT-00a-CTLFireability-08
FORMULA_NAME DES-PT-00a-CTLFireability-09
FORMULA_NAME DES-PT-00a-CTLFireability-10
FORMULA_NAME DES-PT-00a-CTLFireability-11
FORMULA_NAME DES-PT-00a-CTLFireability-12
FORMULA_NAME DES-PT-00a-CTLFireability-13
FORMULA_NAME DES-PT-00a-CTLFireability-14
FORMULA_NAME DES-PT-00a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591165744890

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:29:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:29:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:29:08] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2020-06-03 06:29:08] [INFO ] Transformed 115 places.
[2020-06-03 06:29:08] [INFO ] Transformed 76 transitions.
[2020-06-03 06:29:08] [INFO ] Found NUPN structural information;
[2020-06-03 06:29:08] [INFO ] Parsed PT model containing 115 places and 76 transitions in 170 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Incomplete random walk after 100000 steps, including 2214 resets, run finished after 475 ms. (steps per millisecond=210 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 62 rows 115 cols
[2020-06-03 06:29:09] [INFO ] Computed 57 place invariants in 19 ms
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using 35 positive place invariants in 55 ms returned sat
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 25 ms returned sat
[2020-06-03 06:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using 35 positive place invariants in 27 ms returned sat
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 15 ms returned sat
[2020-06-03 06:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:29:09] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2020-06-03 06:29:10] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 06:29:10] [INFO ] [Real]Absence check using 35 positive and 22 generalized place invariants in 12 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 06:29:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:29:10] [INFO ] Flatten gal took : 86 ms
[2020-06-03 06:29:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:29:10] [INFO ] Flatten gal took : 29 ms
FORMULA DES-PT-00a-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:29:10] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-03 06:29:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DES-PT-00a @ 3570 seconds

FORMULA DES-PT-00a-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ DES-PT-00a

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:29:10 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": "EG(AX((((1 <= p110)) OR ((1 <= p102) AND (1 <= p104)))))",
"processed_size": 57,
"rewrites": 31
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 49592,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F((** AND ((E(G(**)) OR **) AND (** AND **))))) : E(F(**)) : (A(F(**)) OR **) : (E(F(**)) AND (A(F(**)) OR (** OR **))) : E(F(**)) : (A(F(E(G(**)))) OR (E((** U **)) AND (A(F(**)) AND NODEADLOCK))) : (E(F((** AND E(F(**))))) OR (A(G(**)) AND (** AND (** AND (** OR E(F(**))))))) : E(G(A(X(**)))) : E(F(**)) : (A(G(E(F(*)))) AND A(F((E(X(**)) OR E(F(**)))))) : A(X(A(G(*)))) : E(F(**)) : E(G(A(F(**)))) : E(X((E(F(*)) AND A(G(*)))))"
},
"net":
{
"arcs": 309,
"conflict_clusters": 46,
"places": 115,
"places_significant": 58,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"interim_value": "unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown unknown unknown unknown unknown unknown unknown no 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: 177/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 115
lola: finding significant places
lola: 115 places, 62 transitions, 58 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: E (F (((1 <= p14) AND (1 <= p88)))) : E (F ((((((1 <= p99) AND (1 <= p109) AND (1 <= p37) AND (1 <= p39) AND (1 <= p96)) AND (E (G (((1 <= p19) AND (1 <= p21)))) OR ((1 <= p111)))) AND ((p111 <= 0) OR (p46 <= 0) OR (p63 <= 0))) AND (((1 <= p4)) OR ((1 <= p22) AND (1 <= p27) AND (1 <= p29)))))) : E (F (E ((((p56 <= 0) OR (p72 <= 0)) U ((1 <= p17) AND (1 <= p18)))))) : (A (F (((1 <= p17) AND (1 <= p18)))) OR ((1 <= p9) AND (1 <= p94))) : (E (F (((p96 <= 0) OR ((1 <= p36) AND (1 <= p41) AND (1 <= p43) AND (1 <= p45) AND (1 <= p47) AND (1 <= p49) AND (1 <= p51) AND (1 <= p53) AND (1 <= p55)) OR (p111 <= 0) OR (p58 <= 0) OR (p74 <= 0)))) AND ((A (F (((1 <= p46) AND (1 <= p63) AND (1 <= p37) AND (1 <= p39) AND (1 <= p96)))) OR ((1 <= p6))) OR ((1 <= p33) AND (1 <= p35)))) : E (F (((1 <= p64) AND (1 <= p80)))) : (A (F (E (G (((p68 <= 0) OR (p84 <= 0)))))) OR ((E ((((1 <= p89) AND (1 <= p91)) U ((1 <= p33) AND (1 <= p35)))) AND A (F (((1 <= p50) AND (1 <= p67))))) AND NOT(A (X ((1 <= 0)))))) : (E (F ((((((1 <= p4) AND (1 <= p24)) OR ((1 <= p40) AND (1 <= p57))) AND ((p4 <= 0) OR (p24 <= 0))) AND E (F (((1 <= p2))))))) OR (((A (G (((p13 <= 0) OR ((1 <= p13) AND (1 <= p20)) OR (p23 <= 0) OR (p25 <= 0)))) AND ((1 <= p50))) AND ((1 <= p67))) AND (((p16 <= 0) OR (p26 <= 0)) OR E (F (((1 <= p6))))))) : E (G (A (X ((((1 <= p110)) OR ((1 <= p102) AND (1 <= p104))))))) : E (F (((1 <= p60) AND (1 <= p76)))) : (NOT(E (F (A (G (((1 <= p22) AND (1 <= p27) AND (1 <= p29))))))) AND A (F ((E (X (((1 <= p38) AND (1 <= p108)))) OR E (F (((1 <= p2) AND (1 <= p15)))))))) : A (X (NOT(E (F ((((1 <= p32) AND (1 <= p95)) OR ((1 <= p92) AND (1 <= p97)))))))) : E (F (((1 <= p56) AND (1 <= p72)))) : E (G (A (F (((p58 <= 0) OR (p74 <= 0)))))) : NOT(A (X ((A (G (((1 <= p42) AND (1 <= p59)))) OR E (F (((1 <= p46) AND (1 <= p63))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((((1 <= p110)) OR ((1 <= p102) AND (1 <= p104)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX((((1 <= p110)) OR ((1 <= p102) AND (1 <= p104)))))
lola: processed formula length: 57
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (((p22 <= 0) OR (p27 <= 0) OR (p29 <= 0)))))) AND A (F ((E (X (((1 <= p38) AND (1 <= p108)))) OR E (F (((1 <= p2) AND (1 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p22 <= 0) OR (p27 <= 0) OR (p29 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p22 <= 0) OR (p27 <= 0) OR (p29 <= 0))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p22) AND (1 <= p27) AND (1 <= p29))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p22 <= 0) OR (p27 <= 0) OR (p29 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-1.sara
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-1.sara.
sara: try reading problem file CTLFireability-0.sara.
sara: error: :595: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
sara: error: :595: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 465903 markings, 3357297 edges, 93181 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 901124 markings, 6660745 edges, 87044 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1304935 markings, 10077643 edges, 80762 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1677311 markings, 13525580 edges, 74475 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2076071 markings, 16835577 edges, 79752 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2476165 markings, 20144670 edges, 80019 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2869629 markings, 23455837 edges, 78693 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 3246578 markings, 26735883 edges, 75390 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 3594645 markings, 30049976 edges, 69613 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 3922136 markings, 33318119 edges, 65498 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 4249151 markings, 36523585 edges, 65403 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 4590997 markings, 39671061 edges, 68369 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 4999171 markings, 42984441 edges, 81635 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 5413596 markings, 46224081 edges, 82885 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 5790401 markings, 49502887 edges, 75361 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 6171273 markings, 52765765 edges, 76174 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 6503929 markings, 55940056 edges, 66531 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 6876384 markings, 59154865 edges, 74491 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 7274684 markings, 62502534 edges, 79660 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 7650800 markings, 65779569 edges, 75223 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 8009377 markings, 68978663 edges, 71715 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 8329632 markings, 72153639 edges, 64051 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 8663348 markings, 75374736 edges, 66743 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 8963010 markings, 78545344 edges, 59932 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 9283818 markings, 81670711 edges, 64162 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 9632276 markings, 84947012 edges, 69692 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 10087081 markings, 88248253 edges, 90961 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 10508352 markings, 91507414 edges, 84254 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 10926861 markings, 94667865 edges, 83702 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 11301944 markings, 97830541 edges, 75017 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 11677373 markings, 100990119 edges, 75086 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 12016006 markings, 104117333 edges, 67727 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 12387083 markings, 107297429 edges, 74215 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 12769568 markings, 110456590 edges, 76497 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 13215711 markings, 113607045 edges, 89229 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 13617966 markings, 116743578 edges, 80451 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 14025785 markings, 119815063 edges, 81564 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 14389488 markings, 122873883 edges, 72741 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 14753562 markings, 125920017 edges, 72815 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 15078928 markings, 128943108 edges, 65073 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 15426113 markings, 132008613 edges, 69437 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 15812014 markings, 135059080 edges, 77180 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 16225763 markings, 138174664 edges, 82750 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 16605278 markings, 141347779 edges, 75903 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 16954827 markings, 144485755 edges, 69910 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 17306861 markings, 147558065 edges, 70407 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 17582014 markings, 150544493 edges, 55031 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 17934394 markings, 153665108 edges, 70476 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 18300837 markings, 156775121 edges, 73289 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 18666948 markings, 159911013 edges, 73222 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown
lola: memory consumption: 766668 KB
lola: memory consumption: 766668 KB
lola: time consumption: 260 seconds
lola: print data as JSON (--json)
lola: time consumption: 260 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: memory consumption: 766668 KB
lola: time consumption: 260 seconds
lola: print data as JSON (--json)
lola: lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)writing JSON to CTLFireability.json

lola: closed JSON file CTLFireability.json
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (((1 <= p38) AND (1 <= p108)))) OR E (F (((1 <= p2) AND (1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown
lola: memory consumption: 49592 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16099412 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16099608 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="DES-PT-00a"
export BK_EXAMINATION="CTLFireability"
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 DES-PT-00a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899800180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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