fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987938500108
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for RefineWMG-PT-050051

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15800.700 3600000.00 393824.00 189732.80 ???F???????????? normal

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.r186-oct2-158987938500108.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 RefineWMG-PT-050051, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 11 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 110K Mar 24 05:38 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 n0-CTLFireability-00
FORMULA_NAME n0-CTLFireability-01
FORMULA_NAME n0-CTLFireability-02
FORMULA_NAME n0-CTLFireability-03
FORMULA_NAME n0-CTLFireability-04
FORMULA_NAME n0-CTLFireability-05
FORMULA_NAME n0-CTLFireability-06
FORMULA_NAME n0-CTLFireability-07
FORMULA_NAME n0-CTLFireability-08
FORMULA_NAME n0-CTLFireability-09
FORMULA_NAME n0-CTLFireability-10
FORMULA_NAME n0-CTLFireability-11
FORMULA_NAME n0-CTLFireability-12
FORMULA_NAME n0-CTLFireability-13
FORMULA_NAME n0-CTLFireability-14
FORMULA_NAME n0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591227479188

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:38:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:38:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:38:00] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-06-03 23:38:00] [INFO ] Transformed 254 places.
[2020-06-03 23:38:00] [INFO ] Transformed 203 transitions.
[2020-06-03 23:38:00] [INFO ] Parsed PT model containing 254 places and 203 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Incomplete random walk after 100010 steps, including 0 resets, run finished after 195 ms. (steps per millisecond=512 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1]
// Phase 1: matrix 203 rows 254 cols
[2020-06-03 23:38:01] [INFO ] Computed 102 place invariants in 5 ms
[2020-06-03 23:38:01] [INFO ] [Real]Absence check using 102 positive place invariants in 42 ms returned sat
[2020-06-03 23:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:01] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 23:38:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:01] [INFO ] [Nat]Absence check using 102 positive place invariants in 44 ms returned sat
[2020-06-03 23:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:01] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:38:01] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 12 ms.
[2020-06-03 23:38:01] [INFO ] Added : 33 causal constraints over 7 iterations in 119 ms. Result :sat
[2020-06-03 23:38:01] [INFO ] [Real]Absence check using 102 positive place invariants in 31 ms returned sat
[2020-06-03 23:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:01] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-06-03 23:38:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2020-06-03 23:38:02] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:02] [INFO ] Added : 61 causal constraints over 13 iterations in 162 ms. Result :sat
[2020-06-03 23:38:02] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:02] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 23:38:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:02] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-03 23:38:02] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:38:02] [INFO ] Added : 66 causal constraints over 14 iterations in 196 ms. Result :sat
[2020-06-03 23:38:02] [INFO ] [Real]Absence check using 102 positive place invariants in 27 ms returned sat
[2020-06-03 23:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-06-03 23:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2020-06-03 23:38:03] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:38:03] [INFO ] Added : 27 causal constraints over 6 iterations in 83 ms. Result :sat
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 23:38:03] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 23 ms.
[2020-06-03 23:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:03] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-03 23:38:03] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 17 ms.
[2020-06-03 23:38:04] [INFO ] Added : 95 causal constraints over 19 iterations in 278 ms. Result :sat
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:38:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:04] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:04] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2020-06-03 23:38:04] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 28 ms.
[2020-06-03 23:38:04] [INFO ] Added : 44 causal constraints over 9 iterations in 201 ms. Result :sat
[2020-06-03 23:38:04] [INFO ] [Real]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:05] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-06-03 23:38:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:05] [INFO ] [Nat]Absence check using 102 positive place invariants in 43 ms returned sat
[2020-06-03 23:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:05] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2020-06-03 23:38:05] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 17 ms.
[2020-06-03 23:38:06] [INFO ] Added : 99 causal constraints over 20 iterations in 658 ms. Result :sat
[2020-06-03 23:38:06] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:07] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2020-06-03 23:38:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:07] [INFO ] [Nat]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:38:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:07] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2020-06-03 23:38:07] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 10 ms.
[2020-06-03 23:38:07] [INFO ] Added : 91 causal constraints over 19 iterations in 322 ms. Result :sat
[2020-06-03 23:38:07] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:38:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2020-06-03 23:38:08] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:08] [INFO ] Added : 43 causal constraints over 9 iterations in 120 ms. Result :sat
[2020-06-03 23:38:08] [INFO ] [Real]Absence check using 102 positive place invariants in 40 ms returned sat
[2020-06-03 23:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-03 23:38:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using 102 positive place invariants in 41 ms returned sat
[2020-06-03 23:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:08] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2020-06-03 23:38:08] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 11 ms.
[2020-06-03 23:38:09] [INFO ] Added : 63 causal constraints over 13 iterations in 159 ms. Result :sat
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using 102 positive place invariants in 85 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:38:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:09] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:09] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-06-03 23:38:09] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 16 ms.
[2020-06-03 23:38:09] [INFO ] Added : 97 causal constraints over 20 iterations in 368 ms. Result :sat
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:10] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-06-03 23:38:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:10] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:10] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2020-06-03 23:38:10] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 6 ms.
[2020-06-03 23:38:10] [INFO ] Added : 57 causal constraints over 12 iterations in 142 ms. Result :sat
[2020-06-03 23:38:10] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:10] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 23:38:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:10] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:10] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:38:10] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 9 ms.
[2020-06-03 23:38:11] [INFO ] Added : 63 causal constraints over 13 iterations in 195 ms. Result :sat
[2020-06-03 23:38:11] [INFO ] [Real]Absence check using 102 positive place invariants in 25 ms returned sat
[2020-06-03 23:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:11] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 23:38:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:11] [INFO ] [Nat]Absence check using 102 positive place invariants in 60 ms returned sat
[2020-06-03 23:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:11] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 23:38:11] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 8 ms.
[2020-06-03 23:38:11] [INFO ] Added : 91 causal constraints over 19 iterations in 218 ms. Result :sat
[2020-06-03 23:38:11] [INFO ] [Real]Absence check using 102 positive place invariants in 40 ms returned sat
[2020-06-03 23:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:12] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2020-06-03 23:38:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:12] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 23:38:12] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:38:12] [INFO ] Added : 44 causal constraints over 9 iterations in 107 ms. Result :sat
[2020-06-03 23:38:12] [INFO ] [Real]Absence check using 102 positive place invariants in 121 ms returned sat
[2020-06-03 23:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:12] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2020-06-03 23:38:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 23 ms returned sat
[2020-06-03 23:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:12] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2020-06-03 23:38:12] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 19 ms.
[2020-06-03 23:38:13] [INFO ] Added : 88 causal constraints over 18 iterations in 254 ms. Result :sat
[2020-06-03 23:38:13] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:13] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-06-03 23:38:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:13] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:13] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2020-06-03 23:38:13] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 7 ms.
[2020-06-03 23:38:13] [INFO ] Added : 29 causal constraints over 6 iterations in 97 ms. Result :sat
[2020-06-03 23:38:13] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2020-06-03 23:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:13] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-06-03 23:38:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:13] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2020-06-03 23:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:14] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2020-06-03 23:38:14] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints in 19 ms.
[2020-06-03 23:38:14] [INFO ] Added : 35 causal constraints over 7 iterations in 104 ms. Result :sat
[2020-06-03 23:38:14] [INFO ] Flatten gal took : 64 ms
[2020-06-03 23:38:14] [INFO ] Flatten gal took : 15 ms
[2020-06-03 23:38:14] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 23:38:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-050051 @ 3570 seconds

FORMULA n0-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ RefineWMG-PT-050051

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:38:14 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)))",
"processed_size": 136,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0))))",
"processed_size": 53,
"rewrites": 33
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 16020976,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((* R *)) : A(G(A(F(**)))) : (A(G(*)) AND A((** U **))) : (A(G(*)) AND (E(X(E(F(*)))) AND (** AND **))) : E(F((E(X(**)) AND **))) : A(G(E((* R *)))) : (E(F((E(X(**)) AND **))) OR A((** U A(G(**))))) : E(X(A(G(E(F(**)))))) : E(F(**)) : (A(G(**)) AND A(X(A(G(**))))) : E(F(**)) : (E(F(**)) OR E(F((A(G(**)) AND **)))) : E(F(A(G(**)))) : E(X(E(F(E(G(**)))))) : A(G((E(F(**)) OR (A(F(**)) OR **)))) : E(F(A(G(**))))"
},
"net":
{
"arcs": 608,
"conflict_clusters": 153,
"places": 254,
"places_significant": 152,
"singleton_clusters": 0,
"transitions": 203
},
"result":
{
"interim_value": "unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 457/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8128
lola: finding significant places
lola: 254 places, 203 transitions, 152 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: NOT(E ((((p98 <= 0) OR (1 <= p228)) U ((1 <= p190) OR (1 <= p10))))) : E (G (A (G (A (F ((1 <= p197))))))) : (A (G (NOT(A (F ((1 <= p120)))))) AND A (((1 <= p237) U ((1 <= p50) OR (1 <= p158) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p154)) OR (1 <= p137))))) : (((NOT(E (F (((1 <= p226) AND (1 <= p227) AND (1 <= p229))))) AND NOT(A (G (A (X (((1 <= p76) AND (1 <= p77) AND (1 <= p79)))))))) AND ((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0))) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p54 <= 0))) : E (F ((E (X (((1 <= p233) AND (1 <= p160)))) AND (5 <= p4)))) : A (G (NOT(A ((((1 <= p16) AND (1 <= p17) AND (1 <= p19)) U (1 <= p155)))))) : (E (F ((E (X ((1 <= p85))) AND (1 <= p188)))) OR A ((((1 <= p118) OR ((1 <= p150) AND (1 <= p58))) U A (G ((1 <= p230)))))) : E (X (A (G (E (F ((1 <= p5))))))) : E (F (((1 <= p96) AND (1 <= p97) AND (1 <= p99)))) : A (G (((p85 <= 0) AND A (X ((p20 <= 0)))))) : E (F (E (F (((1 <= p141) AND (1 <= p142) AND (1 <= p144)))))) : E (F ((((p20 <= 0) AND (p63 <= 0) AND (p122 <= 0) AND ((p191 <= 0) OR (p192 <= 0) OR (p194 <= 0))) OR (A (G ((1 <= p38))) AND ((1 <= p20) OR (1 <= p108) OR ((1 <= p63) AND (1 <= p81) AND (1 <= p82) AND (1 <= p84))))))) : E (F (A (G (((1 <= p93) OR (1 <= p33) OR ((1 <= p211) AND (1 <= p212) AND (1 <= p214))))))) : E (F (E (X (E (G (((1 <= p26) AND (1 <= p27) AND (1 <= p29)))))))) : A (G (((E (F (((p176 <= 0) OR (p177 <= 0) OR (p179 <= 0)))) OR A (F (((1 <= p156) AND (1 <= p157) AND (1 <= p159))))) OR ((1 <= p122) AND (1 <= p173) AND (p212 <= 0))))) : E (F (A (G (((p32 <= 0) OR (p28 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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:458
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:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0)))) AND (E (X (E (F (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0)))))) AND (((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p181 <= 0) OR (p182 <= 0) OR (p184 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)))
lola: processed formula length: 136
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 9 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p226 <= 0) OR (p227 <= 0) OR (p229 <= 0))))
lola: processed formula length: 53
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p226) AND (1 <= p227) AND (1 <= p229))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (((1 <= p233) AND (1 <= p160)))) AND (5 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX(((1 <= p233) AND (1 <= p160))) AND (5 <= p4)))
lola: processed formula length: 53
lola: 33 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: 969686 markings, 1463988 edges, 193937 markings/sec, 0 secs
lola: 1928359 markings, 2911401 edges, 191735 markings/sec, 5 secs
lola: 2892181 markings, 4366566 edges, 192764 markings/sec, 10 secs
lola: 3857017 markings, 5823283 edges, 192967 markings/sec, 15 secs
lola: 4818923 markings, 7275588 edges, 192381 markings/sec, 20 secs
lola: 5780207 markings, 8726920 edges, 192257 markings/sec, 25 secs
lola: 6746898 markings, 10186444 edges, 193338 markings/sec, 30 secs
lola: 7707842 markings, 11637262 edges, 192189 markings/sec, 35 secs
lola: 8649527 markings, 13059007 edges, 188337 markings/sec, 40 secs
lola: 9582781 markings, 14468089 edges, 186651 markings/sec, 45 secs
lola: 10513979 markings, 15874000 edges, 186240 markings/sec, 50 secs
lola: 11443091 markings, 17276775 edges, 185822 markings/sec, 55 secs
lola: 12373991 markings, 18682268 edges, 186180 markings/sec, 60 secs
lola: 13303952 markings, 20086312 edges, 185992 markings/sec, 65 secs
lola: 14231622 markings, 21486887 edges, 185534 markings/sec, 70 secs
lola: 15174742 markings, 22910876 edges, 188624 markings/sec, 75 secs
lola: 16121168 markings, 24339765 edges, 189285 markings/sec, 80 secs
lola: 17065862 markings, 25766050 edges, 188939 markings/sec, 85 secs
lola: 18022980 markings, 27211121 edges, 191424 markings/sec, 90 secs
lola: 18966961 markings, 28636320 edges, 188796 markings/sec, 95 secs
lola: 19907921 markings, 30056998 edges, 188192 markings/sec, 100 secs
lola: 20854555 markings, 31486220 edges, 189327 markings/sec, 105 secs
lola: 21800745 markings, 32914762 edges, 189238 markings/sec, 110 secs
lola: 22749435 markings, 34347112 edges, 189738 markings/sec, 115 secs
lola: 23690413 markings, 35767800 edges, 188196 markings/sec, 120 secs
lola: 24643497 markings, 37206787 edges, 190617 markings/sec, 125 secs
lola: 25589742 markings, 38635456 edges, 189249 markings/sec, 130 secs
lola: 26541698 markings, 40072700 edges, 190391 markings/sec, 135 secs
lola: 27480009 markings, 41489374 edges, 187662 markings/sec, 140 secs
lola: 28037815 markings, 42331535 edges, 111561 markings/sec, 145 secs
lola: 28251921 markings, 42655834 edges, 42821 markings/sec, 150 secs
lola: 28941417 markings, 43697909 edges, 137899 markings/sec, 155 secs
lola: 29343994 markings, 44303642 edges, 80515 markings/sec, 160 secs
lola: 29814677 markings, 45014284 edges, 94137 markings/sec, 165 secs
lola: 30173906 markings, 45556618 edges, 71846 markings/sec, 170 secs
lola: 30173906 markings, 45556618 edges, 0 markings/sec, 175 secs
lola: 30173906 markings, 45556618 edges, 0 markings/sec, 180 secs
lola: 30657866 markings, 46287347 edges, 96792 markings/sec, 185 secs
lola: 30657866 markings, 46287347 edges, 0 markings/sec, 190 secs
lola: 31465031 markings, 47505978 edges, 161433 markings/sec, 195 secs
lola: 31656705 markings, 47795345 edges, 38335 markings/sec, 200 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((E (X ((1 <= p85))) AND (1 <= p188)))) OR A ((((1 <= p118) OR ((1 <= p150) AND (1 <= p58))) U A (G ((1 <= p230))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (EF((EX((1 <= p85)) AND (1 <= p188))) OR A(((1 <= p118) OR ((1 <= p150) AND (1 <= p58))) U AG((1 <= p230))))
lola: processed formula length: 109
lola: 35 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 968194 markings, 1461730 edges, 193639 markings/sec, 0 secs
lola: 1947520 markings, 2940348 edges, 195865 markings/sec, 5 secs
lola: 2921240 markings, 4410452 edges, 194744 markings/sec, 10 secs
lola: 3903727 markings, 5893824 edges, 196497 markings/sec, 15 secs
lola: 4893949 markings, 7388850 edges, 198044 markings/sec, 20 secs
lola: 5885424 markings, 8885774 edges, 198295 markings/sec, 25 secs
lola: 6872117 markings, 10375484 edges, 197339 markings/sec, 30 secs
lola: 7863202 markings, 11871849 edges, 198217 markings/sec, 35 secs
lola: 8819861 markings, 13316195 edges, 191332 markings/sec, 40 secs
lola: 9786885 markings, 14776215 edges, 193405 markings/sec, 45 secs
lola: 10750795 markings, 16231560 edges, 192782 markings/sec, 50 secs
lola: 11703726 markings, 17670281 edges, 190586 markings/sec, 55 secs
lola: 12664841 markings, 19121392 edges, 192223 markings/sec, 60 secs
lola: 13642303 markings, 20597149 edges, 195492 markings/sec, 65 secs
lola: 14626261 markings, 22082754 edges, 196792 markings/sec, 70 secs
lola: 15622096 markings, 23586233 edges, 199167 markings/sec, 75 secs
lola: 16589416 markings, 25046712 edges, 193464 markings/sec, 80 secs
lola: 17572654 markings, 26531194 edges, 196648 markings/sec, 85 secs
lola: 18553162 markings, 28011590 edges, 196102 markings/sec, 90 secs
lola: 19541157 markings, 29503238 edges, 197599 markings/sec, 95 secs
lola: 20538641 markings, 31009283 edges, 199497 markings/sec, 100 secs
lola: 21512602 markings, 32479751 edges, 194792 markings/sec, 105 secs
lola: 22497608 markings, 33966939 edges, 197001 markings/sec, 110 secs
lola: 23502906 markings, 35484705 edges, 201060 markings/sec, 115 secs
lola: 24492990 markings, 36979561 edges, 198017 markings/sec, 120 secs
lola: 25471313 markings, 38456620 edges, 195665 markings/sec, 125 secs
lola: 26448484 markings, 39931971 edges, 195434 markings/sec, 130 secs
lola: 27426118 markings, 41407987 edges, 195527 markings/sec, 135 secs
lola: 28330976 markings, 42774233 edges, 180972 markings/sec, 140 secs
lola: 29119211 markings, 43964342 edges, 157647 markings/sec, 145 secs
lola: 29872300 markings, 45101459 edges, 150618 markings/sec, 150 secs
lola: 30698197 markings, 46348216 edges, 165179 markings/sec, 155 secs
lola: 31595044 markings, 47702252 edges, 179369 markings/sec, 160 secs
lola: 31650763 markings, 47786375 edges, 11144 markings/sec, 165 secs
lola: 31650763 markings, 47786375 edges, 0 markings/sec, 170 secs
lola: 31650763 markings, 47786375 edges, 0 markings/sec, 175 secs
lola: 31658387 markings, 47797898 edges, 1525 markings/sec, 180 secs
lola: 31931805 markings, 48210684 edges, 54684 markings/sec, 185 secs
lola: 31931805 markings, 48210684 edges, 0 markings/sec, 190 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 16020976 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 159104 kB
After kill :
MemTotal: 16427332 kB
MemFree: 158088 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="RefineWMG-PT-050051"
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 RefineWMG-PT-050051, 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 r186-oct2-158987938500108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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