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

About the Execution of ITS-LoLa for BusinessProcesses-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.890 3600000.00 3655732.00 802.70 F???FF?TFTFTT?TT 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.r182-oct2-158987914000516.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 BusinessProcesses-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:44 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.2K 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 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 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 104K 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-09-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591160434657

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:00:36] [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 05:00:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:00:36] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2020-06-03 05:00:36] [INFO ] Transformed 403 places.
[2020-06-03 05:00:36] [INFO ] Transformed 374 transitions.
[2020-06-03 05:00:36] [INFO ] Found NUPN structural information;
[2020-06-03 05:00:36] [INFO ] Parsed PT model containing 403 places and 374 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Incomplete random walk after 100000 steps, including 1042 resets, run finished after 272 ms. (steps per millisecond=367 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 374 rows 403 cols
[2020-06-03 05:00:37] [INFO ] Computed 65 place invariants in 17 ms
[2020-06-03 05:00:37] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-06-03 05:00:37] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2020-06-03 05:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:00:38] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2020-06-03 05:00:38] [INFO ] Deduced a trap composed of 105 places in 289 ms
[2020-06-03 05:00:38] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 05:00:38] [INFO ] Deduced a trap composed of 11 places in 141 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 97 places in 199 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 86 places in 114 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 18 places in 96 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 92 places in 131 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2020-06-03 05:00:39] [INFO ] Deduced a trap composed of 93 places in 81 ms
[2020-06-03 05:00:40] [INFO ] Deduced a trap composed of 26 places in 127 ms
[2020-06-03 05:00:40] [INFO ] Deduced a trap composed of 45 places in 48 ms
[2020-06-03 05:00:40] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2020-06-03 05:00:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2061 ms
[2020-06-03 05:00:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:00:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 05:00:40] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-06-03 05:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:00:40] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2020-06-03 05:00:40] [INFO ] Deduced a trap composed of 11 places in 188 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 90 places in 144 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 96 places in 88 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 91 places in 108 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 20 places in 121 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 92 places in 87 ms
[2020-06-03 05:00:41] [INFO ] Deduced a trap composed of 87 places in 135 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 36 places in 89 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 90 places in 134 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 96 places in 103 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 21 places in 79 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 21 places in 113 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 94 places in 84 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 90 places in 90 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 26 places in 90 ms
[2020-06-03 05:00:42] [INFO ] Deduced a trap composed of 20 places in 27 ms
[2020-06-03 05:00:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2353 ms
[2020-06-03 05:00:42] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 16 ms.
[2020-06-03 05:00:44] [INFO ] Added : 225 causal constraints over 46 iterations in 1416 ms. Result :sat
[2020-06-03 05:00:44] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned sat
[2020-06-03 05:00:44] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 14 ms returned sat
[2020-06-03 05:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:00:44] [INFO ] [Real]Absence check using state equation in 259 ms returned unsat
[2020-06-03 05:00:44] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2020-06-03 05:00:44] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2020-06-03 05:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using state equation in 262 ms returned unsat
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-06-03 05:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using state equation in 272 ms returned unsat
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned unsat
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned sat
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2020-06-03 05:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:00:45] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 11 places in 94 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 40 places in 90 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 56 places in 119 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 89 places in 89 ms
[2020-06-03 05:00:46] [INFO ] Deduced a trap composed of 97 places in 98 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 16 places in 108 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 101 places in 90 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 32 places in 84 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 57 places in 263 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 92 places in 82 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 27 places in 97 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 62 places in 95 ms
[2020-06-03 05:00:47] [INFO ] Deduced a trap composed of 106 places in 85 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 28 places in 77 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 105 places in 92 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 94 places in 81 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 91 places in 80 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 100 places in 86 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 92 places in 90 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 49 places in 89 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 50 places in 146 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 50 places in 79 ms
[2020-06-03 05:00:48] [INFO ] Deduced a trap composed of 85 places in 82 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 95 places in 97 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 84 places in 94 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 96 places in 85 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 90 places in 193 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 89 places in 82 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 92 places in 88 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 92 places in 110 ms
[2020-06-03 05:00:49] [INFO ] Deduced a trap composed of 84 places in 80 ms
[2020-06-03 05:00:50] [INFO ] Deduced a trap composed of 95 places in 82 ms
[2020-06-03 05:00:50] [INFO ] Deduced a trap composed of 109 places in 91 ms
[2020-06-03 05:00:50] [INFO ] Deduced a trap composed of 99 places in 83 ms
[2020-06-03 05:00:50] [INFO ] Deduced a trap composed of 95 places in 80 ms
[2020-06-03 05:00:50] [INFO ] Deduced a trap composed of 97 places in 379 ms
[2020-06-03 05:00:50] [INFO ] Deduced a trap composed of 88 places in 131 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 93 places in 87 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 94 places in 84 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 98 places in 81 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 92 places in 84 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 94 places in 88 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 100 places in 84 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 94 places in 81 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 91 places in 91 ms
[2020-06-03 05:00:51] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 93 places in 85 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 104 places in 82 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 106 places in 88 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 104 places in 88 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 96 places in 93 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 87 places in 75 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 92 places in 75 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 90 places in 82 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 91 places in 79 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 91 places in 80 ms
[2020-06-03 05:00:52] [INFO ] Deduced a trap composed of 94 places in 89 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 98 places in 82 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 87 places in 85 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 87 places in 83 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 90 places in 79 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 104 places in 82 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 102 places in 91 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 101 places in 112 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 98 places in 82 ms
[2020-06-03 05:00:53] [INFO ] Deduced a trap composed of 104 places in 92 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 90 places in 93 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 102 places in 155 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 104 places in 77 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 103 places in 75 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 91 places in 73 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 93 places in 72 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 87 places in 107 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 89 places in 79 ms
[2020-06-03 05:00:54] [INFO ] Deduced a trap composed of 92 places in 97 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 95 places in 84 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 98 places in 90 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 105 places in 90 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 102 places in 84 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 97 places in 88 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 104 places in 87 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 84 places in 193 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 87 places in 74 ms
[2020-06-03 05:00:55] [INFO ] Deduced a trap composed of 100 places in 78 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 98 places in 76 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 89 places in 73 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 102 places in 82 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 99 places in 77 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 89 places in 73 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 91 places in 75 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 102 places in 75 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 110 places in 82 ms
[2020-06-03 05:00:56] [INFO ] Deduced a trap composed of 102 places in 80 ms
[2020-06-03 05:00:57] [INFO ] Deduced a trap composed of 112 places in 79 ms
[2020-06-03 05:00:57] [INFO ] Deduced a trap composed of 104 places in 144 ms
[2020-06-03 05:00:57] [INFO ] Deduced a trap composed of 106 places in 79 ms
[2020-06-03 05:00:57] [INFO ] Deduced a trap composed of 105 places in 91 ms
[2020-06-03 05:00:57] [INFO ] Deduced a trap composed of 96 places in 75 ms
[2020-06-03 05:00:57] [INFO ] Deduced a trap composed of 101 places in 87 ms
[2020-06-03 05:00:58] [INFO ] Deduced a trap composed of 100 places in 1014 ms
[2020-06-03 05:00:58] [INFO ] Deduced a trap composed of 106 places in 94 ms
[2020-06-03 05:00:58] [INFO ] Deduced a trap composed of 94 places in 88 ms
[2020-06-03 05:00:58] [INFO ] Deduced a trap composed of 97 places in 77 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 99 places in 78 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 92 places in 78 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 97 places in 81 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 92 places in 79 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 103 places in 75 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 89 places in 73 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 109 places in 93 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 97 places in 87 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 104 places in 87 ms
[2020-06-03 05:00:59] [INFO ] Deduced a trap composed of 97 places in 87 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 103 places in 93 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 101 places in 89 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 109 places in 87 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 96 places in 77 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 11 places in 83 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 95 places in 83 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 110 places in 80 ms
[2020-06-03 05:01:00] [INFO ] Deduced a trap composed of 36 places in 79 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 92 places in 79 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 96 places in 141 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 102 places in 78 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 103 places in 81 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 95 places in 78 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 95 places in 72 ms
[2020-06-03 05:01:01] [INFO ] Deduced a trap composed of 111 places in 87 ms
[2020-06-03 05:01:02] [INFO ] Deduced a trap composed of 105 places in 200 ms
[2020-06-03 05:01:02] [INFO ] Deduced a trap composed of 116 places in 174 ms
[2020-06-03 05:01:02] [INFO ] Deduced a trap composed of 92 places in 212 ms
[2020-06-03 05:01:02] [INFO ] Deduced a trap composed of 100 places in 188 ms
[2020-06-03 05:01:02] [INFO ] Deduced a trap composed of 93 places in 186 ms
[2020-06-03 05:01:03] [INFO ] Deduced a trap composed of 98 places in 789 ms
[2020-06-03 05:01:04] [INFO ] Deduced a trap composed of 100 places in 518 ms
[2020-06-03 05:01:04] [INFO ] Deduced a trap composed of 106 places in 79 ms
[2020-06-03 05:01:04] [INFO ] Deduced a trap composed of 98 places in 75 ms
[2020-06-03 05:01:04] [INFO ] Deduced a trap composed of 91 places in 76 ms
[2020-06-03 05:01:04] [INFO ] Deduced a trap composed of 107 places in 76 ms
[2020-06-03 05:01:05] [INFO ] Deduced a trap composed of 94 places in 502 ms
[2020-06-03 05:01:05] [INFO ] Deduced a trap composed of 96 places in 130 ms
[2020-06-03 05:01:05] [INFO ] Deduced a trap composed of 108 places in 204 ms
[2020-06-03 05:01:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s24 s25 s28 s33 s34 s35 s48 s49 s50 s59 s60 s61 s62 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s80 s84 s86 s89 s92 s105 s114 s123 s135 s136 s137 s153 s154 s155 s159 s160 s161 s194 s203 s205 s223 s225 s234 s239 s244 s249 s254 s259 s264 s269 s274 s278 s279 s280 s281 s282 s283 s284 s288 s289 s290 s291 s292 s293 s294 s295 s296 s304 s305 s308 s309 s310 s311 s312 s326 s339 s340 s341 s346 s347 s350 s351 s352 s353 s356 s357 s368 s370 s371 s388) 0)") while checking expression at index 5
[2020-06-03 05:01:05] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2020-06-03 05:01:05] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 3 ms returned unsat
[2020-06-03 05:01:05] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2020-06-03 05:01:05] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2020-06-03 05:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:01:05] [INFO ] [Real]Absence check using state equation in 310 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 05:01:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 05:01:06] [INFO ] Flatten gal took : 82 ms
[2020-06-03 05:01:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 05:01:06] [INFO ] Flatten gal took : 21 ms
FORMULA BusinessProcesses-PT-09-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:01:06] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 05:01:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ BusinessProcesses-PT-09 @ 3570 seconds

FORMULA BusinessProcesses-PT-09-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-09-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 1977040 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16136276 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="BusinessProcesses-PT-09"
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 BusinessProcesses-PT-09, 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 r182-oct2-158987914000516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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