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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15789.030 3600000.00 3690382.00 748.50 TFFFTF?FFFT?TTTF 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-158987914100585.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-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:46 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.3K Apr 8 14:44 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:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 177K 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-18-00
FORMULA_NAME BusinessProcesses-PT-18-01
FORMULA_NAME BusinessProcesses-PT-18-02
FORMULA_NAME BusinessProcesses-PT-18-03
FORMULA_NAME BusinessProcesses-PT-18-04
FORMULA_NAME BusinessProcesses-PT-18-05
FORMULA_NAME BusinessProcesses-PT-18-06
FORMULA_NAME BusinessProcesses-PT-18-07
FORMULA_NAME BusinessProcesses-PT-18-08
FORMULA_NAME BusinessProcesses-PT-18-09
FORMULA_NAME BusinessProcesses-PT-18-10
FORMULA_NAME BusinessProcesses-PT-18-11
FORMULA_NAME BusinessProcesses-PT-18-12
FORMULA_NAME BusinessProcesses-PT-18-13
FORMULA_NAME BusinessProcesses-PT-18-14
FORMULA_NAME BusinessProcesses-PT-18-15

=== Now, execution of the tool begins

BK_START 1591165989236

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:33:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:33:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:33:11] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-06-03 06:33:11] [INFO ] Transformed 717 places.
[2020-06-03 06:33:11] [INFO ] Transformed 642 transitions.
[2020-06-03 06:33:11] [INFO ] Found NUPN structural information;
[2020-06-03 06:33:11] [INFO ] Parsed PT model containing 717 places and 642 transitions in 108 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 526 resets, run finished after 260 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1]
// Phase 1: matrix 627 rows 702 cols
[2020-06-03 06:33:11] [INFO ] Computed 114 place invariants in 24 ms
[2020-06-03 06:33:12] [INFO ] [Real]Absence check using 73 positive place invariants in 58 ms returned sat
[2020-06-03 06:33:12] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:13] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2020-06-03 06:33:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:13] [INFO ] [Nat]Absence check using 73 positive place invariants in 24 ms returned unsat
[2020-06-03 06:33:13] [INFO ] [Real]Absence check using 73 positive place invariants in 46 ms returned sat
[2020-06-03 06:33:13] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:14] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2020-06-03 06:33:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:14] [INFO ] [Nat]Absence check using 73 positive place invariants in 61 ms returned sat
[2020-06-03 06:33:14] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 20 ms returned unsat
[2020-06-03 06:33:14] [INFO ] [Real]Absence check using 73 positive place invariants in 46 ms returned sat
[2020-06-03 06:33:14] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 27 ms returned sat
[2020-06-03 06:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:15] [INFO ] [Real]Absence check using state equation in 923 ms returned sat
[2020-06-03 06:33:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:15] [INFO ] [Nat]Absence check using 73 positive place invariants in 56 ms returned sat
[2020-06-03 06:33:15] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 29 ms returned sat
[2020-06-03 06:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:16] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2020-06-03 06:33:16] [INFO ] Deduced a trap composed of 24 places in 156 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 13 places in 113 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 14 places in 111 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 23 places in 112 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 42 places in 99 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 11 places in 107 ms
[2020-06-03 06:33:17] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 35 places in 98 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 32 places in 106 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 54 places in 101 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 21 places in 103 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 26 places in 98 ms
[2020-06-03 06:33:18] [INFO ] Deduced a trap composed of 49 places in 103 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 59 places in 102 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 32 places in 101 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 52 places in 87 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 44 places in 82 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 51 places in 86 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 31 places in 83 ms
[2020-06-03 06:33:19] [INFO ] Deduced a trap composed of 61 places in 84 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 35 places in 75 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 74 places in 75 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 58 places in 73 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 69 places in 73 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 61 places in 71 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 71 places in 76 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 71 places in 78 ms
[2020-06-03 06:33:20] [INFO ] Deduced a trap composed of 43 places in 40 ms
[2020-06-03 06:33:20] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4227 ms
[2020-06-03 06:33:20] [INFO ] Computed and/alt/rep : 626/2907/626 causal constraints in 29 ms.
[2020-06-03 06:33:26] [INFO ] Added : 466 causal constraints over 94 iterations in 6039 ms. Result :sat
[2020-06-03 06:33:27] [INFO ] [Real]Absence check using 73 positive place invariants in 46 ms returned sat
[2020-06-03 06:33:27] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:28] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2020-06-03 06:33:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:28] [INFO ] [Nat]Absence check using 73 positive place invariants in 20 ms returned unsat
[2020-06-03 06:33:28] [INFO ] [Real]Absence check using 73 positive place invariants in 247 ms returned sat
[2020-06-03 06:33:28] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 51 ms returned sat
[2020-06-03 06:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:30] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 8 places in 289 ms
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 15 places in 418 ms
[2020-06-03 06:33:31] [INFO ] Deduced a trap composed of 15 places in 297 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 35 places in 301 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 32 places in 296 ms
[2020-06-03 06:33:32] [INFO ] Deduced a trap composed of 23 places in 265 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 17 places in 264 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 25 places in 254 ms
[2020-06-03 06:33:33] [INFO ] Deduced a trap composed of 22 places in 238 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 56 places in 257 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 59 places in 135 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 57 places in 249 ms
[2020-06-03 06:33:34] [INFO ] Deduced a trap composed of 54 places in 240 ms
[2020-06-03 06:33:35] [INFO ] Deduced a trap composed of 52 places in 263 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 24 places in 1064 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 63 places in 99 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 64 places in 80 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 54 places in 84 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 56 places in 214 ms
[2020-06-03 06:33:36] [INFO ] Deduced a trap composed of 64 places in 159 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 65 places in 4296 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 25 places in 100 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 34 places in 183 ms
[2020-06-03 06:33:41] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2020-06-03 06:33:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 11054 ms
[2020-06-03 06:33:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:42] [INFO ] [Nat]Absence check using 73 positive place invariants in 628 ms returned sat
[2020-06-03 06:33:42] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 50 ms returned sat
[2020-06-03 06:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:44] [INFO ] [Nat]Absence check using state equation in 1551 ms returned sat
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 19 places in 284 ms
[2020-06-03 06:33:44] [INFO ] Deduced a trap composed of 13 places in 118 ms
[2020-06-03 06:33:45] [INFO ] Deduced a trap composed of 24 places in 1249 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 11 places in 2224 ms
[2020-06-03 06:33:48] [INFO ] Deduced a trap composed of 15 places in 677 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 29 places in 224 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 23 places in 92 ms
[2020-06-03 06:33:49] [INFO ] Deduced a trap composed of 16 places in 217 ms
[2020-06-03 06:33:50] [INFO ] Deduced a trap composed of 31 places in 1396 ms
[2020-06-03 06:33:52] [INFO ] Deduced a trap composed of 71 places in 1619 ms
[2020-06-03 06:33:54] [INFO ] Deduced a trap composed of 69 places in 2370 ms
[2020-06-03 06:33:55] [INFO ] Deduced a trap composed of 73 places in 213 ms
[2020-06-03 06:33:55] [INFO ] Deduced a trap composed of 63 places in 183 ms
[2020-06-03 06:33:55] [INFO ] Deduced a trap composed of 65 places in 190 ms
[2020-06-03 06:33:55] [INFO ] Deduced a trap composed of 35 places in 181 ms
[2020-06-03 06:33:56] [INFO ] Deduced a trap composed of 50 places in 535 ms
[2020-06-03 06:33:56] [INFO ] Deduced a trap composed of 55 places in 183 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 22 places in 1214 ms
[2020-06-03 06:33:57] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 34 places in 104 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 44 places in 103 ms
[2020-06-03 06:33:58] [INFO ] Deduced a trap composed of 43 places in 93 ms
[2020-06-03 06:33:58] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 14237 ms
[2020-06-03 06:33:58] [INFO ] Computed and/alt/rep : 626/2907/626 causal constraints in 33 ms.
[2020-06-03 06:34:01] [INFO ] Added : 365 causal constraints over 73 iterations in 3472 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:34:02] [INFO ] [Real]Absence check using 73 positive place invariants in 84 ms returned sat
[2020-06-03 06:34:02] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 35 ms returned sat
[2020-06-03 06:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:03] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2020-06-03 06:34:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:03] [INFO ] [Nat]Absence check using 73 positive place invariants in 21 ms returned unsat
[2020-06-03 06:34:03] [INFO ] [Real]Absence check using 73 positive place invariants in 78 ms returned sat
[2020-06-03 06:34:03] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 44 ms returned sat
[2020-06-03 06:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:05] [INFO ] [Real]Absence check using state equation in 1924 ms returned sat
[2020-06-03 06:34:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:05] [INFO ] [Nat]Absence check using 73 positive place invariants in 20 ms returned unsat
[2020-06-03 06:34:05] [INFO ] [Real]Absence check using 73 positive place invariants in 46 ms returned sat
[2020-06-03 06:34:05] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 26 ms returned sat
[2020-06-03 06:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:06] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2020-06-03 06:34:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:06] [INFO ] [Nat]Absence check using 73 positive place invariants in 101 ms returned sat
[2020-06-03 06:34:07] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 39 ms returned sat
[2020-06-03 06:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:11] [INFO ] [Nat]Absence check using state equation in 4567 ms returned sat
[2020-06-03 06:34:11] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-06-03 06:34:11] [INFO ] Deduced a trap composed of 8 places in 140 ms
[2020-06-03 06:34:12] [INFO ] Deduced a trap composed of 8 places in 256 ms
[2020-06-03 06:34:12] [INFO ] Deduced a trap composed of 15 places in 148 ms
[2020-06-03 06:34:12] [INFO ] Deduced a trap composed of 23 places in 138 ms
[2020-06-03 06:34:12] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-06-03 06:34:12] [INFO ] Deduced a trap composed of 24 places in 124 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 38 places in 119 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 34 places in 110 ms
[2020-06-03 06:34:13] [INFO ] Deduced a trap composed of 37 places in 477 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 36 places in 91 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 34 places in 616 ms
[2020-06-03 06:34:14] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2020-06-03 06:34:14] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3223 ms
[2020-06-03 06:34:14] [INFO ] Computed and/alt/rep : 626/2907/626 causal constraints in 31 ms.
[2020-06-03 06:34:18] [INFO ] Added : 288 causal constraints over 58 iterations in 3717 ms. Result :sat
[2020-06-03 06:34:18] [INFO ] [Real]Absence check using 73 positive place invariants in 187 ms returned sat
[2020-06-03 06:34:19] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 75 ms returned sat
[2020-06-03 06:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:21] [INFO ] [Real]Absence check using state equation in 2395 ms returned sat
[2020-06-03 06:34:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:21] [INFO ] [Nat]Absence check using 73 positive place invariants in 253 ms returned sat
[2020-06-03 06:34:21] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 150 ms returned sat
[2020-06-03 06:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:24] [INFO ] [Nat]Absence check using state equation in 2495 ms returned sat
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 8 places in 1916 ms
[2020-06-03 06:34:26] [INFO ] Deduced a trap composed of 14 places in 273 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 12 places in 271 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 19 places in 267 ms
[2020-06-03 06:34:27] [INFO ] Deduced a trap composed of 23 places in 139 ms
[2020-06-03 06:34:31] [INFO ] Deduced a trap composed of 29 places in 4057 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 25 places in 948 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 29 places in 106 ms
[2020-06-03 06:34:32] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 22 places in 124 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 33 places in 139 ms
[2020-06-03 06:34:33] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 43 places in 77 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-06-03 06:34:34] [INFO ] Deduced a trap composed of 36 places in 75 ms
[2020-06-03 06:34:34] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 9794 ms
[2020-06-03 06:34:34] [INFO ] Computed and/alt/rep : 626/2907/626 causal constraints in 43 ms.
[2020-06-03 06:34:37] [INFO ] Added : 299 causal constraints over 60 iterations in 2887 ms. Result :sat
[2020-06-03 06:34:37] [INFO ] [Real]Absence check using 73 positive place invariants in 53 ms returned sat
[2020-06-03 06:34:37] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 21 ms returned sat
[2020-06-03 06:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:38] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2020-06-03 06:34:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:38] [INFO ] [Nat]Absence check using 73 positive place invariants in 20 ms returned unsat
[2020-06-03 06:34:38] [INFO ] [Real]Absence check using 73 positive place invariants in 45 ms returned sat
[2020-06-03 06:34:38] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-03 06:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:39] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2020-06-03 06:34:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:39] [INFO ] [Nat]Absence check using 73 positive place invariants in 20 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-03 06:34:39] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 06:34:39] [INFO ] Flatten gal took : 77 ms
FORMULA BusinessProcesses-PT-18-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:34:39] [INFO ] Applying decomposition
[2020-06-03 06:34:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:34:39] [INFO ] Flatten gal took : 30 ms
[2020-06-03 06:34:39] [INFO ] Decomposing Gal with order
[2020-06-03 06:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 06:34:40] [INFO ] Removed a total of 117 redundant transitions.
[2020-06-03 06:34:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 06:34:40] [INFO ] Flatten gal took : 570 ms
[2020-06-03 06:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2020-06-03 06:34:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-18-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 06:34:41] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 06:34:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-18 @ 3570 seconds

FORMULA BusinessProcesses-PT-18-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-18-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: 16427332 kB
MemFree: 159104 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16322580 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-18"
export BK_EXAMINATION="LTLCardinality"
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-18, examination is LTLCardinality"
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-158987914100585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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