Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913600219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-COL-V50P50N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913600219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 25 17:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 42K 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 BridgeAndVehicles-COL-V50P50N10-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591135410501

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:03:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 22:03:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 791 ms
[2020-06-02 22:03:33] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-06-02 22:03:33] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 89 ms.
[2020-06-02 22:03:33] [INFO ] Computed order based on color domains.
[2020-06-02 22:03:33] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions in 66 ms.
[2020-06-02 22:03:33] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 142 ms.
Incomplete random walk after 100000 steps, including 227 resets, run finished after 673 ms. (steps per millisecond=148 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0]
[2020-06-02 22:03:34] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2020-06-02 22:03:34] [INFO ] Computed 7 place invariants in 12 ms
[2020-06-02 22:03:34] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned unsat
[2020-06-02 22:03:35] [INFO ] [Real]Absence check using 7 positive place invariants in 45 ms returned sat
[2020-06-02 22:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:03:35] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-06-02 22:03:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:03:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2020-06-02 22:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:03:35] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2020-06-02 22:03:35] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 22:03:35] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2020-06-02 22:03:35] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 103 ms.
[2020-06-02 22:03:47] [INFO ] Added : 236 causal constraints over 48 iterations in 11152 ms. Result :sat
[2020-06-02 22:03:47] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 22:03:47] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 22:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:03:47] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-02 22:03:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:03:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2020-06-02 22:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:03:47] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2020-06-02 22:03:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 90 ms returned sat
[2020-06-02 22:03:48] [INFO ] Deduced a trap composed of 15 places in 337 ms
[2020-06-02 22:03:48] [INFO ] Deduced a trap composed of 14 places in 266 ms
[2020-06-02 22:03:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 732 ms
[2020-06-02 22:03:48] [INFO ] Computed and/alt/rep : 1325/22399/247 causal constraints in 104 ms.
[2020-06-02 22:03:54] [INFO ] Added : 185 causal constraints over 37 iterations in 6123 ms. Result :sat
[2020-06-02 22:03:54] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-02 22:03:55] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 22:03:55] [INFO ] Flatten gal took : 227 ms
[2020-06-02 22:03:55] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-02 22:03:55] [INFO ] Flatten gal took : 115 ms
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:03:55] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 16 ms.
[2020-06-02 22:03:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 31 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BridgeAndVehicles-COL-V50P50N10 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V50P50N10-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ BridgeAndVehicles-COL-V50P50N10

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:03:55 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p108 <= 2)",
"processed_size": 11,
"rewrites": 10
},
"result":
{
"edges": 448,
"markings": 449,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 101
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p107 <= 0) AND (2 <= p52))",
"processed_size": 28,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 52
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E ((((p55 <= p126 + p127) OR (p108 <= p54)) U (p126 + p127 <= p111 + p112)))",
"processed_size": 77,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 103
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((2 <= p107))",
"processed_size": 15,
"rewrites": 8
},
"net":
{
"conflict_clusters": 5,
"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": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"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": "(3 <= p0)",
"processed_size": 9,
"rewrites": 9
},
"result":
{
"edges": 447,
"markings": 448,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 102
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"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": "(3 <= p107)",
"processed_size": 11,
"rewrites": 10
},
"result":
{
"edges": 268,
"markings": 269,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 50696,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((A(F(**)) OR A(G(**))))) : E((E(F(**)) U A(G(**)))) : A(F(**)) : A(F(A(G(**)))) : A(G(E(F(**)))) : (A(F(DEADLOCK)) AND E(G(**))) : (E((** U **)) AND (A(F(**)) AND (A(F(**)) OR A(X(**))))) : E(F(A(G(**)))) : A(F(A(G(**)))) : E(G(*)) : A(F(**)) : E(X(E(G(**)))) : (** OR A(F(**)))"
},
"net":
{
"arcs": 10010,
"conflict_clusters": 5,
"places": 128,
"places_significant": 121,
"singleton_clusters": 0,
"transitions": 1328
},
"result":
{
"interim_value": "unknown unknown unknown unknown no unknown no unknown unknown unknown unknown yes unknown ",
"preliminary_value": "unknown unknown unknown unknown no unknown no unknown unknown unknown unknown yes 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: 1456/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 1328 transitions, 121 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 CTLCardinality.xml
lola: A (F ((A (F ((3 <= p110))) OR A (G ((1 <= p55)))))) : E ((E (F ((p52 <= p111 + p112))) U A (G ((3 <= p110))))) : A (F (A (((2 <= p110) U (p0 <= p52))))) : A (F (A (G (((1 <= p110) AND (p126 + p127 <= p107)))))) : A (G (E (F ((3 <= p107))))) : (A (F (A (X ((1 <= 0))))) AND E (G ((2 <= p53)))) : ((E ((((p55 <= p126 + p127) OR (p108 <= p54)) U (p126 + p127 <= p111 + p112))) AND A (F (((1 <= p107) OR (p52 <= 1))))) AND (A (F ((3 <= p108))) OR A (X ((2 <= p107))))) : E (F (A (G (((1 <= p54) OR (1 <= p107)))))) : A (F (A (G ((p0 <= 0))))) : NOT(A (F (((p109 + 1 <= p126 + p127) AND (p54 <= 0))))) : A (F ((p107 + 1 <= p55))) : E (X (E (G ((3 <= p0))))) : (((p111 + p112 + 1 <= p55) OR (p126 + p127 + 1 <= p54)) OR A (F ((3 <= p110))))
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p55 <= p126 + p127) OR (p108 <= p54)) U (p126 + p127 <= p111 + p112))) AND (A (F (((1 <= p107) OR (p52 <= 1)))) AND (A (F ((3 <= p108))) OR A (X ((2 <= p107))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p108)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p108 <= 2)
lola: processed formula length: 11
lola: 10 rewrites
lola: closed formula file CTLCardinality.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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p108)
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 / EG
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: The predicate does not eventually occur.
lola: 449 markings, 448 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p107) OR (p52 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p107 <= 0) AND (2 <= p52))
lola: processed formula length: 28
lola: 10 rewrites
lola: closed formula file CTLCardinality.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
sara: try reading problem file CTLCardinality-0.sara.
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: ((1 <= p107) OR (p52 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p55 <= p126 + p127) OR (p108 <= p54)) U (p126 + p127 <= p111 + p112)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p55 <= p126 + p127) OR (p108 <= p54)) U (p126 + p127 <= p111 + p112)))
lola: processed formula length: 77
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
sara: error: :3418: error: syntax error, unexpected $end, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p126 + p127 <= p111 + p112)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((2 <= p107))
lola: processed formula length: 15
lola: 8 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((3 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (3 <= p0)
lola: processed formula length: 9
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 448 markings, 447 edges
lola: ========================================
lola: subprocess 2 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (3 <= p107)
lola: processed formula length: 11
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p107 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= p107)
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: tscc_search
lola: The predicate is not live.
lola: 269 markings, 268 edges
lola: ========================================
lola: subprocess 3 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p54) OR (1 <= p107))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p54 <= 0) AND (p107 <= 0))
lola: processed formula length: 28
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p54) OR (1 <= p107))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p54 <= 0) AND (p107 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 219054 markings, 511463 edges, 43811 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 382202 markings, 834846 edges, 32630 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 609305 markings, 1364208 edges, 45421 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 831619 markings, 1972112 edges, 44463 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 1024652 markings, 2537712 edges, 38607 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 1244615 markings, 3130921 edges, 43993 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 1481485 markings, 3757877 edges, 47374 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 1680070 markings, 4336447 edges, 39717 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 1874947 markings, 4891073 edges, 38975 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 2100198 markings, 5507138 edges, 45050 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 2295722 markings, 6049262 edges, 39105 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 2493623 markings, 6616865 edges, 39580 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 2687553 markings, 7187898 edges, 38786 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 2890116 markings, 7730786 edges, 40513 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 3115369 markings, 8372994 edges, 45051 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 3339445 markings, 9013620 edges, 44815 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 3550578 markings, 9628264 edges, 42227 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 3746886 markings, 10207383 edges, 39262 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 3937587 markings, 10700039 edges, 38140 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 4161901 markings, 11351444 edges, 44863 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 4387052 markings, 12004622 edges, 45030 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 4610996 markings, 12655538 edges, 44789 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 4816811 markings, 13267705 edges, 41163 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 4969997 markings, 13718991 edges, 30637 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 5058944 markings, 13936532 edges, 17789 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 5249478 markings, 14449200 edges, 38107 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 5473453 markings, 15109065 edges, 44795 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 5697288 markings, 15765264 edges, 44767 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 5897628 markings, 16354457 edges, 40068 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 6029416 markings, 16744375 edges, 26358 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 6226895 markings, 17334118 edges, 39496 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 6410383 markings, 17826908 edges, 36698 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 6597411 markings, 18307294 edges, 37406 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 6816900 markings, 18954102 edges, 43898 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 7037884 markings, 19609182 edges, 44197 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 7257845 markings, 20262988 edges, 43992 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 7469897 markings, 20892209 edges, 42410 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 7678312 markings, 21521713 edges, 41683 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 7871543 markings, 22072425 edges, 38646 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 8033400 markings, 22451831 edges, 32371 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 8235528 markings, 23017849 edges, 40426 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 8458272 markings, 23681104 edges, 44549 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 8679441 markings, 24341600 edges, 44234 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 8895707 markings, 24984538 edges, 43253 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 9113395 markings, 25636675 edges, 43538 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 9323762 markings, 26274050 edges, 42073 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 9516351 markings, 26837914 edges, 38518 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 9677969 markings, 27216713 edges, 32324 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 9847836 markings, 27627225 edges, 33973 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 10058632 markings, 28262390 edges, 42159 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 10280337 markings, 28930908 edges, 44341 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 10501021 markings, 29593192 edges, 44137 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 10719552 markings, 30248720 edges, 43706 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 10938976 markings, 30906073 edges, 43885 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 11155322 markings, 31528166 edges, 43269 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 11355424 markings, 32098606 edges, 40020 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 11575485 markings, 32770483 edges, 44012 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 11776926 markings, 33366603 edges, 40288 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 11941444 markings, 33768528 edges, 32904 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 12097462 markings, 34117935 edges, 31204 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 12268237 markings, 34534779 edges, 34155 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 12488394 markings, 35204799 edges, 44031 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 12704330 markings, 35856226 edges, 43187 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 12924322 markings, 36522099 edges, 43998 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 13144151 markings, 37182657 edges, 43966 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 13361680 markings, 37844249 edges, 43506 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 13469661 markings, 38168372 edges, 21596 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 13578100 markings, 38495643 edges, 21688 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 13685683 markings, 38824687 edges, 21517 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 13781672 markings, 39103628 edges, 19198 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown no unknown unknown unknown unknown yes unknown
lola: memory consumption: 704228 KB
lola: time consumption: 387 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
sara: warning, failure of lp_solve (at job 147)
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown no unknown unknown unknown unknown yes unknown
lola:
preliminary result: unknown unknown unknown unknown no unknown no unknown unknown unknown unknown yes unknown
lola: memory consumption: 50696 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427460 kB
MemFree: 15849976 kB
After kill :
MemTotal: 16427460 kB
MemFree: 15849984 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="BridgeAndVehicles-COL-V50P50N10"
export BK_EXAMINATION="CTLCardinality"
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 BridgeAndVehicles-COL-V50P50N10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913600219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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