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.r166-smll-158987787500316.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 Angiogenesis-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787500316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.6K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 34K Apr 28 14:22 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 Angiogenesis-PT-01-CTLFireability-00
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-01
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-02
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-03
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-04
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-05
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-06
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-07
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-08
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-09
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-10
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-11
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-12
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-13
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-14
FORMULA_NAME Angiogenesis-PT-01-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591413951942

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 03:25:54] [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 03:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 03:25:54] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2020-06-06 03:25:54] [INFO ] Transformed 39 places.
[2020-06-06 03:25:54] [INFO ] Transformed 64 transitions.
[2020-06-06 03:25:54] [INFO ] Found NUPN structural information;
[2020-06-06 03:25:54] [INFO ] Parsed PT model containing 39 places and 64 transitions in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 419 ms. (steps per millisecond=238 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 64 rows 39 cols
[2020-06-06 03:25:55] [INFO ] Computed 8 place invariants in 10 ms
[2020-06-06 03:25:55] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-06 03:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-06 03:25:55] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 19 ms.
[2020-06-06 03:25:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:25:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2020-06-06 03:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:55] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2020-06-06 03:25:55] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-06-06 03:25:56] [INFO ] Added : 61 causal constraints over 13 iterations in 174 ms. Result :sat
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-06 03:25:56] [INFO ] Deduced a trap composed of 23 places in 43 ms
[2020-06-06 03:25:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-06 03:25:56] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-06-06 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:25:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-06 03:25:56] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-06-06 03:25:56] [INFO ] Added : 61 causal constraints over 13 iterations in 171 ms. Result :sat
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-06 03:25:56] [INFO ] Deduced a trap composed of 23 places in 22 ms
[2020-06-06 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-06-06 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:25:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-06 03:25:56] [INFO ] Deduced a trap composed of 23 places in 24 ms
[2020-06-06 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2020-06-06 03:25:56] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 03:25:56] [INFO ] Added : 59 causal constraints over 12 iterations in 115 ms. Result :sat
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-06 03:25:56] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2020-06-06 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:25:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-06 03:25:56] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 03:25:57] [INFO ] Added : 57 causal constraints over 12 iterations in 111 ms. Result :sat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-06 03:25:57] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 03:25:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 03:25:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-06 03:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:57] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-06 03:25:57] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-06-06 03:25:57] [INFO ] Added : 61 causal constraints over 14 iterations in 166 ms. Result :sat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2020-06-06 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-06 03:25:57] [INFO ] Deduced a trap composed of 23 places in 28 ms
[2020-06-06 03:25:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned unsat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-06 03:25:57] [INFO ] Deduced a trap composed of 23 places in 25 ms
[2020-06-06 03:25:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-06 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-06 03:25:57] [INFO ] Deduced a trap composed of 23 places in 34 ms
[2020-06-06 03:25:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2020-06-06 03:25:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 17 simplifications.
[2020-06-06 03:25:58] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-06 03:25:58] [INFO ] Flatten gal took : 69 ms
[2020-06-06 03:25:58] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-06 03:25:58] [INFO ] Flatten gal took : 21 ms
FORMULA Angiogenesis-PT-01-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-01-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 03:25:58] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-06 03:25:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Angiogenesis-PT-01 @ 3570 seconds

FORMULA Angiogenesis-PT-01-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-01-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-01-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-01-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ Angiogenesis-PT-01

{
"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 03:25:59 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((AG(((p30 <= 0))) OR ((p37 <= 0))))",
"processed_size": 38,
"rewrites": 23
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 256,
"markings": 102,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "AX(((1 <= p1)))",
"processed_size": 15,
"rewrites": 22
},
"net":
{
"conflict_clusters": 19,
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p36))",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "AX(((1 <= p23)))",
"processed_size": 16,
"rewrites": 22
},
"net":
{
"conflict_clusters": 19,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p1)) AND ((1 <= p15)) AND ((p19 <= 0)))",
"processed_size": 47,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (((p16 <= 0))))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p36))",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "AX(((1 <= p23)))",
"processed_size": 16,
"rewrites": 22
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p22))",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p1)) AND ((1 <= p15)) AND ((p19 <= 0)))",
"processed_size": 47,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23252,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G(*)) OR ((** AND (A(G(**)) OR (** OR **))) OR **)) : A(X((A(G(*)) OR **))) : A(X(**)) : (** OR (A(X(**)) OR (** OR (A(G(**)) AND (** AND (** AND **))))))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "yes yes no no ",
"value": "yes yes no no "
},
"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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: ((NOT(A (F (((1 <= p16))))) OR (((1 <= p4)) AND ((A (G (((1 <= p15) AND (1 <= p33)))) OR ((p16 <= 0))) OR ((p25 <= 0))))) OR ((1 <= p15) AND (1 <= p34))) : A (X ((NOT(E (F (((1 <= p30))))) OR ((p37 <= 0))))) : E (((1 <= 0) U A (X (((1 <= p1)))))) : (NOT(A ((((1 <= p14) AND (1 <= p32)) U (1 <= 0)))) AND (((((1 <= p36)) OR A (X (((1 <= p23))))) OR ((1 <= p22))) OR (((A (G (((1 <= p15) AND (1 <= p34)))) AND ((1 <= p1))) AND ((1 <= p15))) AND ((p19 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G (((p30 <= 0)))) OR ((p37 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AG(((p30 <= 0))) OR ((p37 <= 0))))
lola: processed formula length: 38
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 102 markings, 256 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p1)))
lola: processed formula length: 15
lola: 22 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 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p36)) OR (A (X (((1 <= p23)))) OR (((1 <= p22)) OR (A (G (((1 <= p15) AND (1 <= p34)))) AND (((1 <= p1)) AND (((1 <= p15)) AND ((p19 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36))
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p23)))
lola: processed formula length: 16
lola: 22 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: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1)) AND (((1 <= p15)) AND ((p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((1 <= p1)) AND ((1 <= p15)) AND ((p19 <= 0)))
lola: processed formula length: 47
lola: 24 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p16 <= 0)))) OR ((((1 <= p4)) AND (A (G (((1 <= p15) AND (1 <= p33)))) OR (((p16 <= 0)) OR ((p25 <= 0))))) OR ((1 <= p15) AND (1 <= p34))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p16 <= 0))))
lola: processed formula length: 20
lola: 22 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p16))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p36)) OR (A (X (((1 <= p23)))) OR (((1 <= p22)) OR (A (G (((1 <= p15) AND (1 <= p34)))) AND (((1 <= p1)) AND (((1 <= p15)) AND ((p19 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36))
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: A (X (((1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p23)))
lola: processed formula length: 16
lola: 22 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: ========================================
lola: ...considering subproblem: ((1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p22))
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: (((1 <= p1)) AND (((1 <= p15)) AND ((p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((1 <= p1)) AND ((1 <= p15)) AND ((p19 <= 0)))
lola: processed formula length: 47
lola: 24 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no
lola:
preliminary result: yes yes no no
lola: memory consumption: 23252 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
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="Angiogenesis-PT-01"
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 Angiogenesis-PT-01, 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 r166-smll-158987787500316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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