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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15716.520 3600000.00 29246.00 27.70 TTTFTTFTTTTTTTFF 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-158987914000494.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-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 2.8K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 85K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591158600529

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:30:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:30:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:30:01] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-03 04:30:01] [INFO ] Transformed 376 places.
[2020-06-03 04:30:01] [INFO ] Transformed 297 transitions.
[2020-06-03 04:30:01] [INFO ] Found NUPN structural information;
[2020-06-03 04:30:01] [INFO ] Parsed PT model containing 376 places and 297 transitions in 88 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 101 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0]
// Phase 1: matrix 296 rows 375 cols
[2020-06-03 04:30:01] [INFO ] Computed 81 place invariants in 12 ms
[2020-06-03 04:30:02] [INFO ] [Real]Absence check using 42 positive place invariants in 37 ms returned sat
[2020-06-03 04:30:02] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 19 ms returned sat
[2020-06-03 04:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:02] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2020-06-03 04:30:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:02] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2020-06-03 04:30:02] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 21 ms returned sat
[2020-06-03 04:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:03] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 16 places in 157 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 8 places in 96 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 18 places in 95 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 15 places in 90 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 11 places in 87 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 20 places in 91 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-06-03 04:30:03] [INFO ] Deduced a trap composed of 75 places in 94 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 83 places in 80 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 74 places in 78 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 76 places in 76 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 79 places in 77 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 72 places in 81 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 74 places in 107 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 72 places in 76 ms
[2020-06-03 04:30:04] [INFO ] Deduced a trap composed of 75 places in 80 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 70 places in 76 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 89 places in 79 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 74 places in 66 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 79 places in 73 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 78 places in 73 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 79 places in 79 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 75 places in 79 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 73 places in 81 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 73 places in 80 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 85 places in 83 ms
[2020-06-03 04:30:05] [INFO ] Deduced a trap composed of 79 places in 80 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 82 places in 74 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 81 places in 72 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 81 places in 73 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 83 places in 103 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 81 places in 197 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 74 places in 83 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 83 places in 94 ms
[2020-06-03 04:30:06] [INFO ] Deduced a trap composed of 92 places in 86 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 79 places in 104 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 82 places in 66 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 82 places in 73 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 81 places in 69 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 78 places in 67 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 87 places in 81 ms
[2020-06-03 04:30:07] [INFO ] Deduced a trap composed of 78 places in 101 ms
[2020-06-03 04:30:07] [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 s24 s25 s26 s66 s74 s75 s77 s78 s97 s177 s181 s183 s187 s216 s218 s226 s227 s228 s236 s237 s238 s252 s262 s267 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s291 s292 s293 s294 s297 s298 s299 s300 s301 s302 s305 s306 s307 s308 s309 s310 s313 s314 s321 s322 s323 s324 s327 s328 s332 s333 s340 s341 s344 s345 s369) 0)") while checking expression at index 0
[2020-06-03 04:30:07] [INFO ] [Real]Absence check using 42 positive place invariants in 45 ms returned sat
[2020-06-03 04:30:07] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 39 ms returned sat
[2020-06-03 04:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:08] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 8 places in 150 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 17 places in 185 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 15 places in 168 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 17 places in 59 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 21 places in 48 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 22 places in 42 ms
[2020-06-03 04:30:08] [INFO ] Deduced a trap composed of 11 places in 36 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 16 places in 29 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 24 places in 25 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 20 places in 25 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 24 places in 50 ms
[2020-06-03 04:30:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1075 ms
[2020-06-03 04:30:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:09] [INFO ] [Nat]Absence check using 42 positive place invariants in 52 ms returned sat
[2020-06-03 04:30:09] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 19 ms returned sat
[2020-06-03 04:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:09] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 14 places in 84 ms
[2020-06-03 04:30:09] [INFO ] Deduced a trap composed of 17 places in 142 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 24 places in 45 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 17 places in 39 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 22 places in 53 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 22 places in 43 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 24 places in 42 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 22 places in 40 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 13 places in 38 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 19 places in 37 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 23 places in 34 ms
[2020-06-03 04:30:10] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 20 places in 36 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 19 places in 34 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 82 places in 90 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 80 places in 71 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 81 places in 93 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 79 places in 75 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 83 places in 68 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 85 places in 65 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 80 places in 68 ms
[2020-06-03 04:30:11] [INFO ] Deduced a trap composed of 78 places in 71 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 76 places in 72 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 78 places in 68 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 77 places in 70 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 79 places in 67 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 82 places in 75 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 82 places in 74 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 20 places in 71 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 87 places in 68 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 85 places in 84 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 80 places in 68 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 78 places in 65 ms
[2020-06-03 04:30:12] [INFO ] Deduced a trap composed of 79 places in 63 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 77 places in 65 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 77 places in 64 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 85 places in 64 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 80 places in 63 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 81 places in 61 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 84 places in 64 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 24 places in 63 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 82 places in 63 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 86 places in 64 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 83 places in 61 ms
[2020-06-03 04:30:13] [INFO ] Deduced a trap composed of 77 places in 62 ms
[2020-06-03 04:30:14] [INFO ] Deduced a trap composed of 84 places in 70 ms
[2020-06-03 04:30:14] [INFO ] Deduced a trap composed of 78 places in 67 ms
[2020-06-03 04:30:14] [INFO ] Deduced a trap composed of 77 places in 66 ms
[2020-06-03 04:30:14] [INFO ] Deduced a trap composed of 78 places in 68 ms
[2020-06-03 04:30:14] [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 s18 s19 s20 s36 s37 s38 s42 s43 s44 s140 s141 s142 s147 s150 s172 s177 s187 s212 s217 s227 s247 s262 s267 s271 s274 s275 s276 s277 s278 s279 s280 s281 s282 s289 s290 s291 s292 s293 s294 s299 s300 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s329 s330 s332 s333 s336 s337 s344 s345 s346 s366) 0)") while checking expression at index 1
[2020-06-03 04:30:14] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2020-06-03 04:30:14] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 25 ms returned sat
[2020-06-03 04:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:14] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2020-06-03 04:30:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:30:14] [INFO ] [Nat]Absence check using 42 positive place invariants in 30 ms returned sat
[2020-06-03 04:30:14] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2020-06-03 04:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:30:15] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 8 places in 38 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 27 places in 37 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 23 places in 37 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 17 places in 36 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 15 places in 28 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 21 places in 34 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 20 places in 25 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 23 places in 28 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 23 places in 26 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 21 places in 24 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 25 places in 27 ms
[2020-06-03 04:30:15] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2020-06-03 04:30:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 759 ms
[2020-06-03 04:30:15] [INFO ] Computed and/alt/rep : 295/981/295 causal constraints in 13 ms.
[2020-06-03 04:30:17] [INFO ] Added : 290 causal constraints over 58 iterations in 1599 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 22300 steps, including 248 resets, run finished after 47 ms. (steps per millisecond=474 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 375 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 184 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 366 transition count 222
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 139 place count 302 transition count 222
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 139 place count 302 transition count 162
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 267 place count 234 transition count 162
Symmetric choice reduction at 2 with 38 rule applications. Total rules 305 place count 234 transition count 162
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 38 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 381 place count 196 transition count 124
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 507 place count 130 transition count 64
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 508 place count 130 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 509 place count 129 transition count 63
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 510 place count 129 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 511 place count 128 transition count 62
Applied a total of 511 rules in 81 ms. Remains 128 /375 variables (removed 247) and now considering 62/296 (removed 234) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/375 places, 62/296 transitions.
Finished random walk after 602141 steps, including 9408 resets, run visited all 2 properties in 932 ms. (steps per millisecond=646 )
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

--------------------
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-06"
export BK_EXAMINATION="ReachabilityCardinality"
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-06, examination is ReachabilityCardinality"
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-158987914000494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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