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

About the Execution of ITS-Tools for ShieldRVs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.823 3600000.00 6779672.00 299685.30 ?TTT??TTTTFTFTFT 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.r421-tajo-167905974800135.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 itstools
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 r421-tajo-167905974800135
=====================================================================

--------------------
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 1679164792306

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 18:39:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 18:39:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:39:53] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-18 18:39:53] [INFO ] Transformed 563 places.
[2023-03-18 18:39:53] [INFO ] Transformed 763 transitions.
[2023-03-18 18:39:53] [INFO ] Found NUPN structural information;
[2023-03-18 18:39:53] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 18:39:54] [INFO ] Flatten gal took : 172 ms
[2023-03-18 18:39:54] [INFO ] Flatten gal took : 73 ms
Incomplete random walk after 10000 steps, including 18 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-15 TRUE 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-06 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
[2023-03-18 18:39:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7818491311438630857.gal : 51 ms
[2023-03-18 18:39:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2579622909215692113.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7818491311438630857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2579622909215692113.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Loading property file /tmp/ReachabilityCardinality2579622909215692113.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :69 after 206
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :206 after 1274
Reachability property ShieldRVs-PT-040A-ReachabilityFireability-06 is true.
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :1274 after 57748
Running SMT prover for 6 properties.
// Phase 1: matrix 763 rows 563 cols
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :57748 after 66773
[2023-03-18 18:39:55] [INFO ] Computed 161 place invariants in 48 ms
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :66773 after 812816
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :812816 after 1.04516e+07
Reachability property ShieldRVs-PT-040A-ReachabilityFireability-11 is true.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :1.04516e+07 after 6.18968e+08
[2023-03-18 18:39:55] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 18:39:55] [INFO ] [Nat]Absence check using 161 positive place invariants in 57 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :6.18968e+08 after 7.65802e+09
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :7.65802e+09 after 4.56643e+11
[2023-03-18 18:39:57] [INFO ] After 1009ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-18 18:39:57] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 6 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :4.56643e+11 after 9.30267e+12
[2023-03-18 18:39:57] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-18 18:39:57] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 709 ms
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2023-03-18 18:39:58] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
Reachability property ShieldRVs-PT-040A-ReachabilityFireability-09 is true.
SDD proceeding with computation,13 properties remain. new max is 16384
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
SDD size :9.30267e+12 after 6.26695e+15
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-18 18:39:59] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-18 18:40:00] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
Reachability property ShieldRVs-PT-040A-ReachabilityFireability-07 is true.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :6.26695e+15 after 5.99499e+17
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 4 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2023-03-18 18:40:01] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2023-03-18 18:40:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-03-18 18:40:02] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-03-18 18:40:02] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2023-03-18 18:40:02] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2023-03-18 18:40:02] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2023-03-18 18:40:02] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :5.99499e+17 after 5.5139e+19
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 1 ms to minimize.
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-03-18 18:40:03] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2023-03-18 18:40:04] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2023-03-18 18:40:04] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-18 18:40:04] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-18 18:40:04] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2023-03-18 18:40:04] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-03-18 18:40:04] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 9 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 8 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-18 18:40:05] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2023-03-18 18:40:06] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2023-03-18 18:40:06] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2023-03-18 18:40:06] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-18 18:40:06] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-18 18:40:06] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
Invariant property ShieldRVs-PT-040A-ReachabilityFireability-14 does not hold.
FORMULA ShieldRVs-PT-040A-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :5.5139e+19 after 7.1111e+22
[2023-03-18 18:40:06] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 10 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-18 18:40:07] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 0 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-18 18:40:08] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-18 18:40:09] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-18 18:40:10] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 65536
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
SDD size :7.1111e+22 after 4.01635e+26
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-18 18:40:11] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-18 18:40:12] [INFO ] Trap strengthening (SAT) tested/added 110/109 trap constraints in 14640 ms
[2023-03-18 18:40:13] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-18 18:40:13] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2023-03-18 18:40:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-18 18:40:13] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-18 18:40:14] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-18 18:40:15] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2023-03-18 18:40:15] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-18 18:40:15] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-03-18 18:40:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-18 18:40:15] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2291 ms
[2023-03-18 18:40:15] [INFO ] After 19661ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 1065 ms.
[2023-03-18 18:40:16] [INFO ] After 21047ms 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 162 ms.
Support contains 160 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 4 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 153 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 154 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 294949 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294949 steps, saw 64131 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-18 18:40:20] [INFO ] Computed 161 place invariants in 27 ms
[2023-03-18 18:40:20] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:40:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 43 ms returned sat
[2023-03-18 18:40:21] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:40:22] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-18 18:40:22] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-18 18:40:22] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-18 18:40:22] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-18 18:40:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 586 ms
[2023-03-18 18:40:23] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2023-03-18 18:40:23] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-18 18:40:23] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-18 18:40:23] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-18 18:40:23] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-18 18:40:24] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-18 18:40:24] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-18 18:40:24] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-18 18:40:24] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-18 18:40:24] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-18 18:40:25] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-18 18:40:25] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-18 18:40:25] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-18 18:40:25] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 0 ms to minimize.
[2023-03-18 18:40:25] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:40:26] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2023-03-18 18:40:26] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:40:26] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2023-03-18 18:40:26] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-18 18:40:26] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-18 18:40:26] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2023-03-18 18:40:27] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-18 18:40:27] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-18 18:40:27] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-18 18:40:27] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-18 18:40:27] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-18 18:40:27] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 0 ms to minimize.
[2023-03-18 18:40:28] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-18 18:40:28] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-18 18:40:28] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2023-03-18 18:40:28] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:40:28] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-18 18:40:29] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-18 18:40:29] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-18 18:40:29] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 1 ms to minimize.
[2023-03-18 18:40:29] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-18 18:40:29] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 0 ms to minimize.
[2023-03-18 18:40:29] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-18 18:40:30] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-18 18:40:30] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-18 18:40:30] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-18 18:40:30] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-18 18:40:30] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-18 18:40:31] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:40:31] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2023-03-18 18:40:31] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-18 18:40:31] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-18 18:40:31] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2023-03-18 18:40:31] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-18 18:40:32] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-18 18:40:32] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:40:32] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-18 18:40:32] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-18 18:40:32] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 0 ms to minimize.
[2023-03-18 18:40:33] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-18 18:40:33] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-18 18:40:33] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 0 ms to minimize.
[2023-03-18 18:40:33] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-18 18:40:33] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-18 18:40:34] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-18 18:40:34] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-18 18:40:34] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-18 18:40:34] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-18 18:40:34] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2023-03-18 18:40:35] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-18 18:40:35] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-18 18:40:35] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2023-03-18 18:40:35] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2023-03-18 18:40:35] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2023-03-18 18:40:35] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-18 18:40:36] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-18 18:40:36] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-18 18:40:36] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2023-03-18 18:40:36] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:40:36] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2023-03-18 18:40:37] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 1 ms to minimize.
[2023-03-18 18:40:37] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2023-03-18 18:40:37] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-18 18:40:37] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-18 18:40:37] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-18 18:40:37] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2023-03-18 18:40:38] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2023-03-18 18:40:38] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-18 18:40:38] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:40:38] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2023-03-18 18:40:38] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-18 18:40:38] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2023-03-18 18:40:39] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-18 18:40:39] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-18 18:40:39] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2023-03-18 18:40:39] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2023-03-18 18:40:39] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2023-03-18 18:40:39] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:40:40] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2023-03-18 18:40:41] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-18 18:40:41] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-03-18 18:40:41] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-18 18:40:41] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 0 ms to minimize.
[2023-03-18 18:40:41] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-18 18:40:41] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-18 18:40:42] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 0 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2023-03-18 18:40:43] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-18 18:40:44] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-18 18:40:45] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 0 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-18 18:40:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 18:40:45] [INFO ] After 25273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 72 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 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 28 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2023-03-18 18:40:46] [INFO ] Invariant cache hit.
[2023-03-18 18:40:46] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-18 18:40:46] [INFO ] Invariant cache hit.
[2023-03-18 18:40:46] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2023-03-18 18:40:46] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-18 18:40:46] [INFO ] Invariant cache hit.
[2023-03-18 18:40:47] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1347 ms. Remains : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 24 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-18 18:40:47] [INFO ] Invariant cache hit.
[2023-03-18 18:40:47] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:40:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 19 ms returned sat
[2023-03-18 18:40:48] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:40:48] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-18 18:40:49] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-18 18:40:49] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-18 18:40:49] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-18 18:40:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 451 ms
[2023-03-18 18:40:49] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2023-03-18 18:40:49] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-18 18:40:50] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-18 18:40:50] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-18 18:40:50] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2023-03-18 18:40:50] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-18 18:40:50] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-18 18:40:51] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-18 18:40:51] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2023-03-18 18:40:51] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-18 18:40:51] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-18 18:40:52] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-18 18:40:52] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-18 18:40:52] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-18 18:40:52] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-18 18:40:52] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2023-03-18 18:40:53] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2023-03-18 18:40:53] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2023-03-18 18:40:53] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 0 ms to minimize.
[2023-03-18 18:40:53] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-18 18:40:53] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-18 18:40:53] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2023-03-18 18:40:54] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-18 18:40:54] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-18 18:40:54] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-18 18:40:54] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 0 ms to minimize.
[2023-03-18 18:40:54] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-18 18:40:54] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-18 18:40:55] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-18 18:40:55] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-18 18:40:55] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:40:55] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-18 18:40:55] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2023-03-18 18:40:55] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 0 ms to minimize.
[2023-03-18 18:40:56] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2023-03-18 18:40:56] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-03-18 18:40:56] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2023-03-18 18:40:56] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-03-18 18:40:56] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2023-03-18 18:40:56] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2023-03-18 18:40:57] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2023-03-18 18:40:57] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2023-03-18 18:40:57] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 1 ms to minimize.
[2023-03-18 18:40:57] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2023-03-18 18:40:57] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2023-03-18 18:40:58] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2023-03-18 18:40:58] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-18 18:40:58] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2023-03-18 18:40:58] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-18 18:40:58] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-18 18:40:58] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-18 18:40:59] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2023-03-18 18:40:59] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2023-03-18 18:40:59] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 0 ms to minimize.
[2023-03-18 18:40:59] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-03-18 18:40:59] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-18 18:40:59] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-18 18:41:00] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2023-03-18 18:41:00] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2023-03-18 18:41:00] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2023-03-18 18:41:00] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-18 18:41:00] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2023-03-18 18:41:01] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-18 18:41:01] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2023-03-18 18:41:01] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-18 18:41:01] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2023-03-18 18:41:01] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2023-03-18 18:41:01] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2023-03-18 18:41:02] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2023-03-18 18:41:02] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 0 ms to minimize.
[2023-03-18 18:41:02] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-03-18 18:41:02] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2023-03-18 18:41:02] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-03-18 18:41:02] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2023-03-18 18:41:03] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-03-18 18:41:03] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-18 18:41:03] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2023-03-18 18:41:03] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-03-18 18:41:03] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2023-03-18 18:41:03] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-03-18 18:41:04] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2023-03-18 18:41:04] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2023-03-18 18:41:04] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2023-03-18 18:41:04] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2023-03-18 18:41:04] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-18 18:41:04] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 1 ms to minimize.
[2023-03-18 18:41:05] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-03-18 18:41:05] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 1 ms to minimize.
[2023-03-18 18:41:05] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-18 18:41:05] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-18 18:41:05] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2023-03-18 18:41:05] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-18 18:41:06] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2023-03-18 18:41:06] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-03-18 18:41:06] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2023-03-18 18:41:06] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-18 18:41:06] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2023-03-18 18:41:06] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-18 18:41:07] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-18 18:41:07] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2023-03-18 18:41:07] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:41:07] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-18 18:41:07] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2023-03-18 18:41:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-18 18:41:08] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2023-03-18 18:41:08] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2023-03-18 18:41:08] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2023-03-18 18:41:08] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2023-03-18 18:41:08] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-18 18:41:08] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-18 18:41:09] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-18 18:41:09] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-18 18:41:09] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 0 ms to minimize.
[2023-03-18 18:41:09] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-18 18:41:10] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2023-03-18 18:41:10] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-18 18:41:10] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2023-03-18 18:41:10] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-18 18:41:10] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-18 18:41:11] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-18 18:41:11] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-18 18:41:11] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 0 ms to minimize.
[2023-03-18 18:41:11] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-18 18:41:11] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-18 18:41:12] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2023-03-18 18:41:12] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-03-18 18:41:12] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-18 18:41:12] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-18 18:41:12] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-18 18:41:12] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2023-03-18 18:41:13] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-18 18:41:13] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2023-03-18 18:41:13] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-18 18:41:13] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-18 18:41:13] [INFO ] Trap strengthening (SAT) tested/added 135/134 trap constraints in 24299 ms
[2023-03-18 18:41:14] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-18 18:41:14] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-18 18:41:14] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-18 18:41:14] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-18 18:41:14] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-18 18:41:15] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-18 18:41:15] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-18 18:41:15] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-18 18:41:15] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-18 18:41:15] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-18 18:41:15] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-18 18:41:16] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-03-18 18:41:16] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2023-03-18 18:41:16] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-18 18:41:16] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2023-03-18 18:41:16] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-03-18 18:41:16] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-18 18:41:17] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-18 18:41:18] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-18 18:41:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-18 18:41:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-18 18:41:18] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4191 ms
[2023-03-18 18:41:18] [INFO ] After 30707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 895 ms.
[2023-03-18 18:41:19] [INFO ] After 31748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 18:41:19] [INFO ] Flatten gal took : 91 ms
[2023-03-18 18:41:19] [INFO ] Flatten gal took : 64 ms
[2023-03-18 18:41:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4906079449341037950.gal : 9 ms
[2023-03-18 18:41:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10777066387612826254.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4906079449341037950.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10777066387612826254.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10777066387612826254.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 309
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :309 after 2715
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2715 after 48770
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :48770 after 562628
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :562628 after 7.03127e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :7.03127e+06 after 5.11895e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5.11895e+08 after 5.23357e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :5.23357e+10 after 6.14216e+12
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :6.14216e+12 after 3.32683e+15
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :3.32683e+15 after 2.8276e+20
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :2.8276e+20 after 2.21296e+28
Detected timeout of ITS tools.
[2023-03-18 18:41:34] [INFO ] Flatten gal took : 74 ms
[2023-03-18 18:41:34] [INFO ] Applying decomposition
[2023-03-18 18:41:34] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15632364144339059070.txt' '-o' '/tmp/graph15632364144339059070.bin' '-w' '/tmp/graph15632364144339059070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15632364144339059070.bin' '-l' '-1' '-v' '-w' '/tmp/graph15632364144339059070.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:41:34] [INFO ] Decomposing Gal with order
[2023-03-18 18:41:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:41:35] [INFO ] Removed a total of 889 redundant transitions.
[2023-03-18 18:41:35] [INFO ] Flatten gal took : 136 ms
[2023-03-18 18:41:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 801 labels/synchronizations in 61 ms.
[2023-03-18 18:41:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12061285544849481720.gal : 11 ms
[2023-03-18 18:41:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9074684327994410301.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12061285544849481720.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9074684327994410301.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9074684327994410301.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :8 after 16
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :16 after 25133
Invariant property ShieldRVs-PT-040A-ReachabilityFireability-04 does not hold.
Invariant property ShieldRVs-PT-040A-ReachabilityFireability-00 does not hold.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25133 after 2.4727e+38
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14782961088366482180
[2023-03-18 18:41:50] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14782961088366482180
Running compilation step : cd /tmp/ltsmin14782961088366482180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1907 ms.
Running link step : cd /tmp/ltsmin14782961088366482180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14782961088366482180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldRVsPT040AReachabilityFireability05==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 18:42:05] [INFO ] Flatten gal took : 69 ms
[2023-03-18 18:42:05] [INFO ] Applying decomposition
[2023-03-18 18:42:05] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6269619249395460207.txt' '-o' '/tmp/graph6269619249395460207.bin' '-w' '/tmp/graph6269619249395460207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6269619249395460207.bin' '-l' '-1' '-v' '-w' '/tmp/graph6269619249395460207.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:42:05] [INFO ] Decomposing Gal with order
[2023-03-18 18:42:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:42:05] [INFO ] Removed a total of 837 redundant transitions.
[2023-03-18 18:42:05] [INFO ] Flatten gal took : 51 ms
[2023-03-18 18:42:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 844 labels/synchronizations in 34 ms.
[2023-03-18 18:42:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16471411453398226096.gal : 8 ms
[2023-03-18 18:42:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12998265807407235074.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16471411453398226096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12998265807407235074.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12998265807407235074.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 38
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 19:12:09] [INFO ] Flatten gal took : 698 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17887786435021315146
[2023-03-18 19:12:10] [INFO ] Computing symmetric may disable matrix : 762 transitions.
[2023-03-18 19:12:10] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:12:10] [INFO ] Computing symmetric may enable matrix : 762 transitions.
[2023-03-18 19:12:10] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:12:10] [INFO ] Applying decomposition
[2023-03-18 19:12:11] [INFO ] Flatten gal took : 872 ms
[2023-03-18 19:12:12] [INFO ] Computing Do-Not-Accords matrix : 762 transitions.
[2023-03-18 19:12:12] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:12:12] [INFO ] Built C files in 2178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17887786435021315146
Running compilation step : cd /tmp/ltsmin17887786435021315146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3880317112974451621.txt' '-o' '/tmp/graph3880317112974451621.bin' '-w' '/tmp/graph3880317112974451621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3880317112974451621.bin' '-l' '-1' '-v' '-w' '/tmp/graph3880317112974451621.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:12:12] [INFO ] Decomposing Gal with order
[2023-03-18 19:12:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:12:12] [INFO ] Removed a total of 883 redundant transitions.
[2023-03-18 19:12:12] [INFO ] Flatten gal took : 97 ms
[2023-03-18 19:12:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 824 labels/synchronizations in 148 ms.
[2023-03-18 19:12:13] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15798433762278214217.gal : 31 ms
[2023-03-18 19:12:13] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8987938141135311394.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability15798433762278214217.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8987938141135311394.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability8987938141135311394.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 8
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :8 after 1461
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1461 after 7.39154e+07
Compilation finished in 2713 ms.
Running link step : cd /tmp/ltsmin17887786435021315146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin17887786435021315146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040AReachabilityFireability00==true'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.143: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.143: Initializing POR dependencies: labels 765, guards 762
pins2lts-mc-linux64( 7/ 8), 0.144: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 8.353: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 1/ 8), 8.368: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 8.367: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 8.367: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.370: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 8.367: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.370: There are 765 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 8.370: State length is 562, there are 762 groups
pins2lts-mc-linux64( 0/ 8), 8.370: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 8.370: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 8.370: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 8.370: Visible groups: 0 / 762, labels: 1 / 765
pins2lts-mc-linux64( 0/ 8), 8.370: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 8.370: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 8.368: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 8.370: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 8.369: "ShieldRVsPT040AReachabilityFireability00==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 8.461: ~10 levels ~960 states ~3936 transitions
pins2lts-mc-linux64( 0/ 8), 8.543: ~12 levels ~1920 states ~8560 transitions
pins2lts-mc-linux64( 0/ 8), 8.675: ~13 levels ~3840 states ~18856 transitions
pins2lts-mc-linux64( 0/ 8), 8.994: ~15 levels ~7680 states ~41288 transitions
pins2lts-mc-linux64( 0/ 8), 9.446: ~16 levels ~15360 states ~85272 transitions
pins2lts-mc-linux64( 1/ 8), 10.425: ~14 levels ~30720 states ~173392 transitions
pins2lts-mc-linux64( 1/ 8), 12.202: ~15 levels ~61440 states ~373496 transitions
pins2lts-mc-linux64( 1/ 8), 15.896: ~16 levels ~122880 states ~788608 transitions
pins2lts-mc-linux64( 1/ 8), 23.108: ~17 levels ~245760 states ~1669360 transitions
pins2lts-mc-linux64( 1/ 8), 37.655: ~18 levels ~491520 states ~3465712 transitions
pins2lts-mc-linux64( 1/ 8), 67.399: ~19 levels ~983040 states ~7312224 transitions
pins2lts-mc-linux64( 1/ 8), 128.845: ~20 levels ~1966080 states ~15029464 transitions
pins2lts-mc-linux64( 1/ 8), 259.317: ~21 levels ~3932160 states ~31653720 transitions
pins2lts-mc-linux64( 6/ 8), 494.618: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 494.865:
pins2lts-mc-linux64( 0/ 8), 494.865: mean standard work distribution: 4.8% (states) 1.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 494.865:
pins2lts-mc-linux64( 0/ 8), 494.865: Explored 6493104 states 57329893 transitions, fanout: 8.829
pins2lts-mc-linux64( 0/ 8), 494.865: Total exploration time 486.490 sec (486.260 sec minimum, 486.356 sec on average)
pins2lts-mc-linux64( 0/ 8), 494.865: States per second: 13347, Transitions per second: 117844
pins2lts-mc-linux64( 0/ 8), 494.865: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 494.865:
pins2lts-mc-linux64( 0/ 8), 494.865: Queue width: 8B, total height: 6422774, memory: 49.00MB
pins2lts-mc-linux64( 0/ 8), 494.865: Tree memory: 354.5MB, 28.8 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 494.865: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 494.865: Stored 835 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 494.865: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 494.865: Est. total memory use: 403.5MB (~1073.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17887786435021315146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040AReachabilityFireability00==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17887786435021315146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldRVsPT040AReachabilityFireability00==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 144672 kB
After kill :
MemTotal: 16393356 kB
MemFree: 11453244 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r421-tajo-167905974800135"
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 ;