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.r228-oct2-159033547200139.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 SmartHome-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547200139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 4.1K May 14 03:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 03:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 21:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 10:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 10:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 159K May 12 20:42 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 SmartHome-PT-18-CTLCardinality-00
FORMULA_NAME SmartHome-PT-18-CTLCardinality-01
FORMULA_NAME SmartHome-PT-18-CTLCardinality-02
FORMULA_NAME SmartHome-PT-18-CTLCardinality-03
FORMULA_NAME SmartHome-PT-18-CTLCardinality-04
FORMULA_NAME SmartHome-PT-18-CTLCardinality-05
FORMULA_NAME SmartHome-PT-18-CTLCardinality-06
FORMULA_NAME SmartHome-PT-18-CTLCardinality-07
FORMULA_NAME SmartHome-PT-18-CTLCardinality-08
FORMULA_NAME SmartHome-PT-18-CTLCardinality-09
FORMULA_NAME SmartHome-PT-18-CTLCardinality-10
FORMULA_NAME SmartHome-PT-18-CTLCardinality-11
FORMULA_NAME SmartHome-PT-18-CTLCardinality-12
FORMULA_NAME SmartHome-PT-18-CTLCardinality-13
FORMULA_NAME SmartHome-PT-18-CTLCardinality-14
FORMULA_NAME SmartHome-PT-18-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591292049434

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:34:10] [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-04 17:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:34:10] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2020-06-04 17:34:10] [INFO ] Transformed 653 places.
[2020-06-04 17:34:10] [INFO ] Transformed 706 transitions.
[2020-06-04 17:34:10] [INFO ] Found NUPN structural information;
[2020-06-04 17:34:10] [INFO ] Parsed PT model containing 653 places and 706 transitions in 110 ms.
Deduced a syphon composed of 206 places in 9 ms
Reduce places removed 206 places and 176 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Incomplete random walk after 100000 steps, including 295 resets, run finished after 177 ms. (steps per millisecond=564 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 530 rows 447 cols
[2020-06-04 17:34:11] [INFO ] Computed 20 place invariants in 12 ms
[2020-06-04 17:34:11] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2020-06-04 17:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:34:11] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2020-06-04 17:34:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:34:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned unsat
[2020-06-04 17:34:12] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 17:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:34:12] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2020-06-04 17:34:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:34:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned unsat
[2020-06-04 17:34:12] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 17:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:34:12] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2020-06-04 17:34:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:34:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned unsat
[2020-06-04 17:34:13] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-06-04 17:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:34:13] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2020-06-04 17:34:13] [INFO ] Deduced a trap composed of 46 places in 110 ms
[2020-06-04 17:34:13] [INFO ] Deduced a trap composed of 32 places in 56 ms
[2020-06-04 17:34:13] [INFO ] Deduced a trap composed of 28 places in 60 ms
[2020-06-04 17:34:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2020-06-04 17:34:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:34:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 402 ms returned sat
[2020-06-04 17:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:34:14] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2020-06-04 17:34:14] [INFO ] Deduced a trap composed of 29 places in 86 ms
[2020-06-04 17:34:14] [INFO ] Deduced a trap composed of 46 places in 73 ms
[2020-06-04 17:34:14] [INFO ] Deduced a trap composed of 28 places in 51 ms
[2020-06-04 17:34:14] [INFO ] Deduced a trap composed of 32 places in 63 ms
[2020-06-04 17:34:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 347 ms
[2020-06-04 17:34:14] [INFO ] Computed and/alt/rep : 529/1631/529 causal constraints in 25 ms.
[2020-06-04 17:34:18] [INFO ] Added : 513 causal constraints over 103 iterations in 3388 ms. Result :sat
[2020-06-04 17:34:18] [INFO ] Deduced a trap composed of 84 places in 52 ms
[2020-06-04 17:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-04 17:34:18] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-04 17:34:18] [INFO ] Flatten gal took : 88 ms
[2020-06-04 17:34:18] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-04 17:34:18] [INFO ] Flatten gal took : 59 ms
FORMULA SmartHome-PT-18-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:34:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 17:34:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmartHome-PT-18 @ 3570 seconds

FORMULA SmartHome-PT-18-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-18-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-18-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ SmartHome-PT-18

{
"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": "Thu Jun 4 17:34:19 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AG((((p376 <= 0)) OR ((1 <= p388)))))",
"processed_size": 41,
"rewrites": 4
},
"net":
{
"conflict_clusters": 421,
"singleton_clusters": 0
},
"result":
{
"edges": 3087,
"markings": 1874,
"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": 3568
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p432))))",
"processed_size": 21,
"rewrites": 3
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p432))))",
"processed_size": 21,
"rewrites": 3
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E ((((p329 <= 0)) U ((p56 <= 0))))",
"processed_size": 34,
"rewrites": 5
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20716,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(X(A(G(**)))) : DEADLOCK : (E((** U **)) AND E(F(**)))"
},
"net":
{
"arcs": 1168,
"conflict_clusters": 421,
"places": 447,
"places_significant": 427,
"singleton_clusters": 0,
"transitions": 530
},
"result":
{
"preliminary_value": "no no yes ",
"value": "no no yes "
},
"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: 977/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 14304
lola: finding significant places
lola: 447 places, 530 transitions, 427 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: LP says that atomic proposition is always true: (p388 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: E (X (A (G ((((p376 <= 0)) OR ((1 <= p388))))))) : A (X ((1 <= 0))) : (E ((((p329 <= 0)) U ((p56 <= 0)))) AND E (F (((1 <= p432)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 2 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p376 <= 0)) OR ((1 <= p388)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p376 <= 0)) OR ((1 <= p388)))))
lola: processed formula length: 41
lola: 4 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1874 markings, 3087 edges
lola: ========================================
lola: subprocess 2 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p329 <= 0)) U ((p56 <= 0)))) AND E (F (((1 <= p432)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p432))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p432))))
lola: processed formula length: 21
lola: 3 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p432))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((((p329 <= 0)) U ((p56 <= 0)))) AND E (F (((1 <= p432)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p432))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p432))))
lola: processed formula length: 21
lola: 3 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p432))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p329 <= 0)) U ((p56 <= 0))))
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 ((((p329 <= 0)) U ((p56 <= 0))))
lola: processed formula length: 34
lola: 5 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)
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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation task get result unparse finished++ id 0
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: formula 0: ((p56 <= 0))
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: RESULT
lola:
SUMMARY: no no yes
lola:
preliminary result: no no yes
lola: memory consumption: 20716 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="SmartHome-PT-18"
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 SmartHome-PT-18, 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 r228-oct2-159033547200139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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