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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.580 3600000.00 3663778.00 373.60 FFF?F??FFFT?F?TF 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-158987914000537.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-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 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.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 146K 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-12-00
FORMULA_NAME BusinessProcesses-PT-12-01
FORMULA_NAME BusinessProcesses-PT-12-02
FORMULA_NAME BusinessProcesses-PT-12-03
FORMULA_NAME BusinessProcesses-PT-12-04
FORMULA_NAME BusinessProcesses-PT-12-05
FORMULA_NAME BusinessProcesses-PT-12-06
FORMULA_NAME BusinessProcesses-PT-12-07
FORMULA_NAME BusinessProcesses-PT-12-08
FORMULA_NAME BusinessProcesses-PT-12-09
FORMULA_NAME BusinessProcesses-PT-12-10
FORMULA_NAME BusinessProcesses-PT-12-11
FORMULA_NAME BusinessProcesses-PT-12-12
FORMULA_NAME BusinessProcesses-PT-12-13
FORMULA_NAME BusinessProcesses-PT-12-14
FORMULA_NAME BusinessProcesses-PT-12-15

=== Now, execution of the tool begins

BK_START 1591162087758

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:28:09] [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 05:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:28:09] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2020-06-03 05:28:09] [INFO ] Transformed 586 places.
[2020-06-03 05:28:09] [INFO ] Transformed 525 transitions.
[2020-06-03 05:28:09] [INFO ] Found NUPN structural information;
[2020-06-03 05:28:09] [INFO ] Parsed PT model containing 586 places and 525 transitions in 248 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 727 resets, run finished after 262 ms. (steps per millisecond=381 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2020-06-03 05:28:09] [INFO ] Computed 98 place invariants in 22 ms
[2020-06-03 05:28:10] [INFO ] [Real]Absence check using 55 positive place invariants in 42 ms returned sat
[2020-06-03 05:28:10] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:11] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2020-06-03 05:28:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 47 ms returned sat
[2020-06-03 05:28:11] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 31 ms returned sat
[2020-06-03 05:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:11] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2020-06-03 05:28:12] [INFO ] Deduced a trap composed of 109 places in 201 ms
[2020-06-03 05:28:12] [INFO ] Deduced a trap composed of 16 places in 134 ms
[2020-06-03 05:28:12] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-06-03 05:28:12] [INFO ] Deduced a trap composed of 20 places in 148 ms
[2020-06-03 05:28:12] [INFO ] Deduced a trap composed of 13 places in 147 ms
[2020-06-03 05:28:12] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 21 places in 92 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 18 places in 85 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-06-03 05:28:13] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 32 places in 76 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 21 places in 76 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 45 places in 74 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 48 places in 75 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 23 places in 72 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 36 places in 75 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 27 places in 75 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 31 places in 71 ms
[2020-06-03 05:28:14] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2020-06-03 05:28:15] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-06-03 05:28:15] [INFO ] Deduced a trap composed of 56 places in 85 ms
[2020-06-03 05:28:15] [INFO ] Deduced a trap composed of 58 places in 442 ms
[2020-06-03 05:28:15] [INFO ] Deduced a trap composed of 40 places in 179 ms
[2020-06-03 05:28:15] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 3944 ms
[2020-06-03 05:28:15] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 60 ms.
[2020-06-03 05:28:18] [INFO ] Added : 324 causal constraints over 65 iterations in 2665 ms. Result :sat
[2020-06-03 05:28:18] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:28:18] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:19] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2020-06-03 05:28:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:19] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned unsat
[2020-06-03 05:28:19] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-06-03 05:28:19] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:20] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-03 05:28:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:20] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:28:20] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2020-06-03 05:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:20] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 19 places in 74 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 15 places in 79 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 13 places in 78 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 13 places in 69 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 28 places in 72 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 11 places in 74 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 14 places in 76 ms
[2020-06-03 05:28:21] [INFO ] Deduced a trap composed of 19 places in 73 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 31 places in 69 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 26 places in 69 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 19 places in 152 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 45 places in 76 ms
[2020-06-03 05:28:22] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 21 places in 71 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 35 places in 78 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 32 places in 72 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 41 places in 73 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 18 places in 61 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 27 places in 64 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 42 places in 61 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2020-06-03 05:28:23] [INFO ] Deduced a trap composed of 39 places in 53 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 46 places in 54 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 44 places in 55 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 29 places in 53 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 31 places in 55 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 45 places in 56 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 25 places in 55 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 41 places in 59 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 46 places in 58 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 46 places in 58 ms
[2020-06-03 05:28:24] [INFO ] Deduced a trap composed of 26 places in 33 ms
[2020-06-03 05:28:24] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 3830 ms
[2020-06-03 05:28:24] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 23 ms.
[2020-06-03 05:28:28] [INFO ] Added : 377 causal constraints over 76 iterations in 3276 ms. Result :sat
[2020-06-03 05:28:28] [INFO ] Deduced a trap composed of 134 places in 138 ms
[2020-06-03 05:28:28] [INFO ] Deduced a trap composed of 134 places in 135 ms
[2020-06-03 05:28:28] [INFO ] Deduced a trap composed of 130 places in 131 ms
[2020-06-03 05:28:28] [INFO ] Deduced a trap composed of 148 places in 139 ms
[2020-06-03 05:28:29] [INFO ] Deduced a trap composed of 148 places in 341 ms
[2020-06-03 05:28:29] [INFO ] Deduced a trap composed of 142 places in 151 ms
[2020-06-03 05:28:29] [INFO ] Deduced a trap composed of 145 places in 153 ms
[2020-06-03 05:28:29] [INFO ] Deduced a trap composed of 138 places in 266 ms
[2020-06-03 05:28:30] [INFO ] Deduced a trap composed of 136 places in 144 ms
[2020-06-03 05:28:30] [INFO ] Deduced a trap composed of 147 places in 159 ms
[2020-06-03 05:28:30] [INFO ] Deduced a trap composed of 149 places in 146 ms
[2020-06-03 05:28:31] [INFO ] Deduced a trap composed of 127 places in 293 ms
[2020-06-03 05:28:31] [INFO ] Deduced a trap composed of 142 places in 353 ms
[2020-06-03 05:28:31] [INFO ] Deduced a trap composed of 134 places in 304 ms
[2020-06-03 05:28:32] [INFO ] Deduced a trap composed of 139 places in 307 ms
[2020-06-03 05:28:32] [INFO ] Deduced a trap composed of 125 places in 305 ms
[2020-06-03 05:28:32] [INFO ] Deduced a trap composed of 129 places in 187 ms
[2020-06-03 05:28:33] [INFO ] Deduced a trap composed of 132 places in 174 ms
[2020-06-03 05:28:33] [INFO ] Deduced a trap composed of 132 places in 138 ms
[2020-06-03 05:28:33] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-06-03 05:28:34] [INFO ] Deduced a trap composed of 135 places in 210 ms
[2020-06-03 05:28:34] [INFO ] Deduced a trap composed of 132 places in 135 ms
[2020-06-03 05:28:34] [INFO ] Deduced a trap composed of 142 places in 303 ms
[2020-06-03 05:28:34] [INFO ] Deduced a trap composed of 141 places in 149 ms
[2020-06-03 05:28:35] [INFO ] Deduced a trap composed of 125 places in 164 ms
[2020-06-03 05:28:35] [INFO ] Deduced a trap composed of 127 places in 124 ms
[2020-06-03 05:28:35] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7487 ms
[2020-06-03 05:28:35] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:28:35] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:36] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2020-06-03 05:28:36] [INFO ] Deduced a trap composed of 19 places in 89 ms
[2020-06-03 05:28:36] [INFO ] Deduced a trap composed of 18 places in 133 ms
[2020-06-03 05:28:36] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-06-03 05:28:36] [INFO ] Deduced a trap composed of 21 places in 166 ms
[2020-06-03 05:28:37] [INFO ] Deduced a trap composed of 25 places in 186 ms
[2020-06-03 05:28:37] [INFO ] Deduced a trap composed of 17 places in 197 ms
[2020-06-03 05:28:37] [INFO ] Deduced a trap composed of 27 places in 92 ms
[2020-06-03 05:28:37] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2020-06-03 05:28:37] [INFO ] Deduced a trap composed of 22 places in 71 ms
[2020-06-03 05:28:37] [INFO ] Deduced a trap composed of 26 places in 278 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 35 places in 234 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 22 places in 74 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 25 places in 85 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 39 places in 81 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 32 places in 56 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 29 places in 54 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 28 places in 52 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 39 places in 55 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 35 places in 50 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 47 places in 48 ms
[2020-06-03 05:28:38] [INFO ] Deduced a trap composed of 27 places in 52 ms
[2020-06-03 05:28:39] [INFO ] Deduced a trap composed of 30 places in 50 ms
[2020-06-03 05:28:39] [INFO ] Deduced a trap composed of 46 places in 52 ms
[2020-06-03 05:28:39] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2832 ms
[2020-06-03 05:28:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:28:39] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:39] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 24 places in 88 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 16 places in 82 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 13 places in 81 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 22 places in 73 ms
[2020-06-03 05:28:40] [INFO ] Deduced a trap composed of 33 places in 75 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 23 places in 77 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 27 places in 73 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 35 places in 70 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 27 places in 72 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 41 places in 109 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 22 places in 69 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 24 places in 67 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 27 places in 75 ms
[2020-06-03 05:28:41] [INFO ] Deduced a trap composed of 47 places in 72 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 41 places in 68 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 48 places in 65 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 47 places in 65 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 30 places in 86 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 50 places in 64 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 24 places in 55 ms
[2020-06-03 05:28:42] [INFO ] Deduced a trap composed of 45 places in 64 ms
[2020-06-03 05:28:42] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2853 ms
[2020-06-03 05:28:42] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 37 ms.
[2020-06-03 05:28:45] [INFO ] Added : 314 causal constraints over 63 iterations in 3024 ms. Result :sat
[2020-06-03 05:28:45] [INFO ] [Real]Absence check using 55 positive place invariants in 74 ms returned sat
[2020-06-03 05:28:46] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 43 ms returned sat
[2020-06-03 05:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:46] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2020-06-03 05:28:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned unsat
[2020-06-03 05:28:46] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:28:46] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:47] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2020-06-03 05:28:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:47] [INFO ] [Nat]Absence check using 55 positive place invariants in 14 ms returned unsat
[2020-06-03 05:28:47] [INFO ] [Real]Absence check using 55 positive place invariants in 32 ms returned sat
[2020-06-03 05:28:47] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-06-03 05:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:48] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2020-06-03 05:28:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:28:48] [INFO ] [Nat]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-06-03 05:28:48] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 75 ms returned sat
[2020-06-03 05:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:28:49] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2020-06-03 05:28:49] [INFO ] Deduced a trap composed of 107 places in 166 ms
[2020-06-03 05:28:49] [INFO ] Deduced a trap composed of 116 places in 165 ms
[2020-06-03 05:28:49] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-06-03 05:28:50] [INFO ] Deduced a trap composed of 18 places in 125 ms
[2020-06-03 05:28:50] [INFO ] Deduced a trap composed of 117 places in 141 ms
[2020-06-03 05:28:50] [INFO ] Deduced a trap composed of 11 places in 144 ms
[2020-06-03 05:28:50] [INFO ] Deduced a trap composed of 14 places in 147 ms
[2020-06-03 05:28:51] [INFO ] Deduced a trap composed of 25 places in 408 ms
[2020-06-03 05:28:51] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2020-06-03 05:28:51] [INFO ] Deduced a trap composed of 17 places in 149 ms
[2020-06-03 05:28:51] [INFO ] Deduced a trap composed of 107 places in 128 ms
[2020-06-03 05:28:51] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-06-03 05:28:51] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 24 places in 140 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 106 places in 119 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 102 places in 137 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 109 places in 119 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 36 places in 114 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 22 places in 127 ms
[2020-06-03 05:28:52] [INFO ] Deduced a trap composed of 32 places in 117 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 116 places in 116 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 112 places in 125 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 30 places in 136 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 30 places in 112 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 29 places in 110 ms
[2020-06-03 05:28:53] [INFO ] Deduced a trap composed of 130 places in 127 ms
[2020-06-03 05:28:54] [INFO ] Deduced a trap composed of 35 places in 114 ms
[2020-06-03 05:28:54] [INFO ] Deduced a trap composed of 38 places in 111 ms
[2020-06-03 05:28:54] [INFO ] Deduced a trap composed of 33 places in 315 ms
[2020-06-03 05:28:54] [INFO ] Deduced a trap composed of 28 places in 125 ms
[2020-06-03 05:28:54] [INFO ] Deduced a trap composed of 41 places in 121 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 40 places in 108 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 41 places in 113 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 45 places in 122 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 30 places in 155 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 128 places in 124 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 31 places in 124 ms
[2020-06-03 05:28:55] [INFO ] Deduced a trap composed of 52 places in 124 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 38 places in 130 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 112 places in 143 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 43 places in 133 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 111 places in 138 ms
[2020-06-03 05:28:56] [INFO ] Deduced a trap composed of 117 places in 141 ms
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 123 places in 307 ms
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 115 places in 358 ms
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 113 places in 109 ms
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 114 places in 112 ms
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 112 places in 113 ms
[2020-06-03 05:28:57] [INFO ] Deduced a trap composed of 116 places in 132 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 117 places in 124 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 120 places in 108 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 21 places in 109 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 125 places in 112 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 35 places in 114 ms
[2020-06-03 05:28:58] [INFO ] Deduced a trap composed of 37 places in 111 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 44 places in 112 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 116 places in 108 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 131 places in 105 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 116 places in 107 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 108 places in 112 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 107 places in 114 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 43 places in 111 ms
[2020-06-03 05:28:59] [INFO ] Deduced a trap composed of 45 places in 108 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 32 places in 106 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 45 places in 128 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 41 places in 132 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 128 places in 124 ms
[2020-06-03 05:29:00] [INFO ] Deduced a trap composed of 117 places in 122 ms
[2020-06-03 05:29:01] [INFO ] Deduced a trap composed of 132 places in 119 ms
[2020-06-03 05:29:01] [INFO ] Deduced a trap composed of 34 places in 122 ms
[2020-06-03 05:29:01] [INFO ] Deduced a trap composed of 129 places in 122 ms
[2020-06-03 05:29:01] [INFO ] Deduced a trap composed of 113 places in 139 ms
[2020-06-03 05:29:01] [INFO ] Deduced a trap composed of 120 places in 118 ms
[2020-06-03 05:29:01] [INFO ] Deduced a trap composed of 109 places in 109 ms
[2020-06-03 05:29:02] [INFO ] Deduced a trap composed of 121 places in 107 ms
[2020-06-03 05:29:02] [INFO ] Deduced a trap composed of 135 places in 107 ms
[2020-06-03 05:29:02] [INFO ] Deduced a trap composed of 123 places in 106 ms
[2020-06-03 05:29:02] [INFO ] Deduced a trap composed of 130 places in 106 ms
[2020-06-03 05:29:02] [INFO ] Deduced a trap composed of 131 places in 107 ms
[2020-06-03 05:29:02] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 13230 ms
[2020-06-03 05:29:02] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 38 ms.
[2020-06-03 05:29:06] [INFO ] Added : 359 causal constraints over 72 iterations in 3459 ms. Result :sat
[2020-06-03 05:29:06] [INFO ] Deduced a trap composed of 140 places in 287 ms
[2020-06-03 05:29:06] [INFO ] Deduced a trap composed of 148 places in 120 ms
[2020-06-03 05:29:07] [INFO ] Deduced a trap composed of 140 places in 304 ms
[2020-06-03 05:29:07] [INFO ] Deduced a trap composed of 132 places in 123 ms
[2020-06-03 05:29:07] [INFO ] Deduced a trap composed of 137 places in 265 ms
[2020-06-03 05:29:08] [INFO ] Deduced a trap composed of 136 places in 431 ms
[2020-06-03 05:29:08] [INFO ] Deduced a trap composed of 125 places in 188 ms
[2020-06-03 05:29:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:29:08] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-06-03 05:29:08] [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 s231) 0)") while checking expression at index 6
[2020-06-03 05:29:08] [INFO ] [Real]Absence check using 55 positive place invariants in 64 ms returned sat
[2020-06-03 05:29:09] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-06-03 05:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:10] [INFO ] [Real]Absence check using state equation in 1243 ms returned sat
[2020-06-03 05:29:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:29:10] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:29:10] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:29:11] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2020-06-03 05:29:11] [INFO ] Deduced a trap composed of 107 places in 253 ms
[2020-06-03 05:29:11] [INFO ] Deduced a trap composed of 116 places in 274 ms
[2020-06-03 05:29:11] [INFO ] Deduced a trap composed of 13 places in 147 ms
[2020-06-03 05:29:12] [INFO ] Deduced a trap composed of 18 places in 209 ms
[2020-06-03 05:29:12] [INFO ] Deduced a trap composed of 117 places in 145 ms
[2020-06-03 05:29:12] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2020-06-03 05:29:13] [INFO ] Deduced a trap composed of 14 places in 844 ms
[2020-06-03 05:29:13] [INFO ] Deduced a trap composed of 25 places in 142 ms
[2020-06-03 05:29:13] [INFO ] Deduced a trap composed of 17 places in 137 ms
[2020-06-03 05:29:13] [INFO ] Deduced a trap composed of 17 places in 184 ms
[2020-06-03 05:29:13] [INFO ] Deduced a trap composed of 107 places in 147 ms
[2020-06-03 05:29:14] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-06-03 05:29:14] [INFO ] Deduced a trap composed of 27 places in 140 ms
[2020-06-03 05:29:14] [INFO ] Deduced a trap composed of 24 places in 134 ms
[2020-06-03 05:29:14] [INFO ] Deduced a trap composed of 106 places in 252 ms
[2020-06-03 05:29:14] [INFO ] Deduced a trap composed of 102 places in 124 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 109 places in 142 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 36 places in 132 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 22 places in 134 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 32 places in 115 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 116 places in 129 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 25 places in 123 ms
[2020-06-03 05:29:15] [INFO ] Deduced a trap composed of 112 places in 141 ms
[2020-06-03 05:29:16] [INFO ] Deduced a trap composed of 30 places in 125 ms
[2020-06-03 05:29:16] [INFO ] Deduced a trap composed of 30 places in 126 ms
[2020-06-03 05:29:16] [INFO ] Deduced a trap composed of 29 places in 125 ms
[2020-06-03 05:29:16] [INFO ] Deduced a trap composed of 130 places in 129 ms
[2020-06-03 05:29:16] [INFO ] Deduced a trap composed of 35 places in 128 ms
[2020-06-03 05:29:16] [INFO ] Deduced a trap composed of 38 places in 235 ms
[2020-06-03 05:29:17] [INFO ] Deduced a trap composed of 33 places in 291 ms
[2020-06-03 05:29:17] [INFO ] Deduced a trap composed of 28 places in 226 ms
[2020-06-03 05:29:17] [INFO ] Deduced a trap composed of 41 places in 122 ms
[2020-06-03 05:29:17] [INFO ] Deduced a trap composed of 40 places in 117 ms
[2020-06-03 05:29:17] [INFO ] Deduced a trap composed of 41 places in 118 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 45 places in 123 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 30 places in 124 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 128 places in 117 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 31 places in 113 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 52 places in 121 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 38 places in 108 ms
[2020-06-03 05:29:18] [INFO ] Deduced a trap composed of 112 places in 106 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 43 places in 105 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 111 places in 112 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 117 places in 108 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 123 places in 108 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 115 places in 108 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 113 places in 106 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 114 places in 110 ms
[2020-06-03 05:29:19] [INFO ] Deduced a trap composed of 112 places in 109 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 116 places in 111 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 117 places in 116 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 24 places in 114 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 120 places in 109 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 125 places in 118 ms
[2020-06-03 05:29:20] [INFO ] Deduced a trap composed of 35 places in 115 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 37 places in 114 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 44 places in 113 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 116 places in 111 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 131 places in 110 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 116 places in 111 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 108 places in 115 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 107 places in 114 ms
[2020-06-03 05:29:21] [INFO ] Deduced a trap composed of 43 places in 110 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 45 places in 111 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 32 places in 110 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 32 places in 112 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 45 places in 116 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 41 places in 111 ms
[2020-06-03 05:29:22] [INFO ] Deduced a trap composed of 128 places in 112 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 117 places in 110 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 132 places in 115 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 129 places in 112 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 113 places in 125 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 120 places in 129 ms
[2020-06-03 05:29:23] [INFO ] Deduced a trap composed of 109 places in 113 ms
[2020-06-03 05:29:24] [INFO ] Deduced a trap composed of 121 places in 111 ms
[2020-06-03 05:29:24] [INFO ] Deduced a trap composed of 135 places in 113 ms
[2020-06-03 05:29:24] [INFO ] Deduced a trap composed of 123 places in 110 ms
[2020-06-03 05:29:24] [INFO ] Deduced a trap composed of 130 places in 110 ms
[2020-06-03 05:29:24] [INFO ] Deduced a trap composed of 131 places in 105 ms
[2020-06-03 05:29:24] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 13691 ms
[2020-06-03 05:29:24] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 24 ms.
[2020-06-03 05:29:28] [INFO ] Added : 359 causal constraints over 72 iterations in 3731 ms. Result :sat
[2020-06-03 05:29:28] [INFO ] Deduced a trap composed of 140 places in 115 ms
[2020-06-03 05:29:28] [INFO ] Deduced a trap composed of 148 places in 129 ms
[2020-06-03 05:29:29] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-06-03 05:29:29] [INFO ] Deduced a trap composed of 132 places in 327 ms
[2020-06-03 05:29:29] [INFO ] Deduced a trap composed of 137 places in 211 ms
[2020-06-03 05:29:30] [INFO ] Deduced a trap composed of 136 places in 135 ms
[2020-06-03 05:29:30] [INFO ] Deduced a trap composed of 125 places in 145 ms
[2020-06-03 05:29:30] [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 s31 s32 s36 s37 s38 s60 s61 s62 s66 s67 s68 s73 s86 s102 s145 s148 s149 s151 s152 s165 s166 s167 s176 s177 s185 s209 s210 s211 s223 s224 s236 s239 s275 s288 s290 s293 s295 s299 s304 s309 s314 s319 s324 s329 s334 s344 s349 s364 s369 s374 s378 s380 s394 s399 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s430 s431 s435 s436 s439 s440 s445 s446 s449 s450 s454 s458 s460 s463 s466 s470 s471 s474 s475 s478 s479 s484 s485 s488 s489 s494 s495 s496 s497 s498 s499 s506 s507 s513 s514 s515 s516 s517 s518 s521 s522 s523 s524 s527 s528 s529 s530 s539 s540 s543 s551 s560 s569) 0)") while checking expression at index 7
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
[2020-06-03 05:29:30] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 05:29:30] [INFO ] Flatten gal took : 96 ms
FORMULA BusinessProcesses-PT-12-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:29:30] [INFO ] Applying decomposition
[2020-06-03 05:29:30] [INFO ] Flatten gal took : 45 ms
[2020-06-03 05:29:30] [INFO ] Decomposing Gal with order
[2020-06-03 05:29:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 05:29:30] [INFO ] Removed a total of 117 redundant transitions.
[2020-06-03 05:29:30] [INFO ] Flatten gal took : 136 ms
[2020-06-03 05:29:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 121 ms.
[2020-06-03 05:29:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 15 ms.
[2020-06-03 05:29:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BusinessProcesses-PT-12 @ 3570 seconds

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

FORMULA BusinessProcesses-PT-12-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA BusinessProcesses-PT-12-02 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: 6787964 kB
After kill :
MemTotal: 16427332 kB
MemFree: 8443104 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-12"
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-12, 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-158987914000537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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