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

About the Execution of ITS-Tools for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.950 60665.00 92702.00 145.80 TFFTFTFFFFFTFFFF 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.r021-oct2-158897699100483.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 itstools
Input is BusinessProcesses-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.5K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K 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 BusinessProcesses-PT-05-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1589250767359

[2020-05-12 02:32:50] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:32:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:32:50] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-12 02:32:50] [INFO ] Transformed 368 places.
[2020-05-12 02:32:50] [INFO ] Transformed 319 transitions.
[2020-05-12 02:32:50] [INFO ] Found NUPN structural information;
[2020-05-12 02:32:50] [INFO ] Parsed PT model containing 368 places and 319 transitions in 104 ms.
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 45 ms.
Incomplete random walk after 100000 steps, including 941 resets, run finished after 194 ms. (steps per millisecond=515 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2020-05-12 02:32:50] [INFO ] Computed 57 place invariants in 15 ms
[2020-05-12 02:32:51] [INFO ] [Real]Absence check using 41 positive place invariants in 113 ms returned sat
[2020-05-12 02:32:51] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 31 ms returned sat
[2020-05-12 02:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:32:52] [INFO ] [Real]Absence check using state equation in 1607 ms returned sat
[2020-05-12 02:32:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:32:53] [INFO ] [Nat]Absence check using 41 positive place invariants in 59 ms returned sat
[2020-05-12 02:32:53] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:32:53] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2020-05-12 02:32:53] [INFO ] Deduced a trap composed of 10 places in 151 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 11 places in 95 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 12 places in 114 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 15 places in 162 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 12 places in 85 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 18 places in 116 ms
[2020-05-12 02:32:54] [INFO ] Deduced a trap composed of 90 places in 84 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 19 places in 87 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 25 places in 111 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 92 places in 160 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 16 places in 204 ms
[2020-05-12 02:32:55] [INFO ] Deduced a trap composed of 91 places in 106 ms
[2020-05-12 02:32:56] [INFO ] Deduced a trap composed of 87 places in 827 ms
[2020-05-12 02:32:56] [INFO ] Deduced a trap composed of 19 places in 147 ms
[2020-05-12 02:32:57] [INFO ] Deduced a trap composed of 93 places in 118 ms
[2020-05-12 02:32:57] [INFO ] Deduced a trap composed of 17 places in 101 ms
[2020-05-12 02:32:57] [INFO ] Deduced a trap composed of 95 places in 438 ms
[2020-05-12 02:32:57] [INFO ] Deduced a trap composed of 94 places in 101 ms
[2020-05-12 02:32:57] [INFO ] Deduced a trap composed of 88 places in 69 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 93 places in 209 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 92 places in 78 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 86 places in 260 ms
[2020-05-12 02:32:58] [INFO ] Deduced a trap composed of 94 places in 71 ms
[2020-05-12 02:32:59] [INFO ] Deduced a trap composed of 88 places in 84 ms
[2020-05-12 02:32:59] [INFO ] Deduced a trap composed of 92 places in 289 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 93 places in 797 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 18 places in 108 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 25 places in 316 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 27 places in 86 ms
[2020-05-12 02:33:00] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 36 places in 73 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 29 places in 85 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 95 places in 86 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 90 places in 97 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 102 places in 76 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 90 places in 71 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 97 places in 70 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 87 places in 94 ms
[2020-05-12 02:33:01] [INFO ] Deduced a trap composed of 90 places in 84 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 84 places in 83 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 40 places in 85 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 27 places in 81 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 99 places in 80 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 95 places in 92 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 92 places in 96 ms
[2020-05-12 02:33:02] [INFO ] Deduced a trap composed of 94 places in 148 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 98 places in 79 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 97 places in 79 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 94 places in 79 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 95 places in 77 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 105 places in 76 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 94 places in 74 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 95 places in 94 ms
[2020-05-12 02:33:03] [INFO ] Deduced a trap composed of 93 places in 62 ms
[2020-05-12 02:33:03] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 9994 ms
[2020-05-12 02:33:03] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 11 ms.
[2020-05-12 02:33:04] [INFO ] Added : 179 causal constraints over 36 iterations in 1184 ms. Result :sat
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 88 places in 87 ms
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 93 places in 75 ms
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 97 places in 94 ms
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 92 places in 72 ms
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 90 places in 73 ms
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 89 places in 81 ms
[2020-05-12 02:33:05] [INFO ] Deduced a trap composed of 91 places in 70 ms
[2020-05-12 02:33:06] [INFO ] Deduced a trap composed of 91 places in 266 ms
[2020-05-12 02:33:06] [INFO ] Deduced a trap composed of 90 places in 175 ms
[2020-05-12 02:33:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1453 ms
[2020-05-12 02:33:06] [INFO ] [Real]Absence check using 41 positive place invariants in 130 ms returned sat
[2020-05-12 02:33:06] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2020-05-12 02:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:07] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2020-05-12 02:33:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:07] [INFO ] [Nat]Absence check using 41 positive place invariants in 196 ms returned sat
[2020-05-12 02:33:07] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 11 ms returned sat
[2020-05-12 02:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:07] [INFO ] [Nat]Absence check using state equation in 182 ms returned unsat
[2020-05-12 02:33:07] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2020-05-12 02:33:07] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2020-05-12 02:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:08] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2020-05-12 02:33:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 55 ms returned sat
[2020-05-12 02:33:08] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2020-05-12 02:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:08] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 13 places in 110 ms
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2020-05-12 02:33:08] [INFO ] Deduced a trap composed of 15 places in 113 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 8 places in 526 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2020-05-12 02:33:09] [INFO ] Deduced a trap composed of 20 places in 98 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 87 places in 76 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 23 places in 79 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 18 places in 80 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 26 places in 92 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 92 places in 106 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 35 places in 90 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 82 places in 91 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 27 places in 80 ms
[2020-05-12 02:33:10] [INFO ] Deduced a trap composed of 33 places in 94 ms
[2020-05-12 02:33:11] [INFO ] Deduced a trap composed of 90 places in 885 ms
[2020-05-12 02:33:11] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-05-12 02:33:12] [INFO ] Deduced a trap composed of 15 places in 984 ms
[2020-05-12 02:33:14] [INFO ] Deduced a trap composed of 29 places in 1746 ms
[2020-05-12 02:33:14] [INFO ] Deduced a trap composed of 40 places in 108 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 99 places in 188 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 12 places in 138 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 96 places in 78 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 95 places in 75 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 90 places in 92 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 97 places in 80 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 102 places in 89 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 94 places in 77 ms
[2020-05-12 02:33:15] [INFO ] Deduced a trap composed of 90 places in 105 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 94 places in 90 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 94 places in 89 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 91 places in 82 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 95 places in 79 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 16 places in 102 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 92 places in 96 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 11 places in 153 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2020-05-12 02:33:16] [INFO ] Deduced a trap composed of 92 places in 77 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 92 places in 85 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 86 places in 99 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 91 places in 80 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 90 places in 88 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 92 places in 76 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 89 places in 95 ms
[2020-05-12 02:33:17] [INFO ] Deduced a trap composed of 93 places in 88 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-05-12 02:33:18] [INFO ] Deduced a trap composed of 90 places in 268 ms
[2020-05-12 02:33:19] [INFO ] Deduced a trap composed of 91 places in 1076 ms
[2020-05-12 02:33:21] [INFO ] Deduced a trap composed of 93 places in 2477 ms
[2020-05-12 02:33:22] [INFO ] Deduced a trap composed of 93 places in 113 ms
[2020-05-12 02:33:22] [INFO ] Deduced a trap composed of 25 places in 796 ms
[2020-05-12 02:33:22] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 14377 ms
[2020-05-12 02:33:22] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2020-05-12 02:33:24] [INFO ] Added : 198 causal constraints over 40 iterations in 1214 ms. Result :sat
[2020-05-12 02:33:25] [INFO ] Deduced a trap composed of 91 places in 926 ms
[2020-05-12 02:33:27] [INFO ] Deduced a trap composed of 99 places in 2020 ms
[2020-05-12 02:33:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3101 ms
[2020-05-12 02:33:27] [INFO ] [Real]Absence check using 41 positive place invariants in 313 ms returned sat
[2020-05-12 02:33:27] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 54 ms returned sat
[2020-05-12 02:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:27] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2020-05-12 02:33:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:28] [INFO ] [Nat]Absence check using 41 positive place invariants in 251 ms returned sat
[2020-05-12 02:33:28] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 66 ms returned sat
[2020-05-12 02:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:29] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2020-05-12 02:33:30] [INFO ] Deduced a trap composed of 16 places in 683 ms
[2020-05-12 02:33:30] [INFO ] Deduced a trap composed of 93 places in 192 ms
[2020-05-12 02:33:32] [INFO ] Deduced a trap composed of 10 places in 1804 ms
[2020-05-12 02:33:32] [INFO ] Deduced a trap composed of 26 places in 180 ms
[2020-05-12 02:33:32] [INFO ] Deduced a trap composed of 19 places in 113 ms
[2020-05-12 02:33:32] [INFO ] Deduced a trap composed of 8 places in 185 ms
[2020-05-12 02:33:32] [INFO ] Deduced a trap composed of 28 places in 141 ms
[2020-05-12 02:33:33] [INFO ] Deduced a trap composed of 18 places in 161 ms
[2020-05-12 02:33:33] [INFO ] Deduced a trap composed of 24 places in 644 ms
[2020-05-12 02:33:33] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 27 places in 172 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 95 places in 122 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 92 places in 65 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 20 places in 37 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 31 places in 36 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 25 places in 67 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 29 places in 39 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-05-12 02:33:34] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-05-12 02:33:34] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5271 ms
[2020-05-12 02:33:34] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 21 ms.
[2020-05-12 02:33:35] [INFO ] Added : 182 causal constraints over 37 iterations in 759 ms. Result :sat
[2020-05-12 02:33:35] [INFO ] [Real]Absence check using 41 positive place invariants in 238 ms returned sat
[2020-05-12 02:33:35] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 104 ms returned sat
[2020-05-12 02:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:33:36] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2020-05-12 02:33:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:33:36] [INFO ] [Nat]Absence check using 41 positive place invariants in 54 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-12 02:33:36] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-12 02:33:36] [INFO ] Flatten gal took : 76 ms
[2020-05-12 02:33:36] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-05-12 02:33:36] [INFO ] Flatten gal took : 17 ms
FORMULA BusinessProcesses-PT-05-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:33:36] [INFO ] Applying decomposition
[2020-05-12 02:33:36] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph813866466898741462.txt, -o, /tmp/graph813866466898741462.bin, -w, /tmp/graph813866466898741462.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph813866466898741462.bin, -l, -1, -v, -w, /tmp/graph813866466898741462.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:33:36] [INFO ] Decomposing Gal with order
[2020-05-12 02:33:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:33:36] [INFO ] Removed a total of 70 redundant transitions.
[2020-05-12 02:33:37] [INFO ] Flatten gal took : 88 ms
[2020-05-12 02:33:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2020-05-12 02:33:37] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 17 ms
[2020-05-12 02:33:37] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
built 56 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 49 ordering constraints for composite.
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 18 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.38391e+17,0.221603,14896,2025,24,18773,431,767,40873,49,693,0


Converting to forward existential form...Done !
original formula: EF(((i7.i0.u62.p155==1)&&((i16.u146.p354==0)||(i6.i1.u78.p194==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((i7.i0.u62.p155==1)&&((i16.u146.p354==0)||(i6.i1.u78.p194==1))))] != FALSE
(forward)formula 0,1,0.226117,15216,1,0,18773,431,782,40873,56,693,1263
FORMULA BusinessProcesses-PT-05-CTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: (AG(((((((i7.i4.u76.p189==0)||(i10.i1.u19.p47==1))||(i16.u146.p354==0))||(i16.u119.p298==1))||(i11.i2.u86.p212==0))||(i12.i1.u87.p218==1))) * AX((i11.i1.u52.p134!=1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((((((i7.i4.u76.p189==0)||(i10.i1.u19.p47==1))||(i16.u146.p354==0))||(i16.u119.p298==1))||(i11.i2.u86.p212==0))||(i12.i1.u87.p218==1))))] = FALSE * [(EY(Init) * !((i11.i1.u52.p134!=1)))] = FALSE)
(forward)formula 1,0,0.233819,15216,1,0,18773,431,1093,40873,67,693,4393
FORMULA BusinessProcesses-PT-05-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: E(AX(((i8.i0.u12.p31==0)||(i0.i1.u41.p101==1))) U EF((i8.i0.u10.p25==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(EX(!(((i8.i0.u12.p31==0)||(i0.i1.u41.p101==1)))))),TRUE) * (i8.i0.u10.p25==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t182, t244, t256, i0.i0.u42.t197, i0.i1.u40.t201, i1.i0.t250, i1.i0.u8.t264, i1.i0.u14.t253, i1.i1.t255, i1.i1.u15.t251, i2.t62, i2.u115.t66, i3.t233, i3.t231, i3.t229, i3.u27.t227, i3.u28.t225, i4.i0.t217, i4.i0.u31.t219, i4.i2.t116, i4.i2.u94.t117, i4.i3.t112, i4.i3.u95.t113, i5.i1.t108, i5.i1.u97.t109, i5.i2.t104, i5.i2.u100.t105, i5.i3.t100, i5.i3.u101.t101, i5.i4.t96, i5.i4.u103.t97, i6.i1.t148, i6.i1.u78.t149, i6.i2.t140, i6.i2.u81.t141, i6.i3.t136, i6.i3.u83.t137, i7.i1.t172, i7.i1.u65.t173, i7.i2.t168, i7.i2.u68.t169, i7.i3.t160, i7.i3.u72.t161, i7.i4.t152, i7.i4.u76.t153, i8.i0.t259, i8.i0.u10.t261, i8.i1.t175, i8.i1.u63.t176, i9.i0.t247, i9.i0.u16.t249, i9.i1.t164, i9.i1.u69.t165, i9.i2.t156, i9.i2.u73.t157, i10.i0.u20.t241, i10.i0.u22.t237, i10.i1.t243, i10.i1.u21.t239, i10.i2.t144, i10.i2.u79.t145, i11.i0.u48.t185, i11.i0.u50.t181, i11.i2.t132, i11.i2.u86.t133, i12.i0.u29.t223, i12.i1.t128, i12.i1.u87.t129, i13.i0.t211, i13.i0.u34.t213, i13.i1.t120, i13.i1.u92.t121, i14.i0.t205, i14.i0.u37.t207, i14.i1.t124, i14.i1.u90.t125, i14.i2.t92, i14.i2.u106.t93, i15.u44.t193, i15.u46.t189, i16.t76, i16.t74, i16.t71, i16.t69, i16.t64, i16.t60, i16.t58, i16.t53, i16.t49, i16.t40, i16.t36, i16.t33, i16.t31, i16.t28, i16.t26, i16.t23, i16.t21, i16.t18, i16.t15, i16.t12, i16.t9, i16.t6, i16.t3, i16.u107.t1, i17.t51, i17.u121.t55, i18.t44, i18.t42, i18.t38, i18.u126.t46, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/208/110/318
(forward)formula 2,1,9.62909,292680,1,0,585265,472,4858,864044,245,1122,1015639
FORMULA BusinessProcesses-PT-05-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AG(((((i16.u118.p296==0)||(i10.i2.u79.p198==1))||(i15.u44.p109==0))||(i17.u121.p301==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i16.u118.p296==0)||(i10.i2.u79.p198==1))||(i15.u44.p109==0))||(i17.u121.p301==1))))] = FALSE
(forward)formula 3,0,9.63405,293208,1,0,585641,472,4870,864482,245,1122,1016968
FORMULA BusinessProcesses-PT-05-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(((i16.u119.p297==0)||(i0.i1.u41.p101==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((i16.u119.p297==0)||(i0.i1.u41.p101==1))))] = FALSE
(forward)formula 4,0,9.63717,293208,1,0,585956,472,4874,864859,245,1122,1017814
FORMULA BusinessProcesses-PT-05-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG((((((i1.i0.u8.p19==0)||(i3.u28.p68==1))&&((i9.i2.u73.p184==0)||(i16.u122.p304==1)))&&((i18.u130.p322==0)||(i16.u109.p276==1)))&&((i11.i2.u86.p213==0)||(i16.u148.p358==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((((i1.i0.u8.p19==0)||(i3.u28.p68==1))&&((i9.i2.u73.p184==0)||(i16.u122.p304==1)))&&((i18.u130.p322==0)||(i16.u109.p276==1)))&&((i11.i2.u86.p213==0)||(i16.u148.p358==1)))))] = FALSE
(forward)formula 5,0,9.64855,293736,1,0,587698,472,4906,866573,245,1122,1020997
FORMULA BusinessProcesses-PT-05-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
(forward)formula 6,0,9.77495,299808,1,0,596937,473,4910,910287,245,1126,1029604
FORMULA BusinessProcesses-PT-05-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: !(AG((((i1.i0.u8.p19==1)||(i16.u144.p350==0))||(i3.u28.p69==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((((i1.i0.u8.p19==1)||(i16.u144.p350==0))||(i3.u28.p69==1))))] != FALSE
(forward)formula 7,1,9.78618,300336,1,0,597225,473,4918,910718,245,1126,1030705
FORMULA BusinessProcesses-PT-05-CTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: A(EF(((i15.u47.p120==0)||(i4.i0.u33.p82==1))) U AG(((i18.u130.p321==0)||(i0.i0.u145.p352==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(((i18.u130.p321==0)||(i0.i0.u145.p352==1))))))))) * !(E(!(!(E(TRUE U !(((i18.u130.p321==0)||(i0.i0.u145.p352==1)))))) U (!(E(TRUE U ((i15.u47.p120==0)||(i4.i0.u33.p82==1)))) * !(!(E(TRUE U !(((i18.u130.p321==0)||(i0.i0.u145.p352==1))))))))))] != FALSE
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 8,0,10.5374,322248,1,0,638250,756,5965,1.01118e+06,292,1428,1110713
FORMULA BusinessProcesses-PT-05-CTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1589250828024

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-05, 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 r021-oct2-158897699100483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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