fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r423-tajo-167905976300135
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldRVs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
526.815 155004.00 218055.00 83.60 FTTTFTTTTTFTFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976300135.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 256K Mar 5 18:23 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 ShieldRVs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679242742852

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:19:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:19:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:19:04] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-19 16:19:04] [INFO ] Transformed 563 places.
[2023-03-19 16:19:04] [INFO ] Transformed 763 transitions.
[2023-03-19 16:19:04] [INFO ] Found NUPN structural information;
[2023-03-19 16:19:04] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 763 rows 563 cols
[2023-03-19 16:19:05] [INFO ] Computed 161 place invariants in 18 ms
[2023-03-19 16:19:05] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 16:19:06] [INFO ] [Nat]Absence check using 161 positive place invariants in 34 ms returned sat
[2023-03-19 16:19:06] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 7 ms to minimize.
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:19:07] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:19:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1115 ms
[2023-03-19 16:19:08] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-19 16:19:09] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-19 16:19:10] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:19:11] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:19:12] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:19:13] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:19:14] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-19 16:19:15] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:19:16] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 3 ms to minimize.
[2023-03-19 16:19:17] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 0 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2023-03-19 16:19:18] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 10667 ms
[2023-03-19 16:19:19] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 10667 ms
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:19:19] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:19:20] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-19 16:19:20] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:19:20] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2023-03-19 16:19:20] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2023-03-19 16:19:20] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:19:21] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:19:21] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-19 16:19:21] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:19:21] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2023-03-19 16:19:21] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:19:22] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:19:22] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:19:22] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:19:22] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:19:22] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-19 16:19:22] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:19:23] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 1 ms to minimize.
[2023-03-19 16:19:23] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:19:23] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:19:23] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:19:23] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:19:24] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-19 16:19:24] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:19:24] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:19:24] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:19:24] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2023-03-19 16:19:24] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:19:25] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:19:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-19 16:19:26] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-19 16:19:26] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:19:26] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 6891 ms
[2023-03-19 16:19:26] [INFO ] After 20477ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 1198 ms.
[2023-03-19 16:19:27] [INFO ] After 21952ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 206 ms.
Support contains 161 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 54 place count 562 transition count 762
Applied a total of 54 rules in 166 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-19 16:19:28] [INFO ] Computed 161 place invariants in 30 ms
[2023-03-19 16:19:28] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:19:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 41 ms returned sat
[2023-03-19 16:19:29] [INFO ] After 1072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 16:19:30] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:19:30] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:19:30] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:19:31] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:19:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2023-03-19 16:19:31] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-19 16:19:31] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:19:32] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2023-03-19 16:19:32] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-19 16:19:32] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:19:32] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-19 16:19:32] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:19:33] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-19 16:19:33] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:19:33] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-19 16:19:33] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-19 16:19:33] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:19:33] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-19 16:19:34] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 0 ms to minimize.
[2023-03-19 16:19:34] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:19:34] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:19:34] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2023-03-19 16:19:34] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:19:35] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 2 ms to minimize.
[2023-03-19 16:19:35] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 1 ms to minimize.
[2023-03-19 16:19:35] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2023-03-19 16:19:35] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2023-03-19 16:19:36] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2023-03-19 16:19:36] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:19:36] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:19:36] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-19 16:19:36] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-19 16:19:37] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:19:37] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-19 16:19:37] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-19 16:19:37] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-19 16:19:37] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:19:38] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2023-03-19 16:19:38] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2023-03-19 16:19:38] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 2 ms to minimize.
[2023-03-19 16:19:38] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:19:38] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2023-03-19 16:19:39] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:19:39] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:19:39] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-19 16:19:39] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:19:39] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:19:39] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-19 16:19:40] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-19 16:19:40] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2023-03-19 16:19:40] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-19 16:19:40] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:19:40] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:19:40] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:19:41] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:19:41] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:19:41] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-19 16:19:41] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:19:41] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-19 16:19:42] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:19:42] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-19 16:19:42] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 0 ms to minimize.
[2023-03-19 16:19:42] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2023-03-19 16:19:43] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:19:43] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 0 ms to minimize.
[2023-03-19 16:19:43] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-19 16:19:43] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:19:43] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:19:44] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:19:44] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2023-03-19 16:19:44] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-19 16:19:44] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:19:44] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:19:45] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:19:45] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:19:45] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:19:45] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:19:45] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2023-03-19 16:19:46] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:19:46] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-19 16:19:46] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:19:46] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:19:46] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2023-03-19 16:19:46] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:19:47] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-19 16:19:47] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:19:47] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:19:47] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:19:47] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:19:47] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:19:48] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:19:48] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:19:48] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2023-03-19 16:19:48] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:19:48] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:19:49] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:19:49] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:19:49] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:19:49] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-19 16:19:49] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:19:49] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-19 16:19:50] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:19:50] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:19:50] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:19:50] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:19:50] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:19:50] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:19:51] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:19:51] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-03-19 16:19:51] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:19:51] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-19 16:19:51] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:19:51] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:19:52] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:19:52] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:19:52] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:19:52] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-19 16:19:52] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2023-03-19 16:19:52] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:19:53] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:19:53] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2023-03-19 16:19:53] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:19:53] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2023-03-19 16:19:53] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:19:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:19:53] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 63 ms.
Support contains 160 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 69 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
[2023-03-19 16:19:54] [INFO ] Invariant cache hit.
[2023-03-19 16:19:54] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:19:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-19 16:19:55] [INFO ] After 851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:19:56] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:19:56] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:19:56] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:19:56] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-19 16:19:56] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-19 16:19:57] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-19 16:19:57] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:19:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1216 ms
[2023-03-19 16:19:57] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2023-03-19 16:19:57] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-19 16:19:58] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-19 16:19:58] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:19:58] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:19:58] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 2 ms to minimize.
[2023-03-19 16:19:58] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:19:59] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:19:59] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:19:59] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:19:59] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:19:59] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-19 16:19:59] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-19 16:20:00] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2023-03-19 16:20:00] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 0 ms to minimize.
[2023-03-19 16:20:00] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:20:00] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2023-03-19 16:20:00] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 0 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:01] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:20:02] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-19 16:20:03] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2023-03-19 16:20:04] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-19 16:20:05] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:20:06] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 1 ms to minimize.
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:20:07] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:20:08] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:20:09] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 1 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:20:10] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:20:11] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:12] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 1 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:13] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2023-03-19 16:20:14] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2023-03-19 16:20:14] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2023-03-19 16:20:14] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-19 16:20:14] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-19 16:20:14] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2023-03-19 16:20:15] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-19 16:20:15] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:15] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:20:15] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:20:15] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2023-03-19 16:20:15] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-19 16:20:16] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:20:16] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:20:16] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:20:16] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:20:16] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:20:16] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:20:17] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:20:18] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:20:19] [INFO ] Trap strengthening (SAT) tested/added 125/125 trap constraints in 22013 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:20:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:20:19] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 59 ms.
Support contains 141 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 562 transition count 762
Applied a total of 4 rules in 46 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 290845 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290845 steps, saw 65409 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-19 16:20:22] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-19 16:20:23] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:20:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2023-03-19 16:20:23] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:20:24] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-19 16:20:24] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2023-03-19 16:20:24] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-19 16:20:24] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-19 16:20:25] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:20:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 764 ms
[2023-03-19 16:20:25] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:20:25] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:20:25] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-19 16:20:26] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:20:26] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:20:26] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:20:26] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:20:26] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 0 ms to minimize.
[2023-03-19 16:20:26] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-19 16:20:27] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:20:27] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:20:27] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:20:27] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:20:27] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2023-03-19 16:20:27] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2023-03-19 16:20:28] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-19 16:20:28] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-03-19 16:20:28] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-19 16:20:28] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:20:28] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-19 16:20:28] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:20:29] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:20:29] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:20:29] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-19 16:20:29] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-19 16:20:30] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-19 16:20:30] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:20:30] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:20:30] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-19 16:20:30] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:20:31] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-19 16:20:31] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-19 16:20:31] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:20:31] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:20:31] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-19 16:20:32] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-19 16:20:32] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-19 16:20:32] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:20:32] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-19 16:20:32] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:20:32] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-19 16:20:33] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:20:33] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:20:33] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-19 16:20:33] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-19 16:20:33] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-19 16:20:34] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:20:34] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:20:34] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-19 16:20:34] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2023-03-19 16:20:34] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:20:35] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2023-03-19 16:20:35] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:20:35] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-19 16:20:35] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-19 16:20:35] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2023-03-19 16:20:35] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-19 16:20:36] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-19 16:20:36] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-19 16:20:36] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-19 16:20:36] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:20:36] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-19 16:20:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2023-03-19 16:20:37] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-19 16:20:38] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-19 16:20:38] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:20:38] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:20:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-19 16:20:38] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 13192 ms
[2023-03-19 16:20:38] [INFO ] After 15232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 685 ms.
[2023-03-19 16:20:39] [INFO ] After 16076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 68 ms.
Support contains 141 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 28 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 23 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2023-03-19 16:20:39] [INFO ] Invariant cache hit.
[2023-03-19 16:20:39] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-19 16:20:39] [INFO ] Invariant cache hit.
[2023-03-19 16:20:40] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2023-03-19 16:20:40] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-19 16:20:40] [INFO ] Invariant cache hit.
[2023-03-19 16:20:40] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1444 ms. Remains : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 31 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 16:20:40] [INFO ] Invariant cache hit.
[2023-03-19 16:20:41] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:20:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2023-03-19 16:20:42] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:20:42] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:20:42] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:20:42] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:20:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-19 16:20:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2023-03-19 16:20:43] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:20:43] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-19 16:20:43] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:20:43] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-19 16:20:44] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-19 16:20:44] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-19 16:20:44] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-19 16:20:44] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2023-03-19 16:20:44] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:20:44] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-19 16:20:45] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:20:45] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-19 16:20:45] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-19 16:20:45] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-19 16:20:45] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:20:46] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-19 16:20:46] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-19 16:20:46] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-19 16:20:46] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2023-03-19 16:20:46] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-19 16:20:46] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:20:47] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2023-03-19 16:20:47] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-19 16:20:47] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-19 16:20:47] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-19 16:20:47] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2023-03-19 16:20:47] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2023-03-19 16:20:48] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:20:48] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-19 16:20:48] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-19 16:20:48] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-19 16:20:48] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-19 16:20:48] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-19 16:20:49] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:20:50] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:20:51] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:20:51] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2023-03-19 16:20:51] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2023-03-19 16:20:51] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:20:51] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2023-03-19 16:20:51] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 5 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 0 ms to minimize.
[2023-03-19 16:20:52] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 0 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 0 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2023-03-19 16:20:53] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 0 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:20:54] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2023-03-19 16:20:55] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-19 16:20:55] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:20:55] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2023-03-19 16:20:55] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-19 16:20:55] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:20:55] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:20:56] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 0 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 0 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:20:57] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2023-03-19 16:20:58] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2023-03-19 16:20:59] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 1 ms to minimize.
[2023-03-19 16:20:59] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:20:59] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:20:59] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:20:59] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:20:59] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 0 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2023-03-19 16:21:00] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 0 ms to minimize.
[2023-03-19 16:21:01] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:21:01] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:21:01] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 0 ms to minimize.
[2023-03-19 16:21:01] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2023-03-19 16:21:01] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:21:01] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2023-03-19 16:21:02] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 1 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 0 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-19 16:21:03] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-19 16:21:04] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2023-03-19 16:21:05] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 1 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 0 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-19 16:21:06] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-19 16:21:07] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2023-03-19 16:21:07] [INFO ] Trap strengthening (SAT) tested/added 159/158 trap constraints in 24124 ms
[2023-03-19 16:21:07] [INFO ] After 26034ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1110 ms.
[2023-03-19 16:21:08] [INFO ] After 27325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 16:21:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-19 16:21:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 762 transitions and 3790 arcs took 8 ms.
[2023-03-19 16:21:08] [INFO ] Flatten gal took : 138 ms
Total runtime 124426 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-040A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability

FORMULA ShieldRVs-PT-040A-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-040A-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679242897856

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 0 ShieldRVs-PT-040A-ReachabilityFireability-00
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 ShieldRVs-PT-040A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 ShieldRVs-PT-040A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 10 (type SRCH) for 0 ShieldRVs-PT-040A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 8 (type EQUN) for ShieldRVs-PT-040A-ReachabilityFireability-00
lola: result : unknown
lola: LAUNCH task # 14 (type FNDP) for 3 ShieldRVs-PT-040A-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 14 (type FNDP) for ShieldRVs-PT-040A-ReachabilityFireability-04
lola: result : true
lola: fired transitions : 77
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 12 (type SRCH) for 0 ShieldRVs-PT-040A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 12 (type SRCH) for ShieldRVs-PT-040A-ReachabilityFireability-00
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-ReachabilityFireability-04: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-ReachabilityFireability-00: AG 0 0 3 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 EF FNDP 5/3599 0/5 ShieldRVs-PT-040A-ReachabilityFireability-00 719139 t fired, 5678 attempts, .
10 EF SRCH 5/3599 4/5 ShieldRVs-PT-040A-ReachabilityFireability-00 1001198 m, 200239 m/sec, 1268576 t fired, .
11 EF EXCL 5/3599 2/32 ShieldRVs-PT-040A-ReachabilityFireability-00 218513 m, 43702 m/sec, 344669 t fired, .

Time elapsed: 6 secs. Pages in use: 6
# running tasks: 3 of 4 Visible: 2
lola: CANCELED task # 10 (type SRCH) for ShieldRVs-PT-040A-ReachabilityFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-ReachabilityFireability-04: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-ReachabilityFireability-00: AG 0 0 2 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 EF FNDP 10/3599 0/5 ShieldRVs-PT-040A-ReachabilityFireability-00 1520755 t fired, 11473 attempts, .
11 EF EXCL 10/3599 4/32 ShieldRVs-PT-040A-ReachabilityFireability-00 461833 m, 48664 m/sec, 743492 t fired, .

Time elapsed: 11 secs. Pages in use: 8
# running tasks: 3 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-ReachabilityFireability-04: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-ReachabilityFireability-00: AG 0 0 2 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 EF FNDP 15/3599 0/5 ShieldRVs-PT-040A-ReachabilityFireability-00 2321971 t fired, 17070 attempts, .
11 EF EXCL 15/3599 6/32 ShieldRVs-PT-040A-ReachabilityFireability-00 685370 m, 44707 m/sec, 1117592 t fired, .

Time elapsed: 16 secs. Pages in use: 8
# running tasks: 2 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-ReachabilityFireability-04: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-ReachabilityFireability-00: AG 0 0 2 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 EF FNDP 20/3599 0/5 ShieldRVs-PT-040A-ReachabilityFireability-00 3088384 t fired, 22214 attempts, .
11 EF EXCL 20/3599 8/32 ShieldRVs-PT-040A-ReachabilityFireability-00 917330 m, 46392 m/sec, 1501507 t fired, .

Time elapsed: 21 secs. Pages in use: 8
# running tasks: 2 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-ReachabilityFireability-04: AG false findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-040A-ReachabilityFireability-00: AG 0 0 2 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 EF FNDP 25/3599 0/5 ShieldRVs-PT-040A-ReachabilityFireability-00 3793912 t fired, 26774 attempts, .
11 EF EXCL 25/3599 10/32 ShieldRVs-PT-040A-ReachabilityFireability-00 1141908 m, 44915 m/sec, 1871030 t fired, .

Time elapsed: 26 secs. Pages in use: 10
# running tasks: 2 of 4 Visible: 2
lola: FINISHED task # 7 (type FNDP) for ShieldRVs-PT-040A-ReachabilityFireability-00
lola: result : true
lola: fired transitions : 4220856
lola: tried executions : 29463
lola: time used : 28.000000
lola: memory pages used : 0
lola: CANCELED task # 11 (type EXCL) for ShieldRVs-PT-040A-ReachabilityFireability-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-040A-ReachabilityFireability-00: AG false findpath
ShieldRVs-PT-040A-ReachabilityFireability-04: AG false findpath


Time elapsed: 29 secs. Pages in use: 11

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="ShieldRVs-PT-040A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldRVs-PT-040A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976300135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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