Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815900436.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 GPPP-PT-C0001N0000000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:49 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 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-CTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591430175393

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 07:56:17] [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-06 07:56:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 07:56:17] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-06-06 07:56:17] [INFO ] Transformed 33 places.
[2020-06-06 07:56:17] [INFO ] Transformed 22 transitions.
[2020-06-06 07:56:17] [INFO ] Parsed PT model containing 33 places and 22 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=458 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 07:56:18] [INFO ] Computed 13 place invariants in 6 ms
[2020-06-06 07:56:18] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-06-06 07:56:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-06 07:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:56:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-06 07:56:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:56:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-06 07:56:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 49 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-06 07:56:18] [INFO ] Flatten gal took : 34 ms
[2020-06-06 07:56:18] [INFO ] Flatten gal took : 11 ms
[2020-06-06 07:56:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-06 07:56:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ GPPP-PT-C0001N0000000100 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000000100-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ GPPP-PT-C0001N0000000100

{
"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": "Sat Jun 6 07:56:19 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "A (G (((p25 <= 6))))",
"processed_size": 20,
"rewrites": 28
},
"result":
{
"edges": 66,
"markings": 67,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((p16 <= 0) U ((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (2 <= p4))))",
"processed_size": 74,
"rewrites": 31
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(1 <= p24)",
"processed_size": 10,
"rewrites": 30
},
"result":
{
"edges": 120,
"markings": 101,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX(AX(((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p20))))",
"processed_size": 64,
"rewrites": 28
},
"net":
{
"conflict_clusters": 14,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "EF(AX(EF(((7 <= p25)))))",
"processed_size": 24,
"rewrites": 29
},
"net":
{
"conflict_clusters": 14,
"singleton_clusters": 0
},
"result":
{
"edges": 119,
"markings": 101,
"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":
{
"error": null,
"memory": 6845912,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A((* R *)) OR **) : A(G(E(F(**)))) : A(G((E(F(**)) OR (E(F(**)) OR A(F(**)))))) : (A(G(*)) OR (A((** U **)) AND E(X(**)))) : A(G(E(F(**)))) : (NODEADLOCK AND (E(F(*)) AND **)) : E(F((E(G(**)) AND (** AND (A(F(**)) AND **))))) : (E((E(F(**)) U **)) OR E(G(**))) : A(G((A(F(**)) OR (E(X(**)) AND A(X(**)))))) : (A(F(A(G(*)))) OR A(X(A(X(**))))) : A(((A(G(**)) OR E(F(**))) U E(G(**)))) : A(F(**)) : E(F(A(X(E(F(**)))))) : (E(X(**)) AND E(F(A(X(**))))) : E(F(E(G(A(X(**)))))) : E(F(A(G(E(X(**))))))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"interim_value": "unknown unknown unknown no unknown unknown unknown unknown unknown no unknown unknown yes unknown unknown unknown ",
"preliminary_value": "unknown unknown unknown no unknown unknown unknown unknown unknown no unknown unknown yes 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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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: (7 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: (NOT(E (((p20 <= 0) U ((1 <= p3) AND (1 <= p23))))) OR ((7 <= p25))) : A (G (E (F (((p26 <= 0) OR (p15 <= 0) OR (p27 <= 2)))))) : A (G (((E (F ((((1 <= p8) AND (1 <= p30)) OR ((7 <= p25))))) OR E (F (((1 <= p19) AND (1 <= p22))))) OR A (F (((7 <= p25))))))) : (NOT(E (F (E (F (((7 <= p25))))))) OR (A (((p16 <= 0) U ((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (2 <= p4)))) AND E (X (((1 <= p18) AND (1 <= p19)))))) : A (G (E (F (A (F (((1 <= p8) AND (1 <= p30)))))))) : ((NOT(A (X ((1 <= 0)))) AND NOT(A (G (((p9 <= 0) OR (p13 <= 0) OR ((1 <= p5) AND (1 <= p6)) OR (1 <= p21)))))) AND ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))) : E (F ((((E (G (((1 <= p26)))) AND (p12 <= 0)) AND A (F (((1 <= p18) AND (1 <= p19) AND (1 <= p21))))) AND ((p19 <= 0) OR (p22 <= 0))))) : (E ((E (F (((1 <= p9) AND (1 <= p10)))) U ((7 <= p25) AND ((p18 <= 0) OR (p19 <= 0))))) OR E (G (((1 <= p11) AND (1 <= p12) AND (7 <= p31) AND ((p19 <= 0) OR (p22 <= 0)))))) : A (G ((A (F ((1 <= p17))) OR (E (X ((1 <= p20))) AND A (X (((1 <= p26)))))))) : (NOT(E (G (E (F ((1 <= p24)))))) OR A (X (A (X (((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p20))))))) : A (((A (G (((1 <= p0) AND (1 <= p12) AND (1 <= p32)))) OR E (F (((1 <= p18) AND (1 <= p19))))) U E (G ((p12 <= 0))))) : A (F (A (((((1 <= p18) AND (1 <= p19)) OR ((1 <= p8) AND (1 <= p30))) U ((1 <= p12) OR ((1 <= p9) AND (1 <= p13))))))) : E (F (A (X (E (F (((7 <= p25)))))))) : (E (X ((((p20 <= 0) OR ((1 <= p3) AND (1 <= p23) AND (1 <= p8) AND (1 <= p30))) AND ((p15 <= 0) OR (p27 <= 2))))) AND E (F (A (X (((1 <= p9) AND (1 <= p10))))))) : E (F (E (G (A (X (((7 <= p25)))))))) : E (F (A (G (E (X (((1 <= p19) AND (1 <= p22))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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:455
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: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: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:329
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:440
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 (G (((p25 <= 6)))) OR (A (((p16 <= 0) U ((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (2 <= p4)))) AND E (X (((1 <= p18) AND (1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p25 <= 6))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p25 <= 6))))
lola: processed formula length: 20
lola: 28 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: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: ((7 <= p25))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 67 markings, 66 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p16 <= 0) U ((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (2 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p16 <= 0) U ((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (2 <= p4))))
lola: processed formula length: 74
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: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
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: (p16 <= 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: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((1 <= p17))) OR (E (X ((1 <= p20))) AND A (X (((1 <= p26))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF((1 <= p17)) OR (EX((1 <= p20)) AND AX(((1 <= p26))))))
lola: processed formula length: 61
lola: 30 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: 1708897 markings, 6062382 edges, 341779 markings/sec, 0 secs
lola: 3571063 markings, 12800805 edges, 372433 markings/sec, 5 secs
lola: 5392691 markings, 19432835 edges, 364326 markings/sec, 10 secs
lola: 7175568 markings, 25936545 edges, 356575 markings/sec, 15 secs
lola: 8988030 markings, 32540777 edges, 362492 markings/sec, 20 secs
lola: 10790278 markings, 39055359 edges, 360450 markings/sec, 25 secs
lola: 12573356 markings, 45550231 edges, 356616 markings/sec, 30 secs
lola: 14377520 markings, 52130192 edges, 360833 markings/sec, 35 secs
lola: 16171368 markings, 58671382 edges, 358770 markings/sec, 40 secs
lola: 17982144 markings, 65212306 edges, 362155 markings/sec, 45 secs
lola: 19756926 markings, 71678369 edges, 354956 markings/sec, 50 secs
lola: 21510293 markings, 78071468 edges, 350673 markings/sec, 55 secs
lola: 23218963 markings, 84667288 edges, 341734 markings/sec, 60 secs
lola: 23726011 markings, 91695571 edges, 101410 markings/sec, 65 secs
lola: 24212014 markings, 98509181 edges, 97201 markings/sec, 70 secs
lola: 24691876 markings, 105245485 edges, 95972 markings/sec, 75 secs
lola: 25165086 markings, 111906959 edges, 94642 markings/sec, 80 secs
lola: 25637611 markings, 118554671 edges, 94505 markings/sec, 85 secs
lola: 26109535 markings, 125204004 edges, 94385 markings/sec, 90 secs
lola: 26580593 markings, 131837607 edges, 94212 markings/sec, 95 secs
lola: 27050191 markings, 138453001 edges, 93920 markings/sec, 100 secs
lola: 27519549 markings, 145060914 edges, 93872 markings/sec, 105 secs
lola: 27985077 markings, 151633065 edges, 93106 markings/sec, 110 secs
lola: 28452239 markings, 158218069 edges, 93432 markings/sec, 115 secs
lola: 28915717 markings, 164757420 edges, 92696 markings/sec, 120 secs
lola: 29381296 markings, 171320003 edges, 93116 markings/sec, 125 secs
lola: 29846914 markings, 177890427 edges, 93124 markings/sec, 130 secs
lola: 30312914 markings, 184466457 edges, 93200 markings/sec, 135 secs
lola: 30779827 markings, 191044346 edges, 93383 markings/sec, 140 secs
lola: 31241761 markings, 197584094 edges, 92387 markings/sec, 145 secs
lola: 31708385 markings, 204160289 edges, 93325 markings/sec, 150 secs
lola: 32171508 markings, 210707101 edges, 92625 markings/sec, 155 secs
lola: 32638518 markings, 217294459 edges, 93402 markings/sec, 160 secs
lola: 33101423 markings, 223831606 edges, 92581 markings/sec, 165 secs
lola: 33568511 markings, 230420280 edges, 93418 markings/sec, 170 secs
lola: 34033757 markings, 236991117 edges, 93049 markings/sec, 175 secs
lola: 34495541 markings, 243522716 edges, 92357 markings/sec, 180 secs
lola: 34958350 markings, 250046140 edges, 92562 markings/sec, 185 secs
lola: 35423104 markings, 256605338 edges, 92951 markings/sec, 190 secs
lola: 35884667 markings, 263121632 edges, 92313 markings/sec, 195 secs
lola: 36345177 markings, 269630157 edges, 92102 markings/sec, 200 secs
lola: 36806425 markings, 276141654 edges, 92250 markings/sec, 205 secs
lola: 37269573 markings, 282671754 edges, 92630 markings/sec, 210 secs
lola: 37728912 markings, 289155477 edges, 91868 markings/sec, 215 secs
lola: 38188512 markings, 295644590 edges, 91920 markings/sec, 220 secs
lola: 38648463 markings, 302139004 edges, 91990 markings/sec, 225 secs
lola: 39108403 markings, 308640010 edges, 91988 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 3240848 KB
lola: time consumption: 240 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((p24 <= 0))))) OR A (X (A (X (((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p24 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p24)
lola: processed formula length: 10
lola: 30 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p24 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p24)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 101 markings, 120 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AX(((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p20))))
lola: processed formula length: 64
lola: 28 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (E (F (((7 <= p25))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(EF(((7 <= p25)))))
lola: processed formula length: 24
lola: 29 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 101 markings, 119 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((p20 <= 0) OR ((1 <= p3) AND (1 <= p23) AND (1 <= p8) AND (1 <= p30))) AND ((p15 <= 0) OR (p27 <= 2))))) AND E (F (A (X (((1 <= p9) AND (1 <= p10)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p9) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p9) AND (1 <= p10))))
lola: processed formula length: 34
lola: 28 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: 1807174 markings, 6224519 edges, 361435 markings/sec, 0 secs
lola: 2918372 markings, 12845507 edges, 222240 markings/sec, 5 secs
lola: 4008309 markings, 19354533 edges, 217987 markings/sec, 10 secs
lola: 5084753 markings, 25798081 edges, 215289 markings/sec, 15 secs
lola: 6156141 markings, 32220100 edges, 214278 markings/sec, 20 secs
lola: 7223416 markings, 38616833 edges, 213455 markings/sec, 25 secs
lola: 8284604 markings, 44982408 edges, 212238 markings/sec, 30 secs
lola: 9341036 markings, 51320161 edges, 211286 markings/sec, 35 secs
lola: 10392752 markings, 57635244 edges, 210343 markings/sec, 40 secs
lola: 11440685 markings, 63926910 edges, 209587 markings/sec, 45 secs
lola: 12492461 markings, 70241519 edges, 210355 markings/sec, 50 secs
lola: 13543846 markings, 76551774 edges, 210277 markings/sec, 55 secs
lola: 14589901 markings, 82836788 edges, 209211 markings/sec, 60 secs
lola: 15597562 markings, 88885303 edges, 201532 markings/sec, 65 secs
lola: 16648941 markings, 95204848 edges, 210276 markings/sec, 70 secs
lola: 17696553 markings, 101503532 edges, 209522 markings/sec, 75 secs
lola: 18746337 markings, 107814931 edges, 209957 markings/sec, 80 secs
lola: 19792377 markings, 114103494 edges, 209208 markings/sec, 85 secs
lola: 20838893 markings, 120394521 edges, 209303 markings/sec, 90 secs
lola: 21881891 markings, 126663703 edges, 208600 markings/sec, 95 secs
lola: 22923910 markings, 132927311 edges, 208404 markings/sec, 100 secs
lola: 23965923 markings, 139190122 edges, 208403 markings/sec, 105 secs
lola: 25006589 markings, 145438649 edges, 208133 markings/sec, 110 secs
lola: 26043844 markings, 151671941 edges, 207451 markings/sec, 115 secs
lola: 27081406 markings, 157907557 edges, 207512 markings/sec, 120 secs
lola: 28117462 markings, 164132045 edges, 207211 markings/sec, 125 secs
lola: 29154054 markings, 170360203 edges, 207318 markings/sec, 130 secs
lola: 30189144 markings, 176579224 edges, 207018 markings/sec, 135 secs
lola: 31221203 markings, 182781549 edges, 206412 markings/sec, 140 secs
lola: 32251980 markings, 188977910 edges, 206155 markings/sec, 145 secs
lola: 33283679 markings, 195180305 edges, 206340 markings/sec, 150 secs
lola: 34335160 markings, 201389728 edges, 210296 markings/sec, 155 secs
lola: 35409407 markings, 207508789 edges, 214849 markings/sec, 160 secs
lola: 36479405 markings, 213632857 edges, 214000 markings/sec, 165 secs
lola: 37551453 markings, 219765722 edges, 214410 markings/sec, 170 secs
lola: 38629306 markings, 225924603 edges, 215571 markings/sec, 175 secs
lola: 39685292 markings, 231960434 edges, 211197 markings/sec, 180 secs
lola: 40758325 markings, 238096565 edges, 214607 markings/sec, 185 secs
lola: 41840080 markings, 244268622 edges, 216351 markings/sec, 190 secs
lola: 42979251 markings, 250627232 edges, 227834 markings/sec, 195 secs
lola: 44200888 markings, 256739548 edges, 244327 markings/sec, 200 secs
lola: 45125028 markings, 262233740 edges, 184828 markings/sec, 205 secs
lola: 46022588 markings, 267599244 edges, 179512 markings/sec, 210 secs
lola: 46907784 markings, 272905683 edges, 177039 markings/sec, 215 secs
lola: 47787887 markings, 278181373 edges, 176021 markings/sec, 220 secs
lola: 48673451 markings, 283450444 edges, 177113 markings/sec, 225 secs
lola: 49552117 markings, 288723042 edges, 175733 markings/sec, 230 secs
lola: 50428848 markings, 293985040 edges, 175346 markings/sec, 235 secs
lola: 51307820 markings, 299260616 edges, 175794 markings/sec, 240 secs
lola: 52187085 markings, 304538112 edges, 175853 markings/sec, 245 secs
lola: 53053457 markings, 309744657 edges, 173274 markings/sec, 250 secs
lola: 53925981 markings, 314981836 edges, 174505 markings/sec, 255 secs
lola: 54803370 markings, 320256050 edges, 175478 markings/sec, 260 secs
lola: 55685141 markings, 325557129 edges, 176354 markings/sec, 265 secs
lola: 56568370 markings, 330867435 edges, 176646 markings/sec, 270 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown no unknown unknown yes unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown no unknown unknown yes unknown unknown unknown
lola: memory consumption: 6845912 KB
lola: time consumption: 517 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 no unknown unknown unknown unknown unknown no unknown unknown yes unknown unknown unknown
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown no unknown unknown yes unknown unknown unknown
lola: memory consumption: 6845912 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: 9287532 kB
After kill :
MemTotal: 16427332 kB
MemFree: 9287240 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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r170-smll-158987815900436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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