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.r184-oct2-158987928200236.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 HouseConstruction-PT-16000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928200236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 4 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 21:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 21:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 3 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-16000-CTLFireability-00
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-01
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-02
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-03
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-04
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-05
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-06
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-07
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-08
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-09
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-10
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-11
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-12
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-13
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-14
FORMULA_NAME HouseConstruction-PT-16000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591199308903

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:48:31] [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 15:48:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:48:31] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2020-06-03 15:48:31] [INFO ] Transformed 26 places.
[2020-06-03 15:48:31] [INFO ] Transformed 18 transitions.
[2020-06-03 15:48:31] [INFO ] Parsed PT model containing 26 places and 18 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Incomplete random walk after 112009 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=2604 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0]
// Phase 1: matrix 18 rows 26 cols
[2020-06-03 15:48:31] [INFO ] Computed 8 place invariants in 3 ms
[2020-06-03 15:48:31] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 17 ms returned sat
[2020-06-03 15:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:31] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-03 15:48:31] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 12 ms.
[2020-06-03 15:48:32] [INFO ] Added : 6 causal constraints over 2 iterations in 56 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 53 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:48:32] [INFO ] Added : 12 causal constraints over 3 iterations in 77 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:48:32] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:48:32] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:48:32] [INFO ] Added : 16 causal constraints over 4 iterations in 21 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:48:32] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:48:32] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:48:32] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:48:32] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:48:32] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 1 ms.
[2020-06-03 15:48:32] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-03 15:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:48:32] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 15:48:32] [INFO ] Computed and/alt/rep : 17/25/17 causal constraints in 2 ms.
[2020-06-03 15:48:32] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
[2020-06-03 15:48:32] [INFO ] Flatten gal took : 40 ms
[2020-06-03 15:48:32] [INFO ] Flatten gal took : 6 ms
[2020-06-03 15:48:32] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-03 15:48:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ HouseConstruction-PT-16000 @ 3570 seconds

FORMULA HouseConstruction-PT-16000-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-16000-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-16000-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ HouseConstruction-PT-16000

{
"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 15:48:33 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((1 <= p5))",
"processed_size": 13,
"rewrites": 47
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"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": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "((p15 <= 0) AND ((p22 <= 0) OR (p23 <= 0)))",
"processed_size": 44,
"rewrites": 49
},
"result":
{
"edges": 159999,
"markings": 160000,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p20) AND (1 <= p21) AND (1 <= p24))",
"processed_size": 42,
"rewrites": 48
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 257
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((((1 <= p25) AND (1 <= p3) AND (1 <= p7)) AND EX(((p10 <= 0) OR (p11 <= 0)))))",
"processed_size": 82,
"rewrites": 48
},
"net":
{
"conflict_clusters": 18,
"singleton_clusters": 0
},
"result":
{
"edges": 288000,
"markings": 288001,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 30808,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) OR E(F(**))) : A(F(A(X(A(G(**)))))) : A(F(**)) : A(((A(F(**)) OR (** OR (** OR (** OR **)))) U **)) : E(F(**)) : (A(X(A(F(**)))) OR A(X(**))) : A(F((A(G(**)) OR (A((** U **)) OR **)))) : E(X(E(F(**)))) : E(G(A(F(**)))) : A(F(**)) : A(X(A(G(A(F(**)))))) : A(F((* AND E(X(*))))) : (A(F(A(X(**)))) AND ((E(X(**)) OR E(F(**))) AND (E(F(*)) OR **))) : (A(F(**)) OR (A(X(**)) OR (** OR (** OR **)))) : A((E((** U **)) U E(G(*)))) : A(F(*))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 18,
"places": 26,
"places_significant": 18,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"interim_value": "unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no 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: 44/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 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: (NOT(E (F (((1 <= p3) AND (1 <= p7))))) OR E (((1 <= p0) U (p0 <= 0)))) : A (F (A (G (A (X (((1 <= p9) AND (1 <= p12) AND (1 <= p13)))))))) : A (F (A (F (((1 <= p9) AND (1 <= p12) AND (1 <= p13)))))) : A ((((((A (F ((1 <= p4))) OR (1 <= p1)) OR (1 <= p5)) OR (1 <= p19)) OR ((1 <= p16) AND (1 <= p17))) U ((p8 <= 0) AND (1 <= p9) AND (1 <= p12) AND (1 <= p13)))) : E ((A ((((1 <= p20) AND (1 <= p21) AND (1 <= p24)) U (1 <= p5))) U E (F (((1 <= p6) AND (1 <= p20) AND (1 <= p21) AND (1 <= p24)))))) : (A (X (A (F (((1 <= p15) OR ((1 <= p22) AND (1 <= p23))))))) OR A (X ((1 <= p5)))) : A (F (((A (G ((1 <= p8))) OR A (((1 <= p25) U (1 <= p14)))) OR ((1 <= p20) AND (1 <= p21) AND (1 <= p24))))) : E (X (E (F (((1 <= p20) AND (1 <= p21) AND (1 <= p24)))))) : NOT(A (F (NOT(A (F (((1 <= p10) AND (1 <= p11)))))))) : A (F (((p0 <= 0) AND (1 <= p6) AND (1 <= p22) AND (1 <= p23) AND (1 <= p16) AND (1 <= p17) AND (p15 <= 0)))) : A (X (A (G (A (F ((1 <= p15))))))) : NOT(E (G ((((p25 <= 0) OR (p3 <= 0) OR (p7 <= 0)) OR A (X (((1 <= p10) AND (1 <= p11)))))))) : ((A (F (A (X ((1 <= p15))))) AND (E (X ((1 <= p2))) OR E (F (((p22 <= 0) OR (p23 <= 0) OR (p1 <= 0)))))) AND (NOT(A (G ((1 <= p1)))) OR ((1 <= p2) AND ((p10 <= 0) OR (p11 <= 0))))) : ((((A (F ((1 <= p5))) OR A (X (((((1 <= p22) AND (1 <= p23)) OR (1 <= p1)) AND ((1 <= p6) OR (1 <= p18)))))) OR ((1 <= p3) AND (1 <= p7))) OR ((p18 <= 0) AND (((1 <= p10) AND (1 <= p11)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p13))))) OR ((1 <= p5) AND (1 <= p15) AND ((p19 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR (p13 <= 0)))) : A ((E ((((1 <= p9) AND (1 <= p12) AND (1 <= p13)) U (1 <= p14))) U NOT(A (F (((1 <= p22) AND (1 <= p23))))))) : A (F (NOT(E (G ((1 <= p0))))))
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:419
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:473
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (A (G (((1 <= p9) AND (1 <= p12) AND (1 <= p13))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(AG(((1 <= p9) AND (1 <= p12) AND (1 <= p13)))))
lola: processed formula length: 53
lola: 49 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1601497 markings, 10115448 edges, 320299 markings/sec, 0 secs
lola: 2721928 markings, 19329427 edges, 224086 markings/sec, 5 secs
lola: 3904751 markings, 28715012 edges, 236565 markings/sec, 10 secs
lola: 4848343 markings, 36616794 edges, 188718 markings/sec, 15 secs
lola: 5880570 markings, 44910565 edges, 206445 markings/sec, 20 secs
lola: 6875971 markings, 53225988 edges, 199080 markings/sec, 25 secs
lola: 7983699 markings, 62262432 edges, 221546 markings/sec, 30 secs
lola: 8937720 markings, 70608463 edges, 190804 markings/sec, 35 secs
lola: 9783761 markings, 78687850 edges, 169208 markings/sec, 40 secs
lola: 10628683 markings, 86487905 edges, 168984 markings/sec, 45 secs
lola: 11537553 markings, 94568129 edges, 181774 markings/sec, 50 secs
lola: 12353291 markings, 102190601 edges, 163148 markings/sec, 55 secs
lola: 13435193 markings, 111114328 edges, 216380 markings/sec, 60 secs
lola: 14294799 markings, 118764836 edges, 171921 markings/sec, 65 secs
lola: 15125419 markings, 125905409 edges, 166124 markings/sec, 70 secs
lola: 16121394 markings, 134036856 edges, 199195 markings/sec, 75 secs
lola: 17090178 markings, 141995728 edges, 193757 markings/sec, 80 secs
lola: 17943242 markings, 149524380 edges, 170613 markings/sec, 85 secs
lola: 18708478 markings, 156330552 edges, 153047 markings/sec, 90 secs
lola: 19427853 markings, 163095739 edges, 143875 markings/sec, 95 secs
lola: 20223791 markings, 170210594 edges, 159188 markings/sec, 100 secs
lola: 20918258 markings, 176948109 edges, 138893 markings/sec, 105 secs
lola: 21582973 markings, 183404918 edges, 132943 markings/sec, 110 secs
lola: 22487223 markings, 191254079 edges, 180850 markings/sec, 115 secs
lola: 23321009 markings, 198333510 edges, 166757 markings/sec, 120 secs
lola: 24045689 markings, 204834303 edges, 144936 markings/sec, 125 secs
lola: 24787500 markings, 211532543 edges, 148362 markings/sec, 130 secs
lola: 25594660 markings, 218616380 edges, 161432 markings/sec, 135 secs
lola: 26408559 markings, 225430702 edges, 162780 markings/sec, 140 secs
lola: 27273686 markings, 232609886 edges, 173025 markings/sec, 145 secs
lola: 28024152 markings, 239031153 edges, 150093 markings/sec, 150 secs
lola: 28729099 markings, 245356332 edges, 140989 markings/sec, 155 secs
lola: 29479890 markings, 251953017 edges, 150158 markings/sec, 160 secs
lola: 30104092 markings, 258020582 edges, 124840 markings/sec, 165 secs
lola: 30809940 markings, 264439103 edges, 141170 markings/sec, 170 secs
lola: 31620176 markings, 271410572 edges, 162047 markings/sec, 175 secs
lola: 32739787 markings, 280487967 edges, 223922 markings/sec, 180 secs
lola: 33740731 markings, 289137138 edges, 200189 markings/sec, 185 secs
lola: 34585749 markings, 297033619 edges, 169004 markings/sec, 190 secs
lola: 35439624 markings, 304971523 edges, 170775 markings/sec, 195 secs
lola: 36265383 markings, 312356835 edges, 165152 markings/sec, 200 secs
lola: 37026703 markings, 319645554 edges, 152264 markings/sec, 205 secs
lola: 37945712 markings, 327841644 edges, 183802 markings/sec, 210 secs
lola: 38770309 markings, 335945962 edges, 164919 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4574788 KB
lola: time consumption: 225 seconds
lola: print data as JSON (--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: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F (((1 <= p15) OR ((1 <= p22) AND (1 <= p23))))))) OR A (X ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p5))
lola: processed formula length: 13
lola: 47 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p15) OR ((1 <= p22) AND (1 <= p23)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p15 <= 0) AND ((p22 <= 0) OR (p23 <= 0)))
lola: processed formula length: 44
lola: 49 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 (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
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:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15) OR ((1 <= p22) AND (1 <= p23)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: error: :113: 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 160000 markings, 159999 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p20) AND (1 <= p21) AND (1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p20) AND (1 <= p21) AND (1 <= p24))
lola: processed formula length: 42
lola: 48 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 (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (A (F ((1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AG(AF((1 <= p15))))
lola: processed formula length: 22
lola: 49 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3181311 markings, 10310968 edges, 636262 markings/sec, 0 secs
lola: 5744702 markings, 19779508 edges, 512678 markings/sec, 5 secs
lola: 8076973 markings, 28718113 edges, 466454 markings/sec, 10 secs
lola: 10458030 markings, 37575662 edges, 476211 markings/sec, 15 secs
lola: 12783793 markings, 46423459 edges, 465153 markings/sec, 20 secs
lola: 14878388 markings, 54873918 edges, 418919 markings/sec, 25 secs
lola: 16492170 markings, 61152026 edges, 322756 markings/sec, 30 secs
lola: 17579928 markings, 65097650 edges, 217552 markings/sec, 35 secs
lola: 18804567 markings, 69774897 edges, 244928 markings/sec, 40 secs
lola: 20630550 markings, 77129282 edges, 365197 markings/sec, 45 secs
lola: 22700747 markings, 84919674 edges, 414039 markings/sec, 50 secs
lola: 24424301 markings, 91920621 edges, 344711 markings/sec, 55 secs
lola: 26022561 markings, 98479606 edges, 319652 markings/sec, 60 secs
lola: 27751183 markings, 105652520 edges, 345724 markings/sec, 65 secs
lola: 29791511 markings, 113590988 edges, 408066 markings/sec, 70 secs
lola: 31997043 markings, 121782865 edges, 441106 markings/sec, 75 secs
lola: 33800702 markings, 128897028 edges, 360732 markings/sec, 80 secs
lola: 35597833 markings, 136131506 edges, 359426 markings/sec, 85 secs
lola: 37424916 markings, 143458073 edges, 365417 markings/sec, 90 secs
lola: 39625848 markings, 151891061 edges, 440186 markings/sec, 95 secs
lola: 41351508 markings, 158923391 edges, 345132 markings/sec, 100 secs
lola: 42931064 markings, 165550321 edges, 315911 markings/sec, 105 secs
lola: 44647632 markings, 172675466 edges, 343314 markings/sec, 110 secs
lola: 46360713 markings, 179899793 edges, 342616 markings/sec, 115 secs
lola: 48128920 markings, 187253850 edges, 353641 markings/sec, 120 secs
lola: 49737622 markings, 194163168 edges, 321740 markings/sec, 125 secs
lola: 51839704 markings, 202179718 edges, 420416 markings/sec, 130 secs
lola: 53889708 markings, 210060371 edges, 410001 markings/sec, 135 secs
lola: 55822261 markings, 217296805 edges, 386511 markings/sec, 140 secs
lola: 57423570 markings, 223746681 edges, 320262 markings/sec, 145 secs
lola: 59059545 markings, 230350261 edges, 327195 markings/sec, 150 secs
lola: 60739901 markings, 237196661 edges, 336071 markings/sec, 155 secs
lola: 62376674 markings, 244075336 edges, 327355 markings/sec, 160 secs
lola: 64082705 markings, 251094075 edges, 341206 markings/sec, 165 secs
lola: 66348839 markings, 259563848 edges, 453227 markings/sec, 170 secs
lola: 68134588 markings, 266822462 edges, 357150 markings/sec, 175 secs
lola: 69872325 markings, 273967362 edges, 347547 markings/sec, 180 secs
lola: 71545732 markings, 280904233 edges, 334681 markings/sec, 185 secs
lola: 73169740 markings, 287726414 edges, 324802 markings/sec, 190 secs
lola: 74711214 markings, 294344111 edges, 308295 markings/sec, 195 secs
lola: 76351789 markings, 301190343 edges, 328115 markings/sec, 200 secs
lola: 77943205 markings, 307885980 edges, 318283 markings/sec, 205 secs
lola: 79425520 markings, 314397893 edges, 296463 markings/sec, 210 secs
lola: 80936829 markings, 320996344 edges, 302262 markings/sec, 215 secs
lola: 82633663 markings, 328044037 edges, 339367 markings/sec, 220 secs
lola: 84113075 markings, 334493947 edges, 295882 markings/sec, 225 secs
lola: 86027965 markings, 342098826 edges, 382978 markings/sec, 230 secs
lola: 87905375 markings, 349452217 edges, 375482 markings/sec, 235 secs
lola: 89700373 markings, 356637959 edges, 359000 markings/sec, 240 secs
lola: 91855366 markings, 364691589 edges, 430999 markings/sec, 245 secs
lola: 93668349 markings, 371657244 edges, 362597 markings/sec, 250 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 7087108 KB
lola: time consumption: 483 seconds
lola: print data as JSON (--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: subprocess 4 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p25) AND (1 <= p3) AND (1 <= p7)) AND E (X (((p10 <= 0) OR (p11 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p25) AND (1 <= p3) AND (1 <= p7)) AND EX(((p10 <= 0) OR (p11 <= 0)))))
lola: processed formula length: 82
lola: 48 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: 288001 markings, 288000 edges
lola: ========================================
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((1 <= p15))))) AND ((E (X ((1 <= p2))) OR E (F (((p22 <= 0) OR (p23 <= 0) OR (p1 <= 0))))) AND (E (F ((p1 <= 0))) OR ((1 <= p2) AND ((p10 <= 0) OR (p11 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= 0) OR (p23 <= 0) OR (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p22 <= 0) OR (p23 <= 0) OR (p1 <= 0))))
lola: processed formula length: 49
lola: 47 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p22 <= 0) OR (p23 <= 0) OR (p1 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: error: :113: 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: ========================================
lola: subprocess 6 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND ((p10 <= 0) OR (p11 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND ((p10 <= 0) OR (p11 <= 0)))
lola: processed formula length: 43
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p1 <= 0)))
lola: processed formula length: 17
lola: 47 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: subprocess 8 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX((1 <= p15)))
lola: processed formula length: 18
lola: 48 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: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-7-0.sara.
sara: error: :113: 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: 1850814 markings, 9516904 edges, 370163 markings/sec, 0 secs
lola: 3118839 markings, 17811078 edges, 253605 markings/sec, 5 secs
lola: 4336730 markings, 25860520 edges, 243578 markings/sec, 10 secs
lola: 5526206 markings, 33416936 edges, 237895 markings/sec, 15 secs
lola: 6627059 markings, 40414571 edges, 220171 markings/sec, 20 secs
lola: 7988547 markings, 49316552 edges, 272298 markings/sec, 25 secs
lola: 9141471 markings, 57712639 edges, 230585 markings/sec, 30 secs
lola: 10192524 markings, 65748707 edges, 210211 markings/sec, 35 secs
lola: 11263509 markings, 73375887 edges, 214197 markings/sec, 40 secs
lola: 12433263 markings, 81465880 edges, 233951 markings/sec, 45 secs
lola: 13631903 markings, 89920431 edges, 239728 markings/sec, 50 secs
lola: 14870760 markings, 98189404 edges, 247771 markings/sec, 55 secs
lola: 16264034 markings, 107143926 edges, 278655 markings/sec, 60 secs
lola: 17469417 markings, 115548008 edges, 241077 markings/sec, 65 secs
lola: 18555708 markings, 123328890 edges, 217258 markings/sec, 70 secs
lola: 19669390 markings, 131276576 edges, 222736 markings/sec, 75 secs
lola: 20657494 markings, 138970706 edges, 197621 markings/sec, 80 secs
lola: 21773277 markings, 147113348 edges, 223157 markings/sec, 85 secs
lola: 22999162 markings, 155133248 edges, 245177 markings/sec, 90 secs
lola: 24098799 markings, 162816647 edges, 219927 markings/sec, 95 secs
lola: 25268264 markings, 170597266 edges, 233893 markings/sec, 100 secs
lola: 26504817 markings, 178401574 edges, 247311 markings/sec, 105 secs
lola: 27652302 markings, 185986360 edges, 229497 markings/sec, 110 secs
lola: 28638879 markings, 192705380 edges, 197315 markings/sec, 115 secs
lola: 29613530 markings, 199706814 edges, 194930 markings/sec, 120 secs
lola: 30659322 markings, 206172235 edges, 209158 markings/sec, 125 secs
lola: 31869594 markings, 214029467 edges, 242054 markings/sec, 130 secs
lola: 32993879 markings, 222163327 edges, 224857 markings/sec, 135 secs
lola: 34008471 markings, 229965489 edges, 202918 markings/sec, 140 secs
lola: 35039022 markings, 237335758 edges, 206110 markings/sec, 145 secs
lola: 36014012 markings, 244484803 edges, 194998 markings/sec, 150 secs
lola: 37151435 markings, 252908475 edges, 227485 markings/sec, 155 secs
lola: 38081431 markings, 260393465 edges, 185999 markings/sec, 160 secs
lola: 39118223 markings, 268277731 edges, 207358 markings/sec, 165 secs
lola: 40286943 markings, 276752312 edges, 233744 markings/sec, 170 secs
lola: 41315509 markings, 284833838 edges, 205713 markings/sec, 175 secs
lola: 42202764 markings, 291996215 edges, 177451 markings/sec, 180 secs
lola: 43064397 markings, 299123240 edges, 172327 markings/sec, 185 secs
lola: 44002315 markings, 306630758 edges, 187584 markings/sec, 190 secs
lola: 44790578 markings, 313593444 edges, 157653 markings/sec, 195 secs
lola: 45726848 markings, 321214557 edges, 187254 markings/sec, 200 secs
lola: 46790451 markings, 329148592 edges, 212721 markings/sec, 205 secs
lola: 47745186 markings, 336465214 edges, 190947 markings/sec, 210 secs
lola: 48635680 markings, 343712671 edges, 178099 markings/sec, 215 secs
lola: 49664077 markings, 351025782 edges, 205679 markings/sec, 220 secs
lola: 50656595 markings, 358226515 edges, 198504 markings/sec, 225 secs
lola: 51589882 markings, 365190254 edges, 186657 markings/sec, 230 secs
lola: 52493788 markings, 372175717 edges, 180781 markings/sec, 235 secs
lola: 53337195 markings, 379042531 edges, 168681 markings/sec, 240 secs
lola: 54180008 markings, 385618888 edges, 168563 markings/sec, 245 secs
lola: 55496159 markings, 394019025 edges, 263230 markings/sec, 250 secs
lola: 56654228 markings, 402251746 edges, 231614 markings/sec, 255 secs
lola: 57793201 markings, 410375007 edges, 227795 markings/sec, 260 secs
lola: 58925568 markings, 418527379 edges, 226473 markings/sec, 265 secs
lola: 59895253 markings, 426092675 edges, 193937 markings/sec, 270 secs
lola: local time limit reached - aborting
lola: lola: caught signal User defined signal 1 - aborting LoLA

preliminary result: unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown
lola: memory consumption: 7166520 KB
lola: time consumption: 763 seconds
lola: print data as JSON (--json)
lola: memory consumption: 7166520 KB
lola: time consumption: 763 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: subprocess 6 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p5))) OR (A (X (((((1 <= p22) AND (1 <= p23)) OR (1 <= p1)) AND ((1 <= p6) OR (1 <= p18))))) OR (((1 <= p3) AND (1 <= p7)) OR (((p18 <= 0) AND (((1 <= p10) AND (1 <= p11)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p13)))) OR ((1 <= p5) AND (1 <= p15) AND ((p19 <= 0) OR (p9 <= 0) OR (p12 <= 0) OR (p13 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 30808 KB
lola: time consumption: 1043 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 unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown unknown unknown yes unknown yes unknown unknown unknown no unknown unknown unknown unknown
lola: memory consumption: 30808 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: 16427332 kB
MemFree: 16117748 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16117756 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="HouseConstruction-PT-16000"
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 HouseConstruction-PT-16000, 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 r184-oct2-158987928200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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