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.r178-tajo-158987882000204.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 DNAwalker-PT-16redondantChoiceR, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882000204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 3.9K Mar 31 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 29 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 29 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-CTLFireability-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591208264483

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:17:46] [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 18:17:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:17:46] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-06-03 18:17:46] [INFO ] Transformed 43 places.
[2020-06-03 18:17:46] [INFO ] Transformed 490 transitions.
[2020-06-03 18:17:46] [INFO ] Parsed PT model containing 43 places and 490 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 3815 resets, run finished after 425 ms. (steps per millisecond=235 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2020-06-03 18:17:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2020-06-03 18:17:46] [INFO ] Computed 0 place invariants in 8 ms
[2020-06-03 18:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:46] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 18:17:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:17:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:49] [INFO ] [Nat]Absence check using state equation in 2810 ms returned unsat
[2020-06-03 18:17:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:49] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2020-06-03 18:17:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:51] [INFO ] [Nat]Absence check using state equation in 1636 ms returned unsat
[2020-06-03 18:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:51] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 18:17:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:52] [INFO ] [Nat]Absence check using state equation in 681 ms returned unsat
[2020-06-03 18:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:52] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2020-06-03 18:17:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:53] [INFO ] [Nat]Absence check using state equation in 382 ms returned unsat
[2020-06-03 18:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:53] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-06-03 18:17:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 18:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 18:17:54] [INFO ] [Nat]Absence check using state equation in 859 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 18:17:54] [INFO ] Flatten gal took : 82 ms
[2020-06-03 18:17:54] [INFO ] Flatten gal took : 29 ms
[2020-06-03 18:17:54] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2020-06-03 18:17:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DNAwalker-PT-16redondantChoiceR @ 3570 seconds

FORMULA DNAwalker-PT-16redondantChoiceR-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ DNAwalker-PT-16redondantChoiceR

{
"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",
"--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 18:17:54 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 153
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p26 <= 0) OR (p37 <= 1))",
"processed_size": 27,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 164
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "AX(((p22 <= 0) OR (p39 <= 1)))",
"processed_size": 31,
"rewrites": 55
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 175
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "AX(((p9 <= 1) OR (p37 <= 0)))",
"processed_size": 30,
"rewrites": 55
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "EG(EX(((p2 <= 1) OR (p10 <= 0))))",
"processed_size": 34,
"rewrites": 56
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 1251660,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((DEADLOCK OR (A(G(**)) OR **)))) : (E(G(E(X(*)))) AND (A(X(*)) AND (A(X(*)) AND **))) : (A(G(**)) OR (** OR (A(F(**)) AND **))) : E(G(A(F(**)))) : E(((A(F(**)) OR **) U **)) : (A(G(*)) OR (** AND (A(F(**)) OR **))) : (E(F((** AND E(G(**))))) AND A(G(E(X(*))))) : (A(F(**)) OR (E(X(A(F(**)))) OR **)) : A((** U E(G(*)))) : A((A(F(**)) U **)) : E(F(A(G(**)))) : (E(G(*)) AND (** AND (E(F(**)) OR (** OR (** OR (** OR **)))))) : A(F((E(X(**)) AND A(F(**))))) : (E(F(**)) AND (E((* R *)) AND (E(F(*)) OR (** OR **)))) : A(F(E((** U **)))) : A(F(*))"
},
"net":
{
"arcs": 1438,
"conflict_clusters": 11,
"places": 43,
"places_significant": 43,
"singleton_clusters": 0,
"transitions": 490
},
"result":
{
"interim_value": "unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown yes unknown unknown unknown unknown unknown 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: 533/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1376
lola: finding significant places
lola: 43 places, 490 transitions, 43 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: atomic prop true by contained trap!
lola: A (F (((A (X ((1 <= 0))) OR A (G (((1 <= p33) AND (2 <= p35))))) OR ((2 <= p24) AND (1 <= p31))))) : (((NOT(A (F (A (X (((2 <= p2) AND (1 <= p10))))))) AND NOT(E (X (((2 <= p9) AND (1 <= p37)))))) AND NOT(E (X (((1 <= p22) AND (2 <= p39)))))) AND ((p26 <= 0) OR (p37 <= 1))) : ((A (G (((1 <= p27) AND (2 <= p33)))) OR ((1 <= p14) AND (2 <= p28))) OR (A (F (A (F (((1 <= p32) AND (2 <= p35)))))) AND ((p24 <= 1) OR (p37 <= 0) OR (1 <= p5) OR ((2 <= p12) AND (1 <= p23) AND (1 <= p4) AND (2 <= p29)) OR ((2 <= p24) AND (1 <= p37) AND (1 <= p18) AND (2 <= p35))))) : E (G (A (F (((p23 <= 1) OR (p37 <= 0) OR ((1 <= p26) AND (2 <= p30))))))) : E (((A (F (((2 <= p26) AND (1 <= p33)))) OR ((2 <= p16) AND (1 <= p22))) U ((2 <= p11) AND (1 <= p23)))) : (NOT(E (F (((p15 <= 0) AND (1 <= p18) AND (2 <= p30))))) OR ((((p3 <= 0) OR (p12 <= 1)) AND ((p14 <= 0) OR (p29 <= 1)) AND ((p12 <= 1) OR (p35 <= 0) OR ((2 <= p16) AND (1 <= p37)))) AND (A (F (((2 <= p25) AND (1 <= p32)))) OR ((2 <= p25))))) : (E (F (((((p14 <= 1) OR (p18 <= 0)) AND ((p22 <= 0) OR (p28 <= 1))) AND E (G (((2 <= p3) AND (1 <= p29))))))) AND A (G (NOT(A (X (((2 <= p11) AND (1 <= p31)))))))) : ((A (F (((2 <= p4) AND (1 <= p12)))) OR E (X (A (F (((2 <= p4) AND (1 <= p6))))))) OR ((2 <= p12) AND (1 <= p32))) : A ((((1 <= p28) AND (2 <= p35)) U NOT(A (F (((1 <= p20) AND (2 <= p31))))))) : A ((A (F (((2 <= p16) AND (1 <= p39)))) U ((2 <= p16) AND (1 <= p31)))) : E (F (A (G (A (G (((1 <= p25) AND (2 <= p31)))))))) : ((NOT(A (F ((p17 <= 0)))) AND ((p33 <= 1) OR (p35 <= 0) OR ((1 <= p29) AND (2 <= p32) AND (2 <= p3) AND (1 <= p28)))) AND ((((E (F (((2 <= p14) AND (1 <= p29)))) OR (p32 <= 0)) OR (p39 <= 1)) OR (p24 <= 1)) OR (p33 <= 0))) : A (F ((E (X ((((2 <= p20) AND (1 <= p37)) OR ((2 <= p28) AND (1 <= p37))))) AND A (F ((p34 <= 0)))))) : ((E (F (E (F (((1 <= p16) AND (2 <= p31)))))) AND NOT(A ((((2 <= p16) AND (1 <= p20)) U ((1 <= p22) AND (2 <= p39)))))) AND ((NOT(A (G (((1 <= p27) AND (2 <= p35))))) OR (p30 <= 0)) OR (p35 <= 1))) : A (F (E ((((1 <= p2) AND (2 <= p12)) U ((2 <= p28) AND (1 <= p30)))))) : NOT(E (G (E (G (((p16 <= 1) OR (p18 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:392
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X (((p2 <= 1) OR (p10 <= 0)))))) AND (A (X (((p9 <= 1) OR (p37 <= 0)))) AND (A (X (((p22 <= 0) OR (p39 <= 1)))) AND ((p26 <= 0) OR (p37 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p26 <= 0) OR (p37 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p26 <= 0) OR (p37 <= 1))
lola: processed formula length: 27
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p22 <= 0) OR (p39 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p22 <= 0) OR (p39 <= 1)))
lola: processed formula length: 31
lola: 55 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p9 <= 1) OR (p37 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p9 <= 1) OR (p37 <= 0)))
lola: processed formula length: 30
lola: 55 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p2 <= 1) OR (p10 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((p2 <= 1) OR (p10 <= 0))))
lola: processed formula length: 34
lola: 56 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((p14 <= 1) OR (p18 <= 0)) AND ((p22 <= 0) OR (p28 <= 1))) AND E (G (((2 <= p3) AND (1 <= p29))))))) AND A (G (E (X (((p11 <= 1) OR (p31 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((p14 <= 1) OR (p18 <= 0)) AND ((p22 <= 0) OR (p28 <= 1))) AND E (G (((2 <= p3) AND (1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((2 <= p14) AND (1 <= p18)) OR ((1 <= p22) AND (2 <= p28))) OR F (((p3 <= 1) OR (p29 <= 0)))))
lola: processed formula length: 101
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 311426 markings, 1157077 edges, 62285 markings/sec, 0 secs
lola: 659100 markings, 2433745 edges, 69535 markings/sec, 5 secs
lola: 895838 markings, 3423872 edges, 47348 markings/sec, 10 secs
lola: 1138745 markings, 4452707 edges, 48581 markings/sec, 15 secs
lola: 1505370 markings, 5956319 edges, 73325 markings/sec, 20 secs
lola: 1945043 markings, 7676669 edges, 87935 markings/sec, 25 secs
lola: 2319188 markings, 9155375 edges, 74829 markings/sec, 30 secs
lola: 2511191 markings, 9947248 edges, 38401 markings/sec, 35 secs
lola: 2711527 markings, 10930516 edges, 40067 markings/sec, 40 secs
lola: 3058546 markings, 12339522 edges, 69404 markings/sec, 45 secs
lola: 3250156 markings, 13292361 edges, 38322 markings/sec, 50 secs
lola: 3447369 markings, 14305674 edges, 39443 markings/sec, 55 secs
lola: 3764278 markings, 15631166 edges, 63382 markings/sec, 60 secs
lola: 4097611 markings, 17040020 edges, 66667 markings/sec, 65 secs
lola: 4416523 markings, 18420060 edges, 63782 markings/sec, 70 secs
lola: 4745023 markings, 19808444 edges, 65700 markings/sec, 75 secs
lola: 5062502 markings, 21190682 edges, 63496 markings/sec, 80 secs
lola: 5355469 markings, 22495412 edges, 58593 markings/sec, 85 secs
lola: 5576660 markings, 23652630 edges, 44238 markings/sec, 90 secs
lola: 5941062 markings, 25108950 edges, 72880 markings/sec, 95 secs
lola: 6148944 markings, 26191808 edges, 41576 markings/sec, 100 secs
lola: 6335980 markings, 27089368 edges, 37407 markings/sec, 105 secs
lola: 6540053 markings, 28109990 edges, 40815 markings/sec, 110 secs
lola: 6745962 markings, 29179904 edges, 41182 markings/sec, 115 secs
lola: 7139861 markings, 30784125 edges, 78780 markings/sec, 120 secs
lola: 7520524 markings, 32357594 edges, 76133 markings/sec, 125 secs
lola: 7824735 markings, 33658866 edges, 60842 markings/sec, 130 secs
lola: 7997402 markings, 34498566 edges, 34533 markings/sec, 135 secs
lola: 8170877 markings, 35472384 edges, 34695 markings/sec, 140 secs
lola: 8378991 markings, 36557026 edges, 41623 markings/sec, 145 secs
lola: 8670604 markings, 37852875 edges, 58323 markings/sec, 150 secs
lola: 8839999 markings, 38829192 edges, 33879 markings/sec, 155 secs
lola: local time limit reached - aborting
lola: lola: caught signal User defined signal 1 - aborting LoLA

preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1251660 KB
lola: time consumption: 1273 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1251660 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: 14889696 kB
After kill :
MemTotal: 16427456 kB
MemFree: 14889940 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="DNAwalker-PT-16redondantChoiceR"
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 DNAwalker-PT-16redondantChoiceR, 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 r178-tajo-158987882000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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