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

About the Execution of ITS-Tools for ShieldPPPt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16225.348 3600000.00 9605071.00 247456.20 TF??TT??TT???T?F normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800687.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800687
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 955K 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 ShieldPPPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679222012822

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=ShieldPPPt-PT-050B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 10:33:34] [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-19 10:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:33:35] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2023-03-19 10:33:35] [INFO ] Transformed 3903 places.
[2023-03-19 10:33:35] [INFO ] Transformed 3553 transitions.
[2023-03-19 10:33:35] [INFO ] Found NUPN structural information;
[2023-03-19 10:33:35] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 490 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 10:33:36] [INFO ] Flatten gal took : 307 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
[2023-03-19 10:33:36] [INFO ] Flatten gal took : 168 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
[2023-03-19 10:33:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11455084611463118474.gal : 52 ms
[2023-03-19 10:33:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality186945261572477140.prop : 2 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/ReachabilityCardinality11455084611463118474.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality186945261572477140.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0

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 50 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3553 rows 3903 cols
Loading property file /tmp/ReachabilityCardinality186945261572477140.prop.
[2023-03-19 10:33:36] [INFO ] Computed 551 place invariants in 38 ms
[2023-03-19 10:33:38] [INFO ] [Real]Absence check using 551 positive place invariants in 392 ms returned sat
[2023-03-19 10:33:38] [INFO ] After 1873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 10:33:40] [INFO ] [Nat]Absence check using 551 positive place invariants in 307 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 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 58
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :58 after 691
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :691 after 17563
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :17563 after 2.501e+08
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-09 is true.
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :2.501e+08 after 4.01557e+14
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-08 is true.
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :4.01557e+14 after 1.58544e+23
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1.58544e+23 after 3.22108e+30
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :3.22108e+30 after 2.60966e+49
[2023-03-19 10:33:55] [INFO ] After 13736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-19 10:33:56] [INFO ] Deduced a trap composed of 25 places in 1257 ms of which 9 ms to minimize.
[2023-03-19 10:33:58] [INFO ] Deduced a trap composed of 24 places in 1323 ms of which 6 ms to minimize.
[2023-03-19 10:33:59] [INFO ] Deduced a trap composed of 29 places in 1225 ms of which 2 ms to minimize.
[2023-03-19 10:34:01] [INFO ] Deduced a trap composed of 17 places in 1017 ms of which 4 ms to minimize.
[2023-03-19 10:34:02] [INFO ] Deduced a trap composed of 22 places in 999 ms of which 3 ms to minimize.
[2023-03-19 10:34:03] [INFO ] Deduced a trap composed of 19 places in 1090 ms of which 3 ms to minimize.
[2023-03-19 10:34:04] [INFO ] Deduced a trap composed of 14 places in 1201 ms of which 3 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 10:34:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:34:04] [INFO ] After 26027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 2124 ms.
Support contains 290 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 736 transitions
Trivial Post-agglo rules discarded 736 transitions
Performed 736 trivial Post agglomeration. Transition count delta: 736
Iterating post reduction 0 with 736 rules applied. Total rules applied 736 place count 3903 transition count 2817
Reduce places removed 736 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 738 rules applied. Total rules applied 1474 place count 3167 transition count 2815
Reduce places removed 1 places and 0 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Iterating post reduction 2 with 78 rules applied. Total rules applied 1552 place count 3166 transition count 2738
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1629 place count 3089 transition count 2738
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 225 Pre rules applied. Total rules applied 1629 place count 3089 transition count 2513
Deduced a syphon composed of 225 places in 7 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 4 with 450 rules applied. Total rules applied 2079 place count 2864 transition count 2513
Discarding 299 places :
Symmetric choice reduction at 4 with 299 rule applications. Total rules 2378 place count 2565 transition count 2214
Iterating global reduction 4 with 299 rules applied. Total rules applied 2677 place count 2565 transition count 2214
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 98 Pre rules applied. Total rules applied 2677 place count 2565 transition count 2116
Deduced a syphon composed of 98 places in 15 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 2873 place count 2467 transition count 2116
Performed 733 Post agglomeration using F-continuation condition.Transition count delta: 733
Deduced a syphon composed of 733 places in 4 ms
Reduce places removed 733 places and 0 transitions.
Iterating global reduction 4 with 1466 rules applied. Total rules applied 4339 place count 1734 transition count 1383
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4541 place count 1633 transition count 1383
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 4549 place count 1629 transition count 1383
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 4558 place count 1629 transition count 1374
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 4567 place count 1620 transition count 1374
Partial Free-agglomeration rule applied 121 times.
Drop transitions removed 121 transitions
Iterating global reduction 5 with 121 rules applied. Total rules applied 4688 place count 1620 transition count 1374
Applied a total of 4688 rules in 1228 ms. Remains 1620 /3903 variables (removed 2283) and now considering 1374/3553 (removed 2179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1229 ms. Remains : 1620/3903 places, 1374/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 12) seen :1
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 75438 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75438 steps, saw 38993 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1374 rows 1620 cols
[2023-03-19 10:34:12] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-19 10:34:13] [INFO ] [Real]Absence check using 551 positive place invariants in 186 ms returned sat
[2023-03-19 10:34:13] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:34:14] [INFO ] [Nat]Absence check using 551 positive place invariants in 159 ms returned sat
[2023-03-19 10:34:17] [INFO ] After 2407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:34:17] [INFO ] State equation strengthened by 203 read => feed constraints.
[2023-03-19 10:34:20] [INFO ] After 2943ms SMT Verify possible using 203 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:34:20] [INFO ] Deduced a trap composed of 9 places in 482 ms of which 2 ms to minimize.
[2023-03-19 10:34:21] [INFO ] Deduced a trap composed of 9 places in 467 ms of which 1 ms to minimize.
[2023-03-19 10:34:21] [INFO ] Deduced a trap composed of 5 places in 467 ms of which 2 ms to minimize.
[2023-03-19 10:34:22] [INFO ] Deduced a trap composed of 6 places in 445 ms of which 1 ms to minimize.
[2023-03-19 10:34:22] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 1 ms to minimize.
[2023-03-19 10:34:23] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 1 ms to minimize.
[2023-03-19 10:34:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3038 ms
[2023-03-19 10:34:24] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 1 ms to minimize.
[2023-03-19 10:34:24] [INFO ] Deduced a trap composed of 8 places in 378 ms of which 1 ms to minimize.
[2023-03-19 10:34:25] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 1 ms to minimize.
[2023-03-19 10:34:25] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2023-03-19 10:34:25] [INFO ] Deduced a trap composed of 9 places in 396 ms of which 1 ms to minimize.
[2023-03-19 10:34:26] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 1 ms to minimize.
[2023-03-19 10:34:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2665 ms
[2023-03-19 10:34:27] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2023-03-19 10:34:27] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 1 ms to minimize.
[2023-03-19 10:34:27] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2023-03-19 10:34:28] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2023-03-19 10:34:28] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 1 ms to minimize.
[2023-03-19 10:34:28] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2023-03-19 10:34:29] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 4 ms to minimize.
[2023-03-19 10:34:29] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2023-03-19 10:34:30] [INFO ] Deduced a trap composed of 14 places in 341 ms of which 1 ms to minimize.
[2023-03-19 10:34:30] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 1 ms to minimize.
[2023-03-19 10:34:30] [INFO ] Deduced a trap composed of 16 places in 354 ms of which 0 ms to minimize.
[2023-03-19 10:34:31] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 2 ms to minimize.
[2023-03-19 10:34:31] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 1 ms to minimize.
[2023-03-19 10:34:31] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 1 ms to minimize.
[2023-03-19 10:34:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5374 ms
[2023-03-19 10:34:33] [INFO ] Deduced a trap composed of 17 places in 498 ms of which 18 ms to minimize.
[2023-03-19 10:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2023-03-19 10:34:33] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 0 ms to minimize.
[2023-03-19 10:34:34] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 0 ms to minimize.
[2023-03-19 10:34:34] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2023-03-19 10:34:34] [INFO ] Deduced a trap composed of 8 places in 304 ms of which 1 ms to minimize.
[2023-03-19 10:34:35] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 1 ms to minimize.
[2023-03-19 10:34:35] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 0 ms to minimize.
[2023-03-19 10:34:36] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 1 ms to minimize.
[2023-03-19 10:34:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2817 ms
[2023-03-19 10:34:36] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 1 ms to minimize.
[2023-03-19 10:34:37] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 0 ms to minimize.
[2023-03-19 10:34:37] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 0 ms to minimize.
[2023-03-19 10:34:38] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2023-03-19 10:34:38] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2023-03-19 10:34:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2031 ms
[2023-03-19 10:34:38] [INFO ] Deduced a trap composed of 11 places in 345 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-19 10:34:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:34:38] [INFO ] After 25365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 182 ms.
Support contains 252 out of 1620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1620/1620 places, 1374/1374 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1620 transition count 1370
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1616 transition count 1369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1615 transition count 1369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 10 place count 1615 transition count 1359
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 30 place count 1605 transition count 1359
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 82 place count 1579 transition count 1333
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 94 place count 1573 transition count 1333
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 1573 transition count 1331
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 1571 transition count 1331
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 1571 transition count 1331
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 1570 transition count 1330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 1569 transition count 1330
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 104 place count 1569 transition count 1328
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 108 place count 1567 transition count 1328
Applied a total of 108 rules in 401 ms. Remains 1567 /1620 variables (removed 53) and now considering 1328/1374 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 1567/1620 places, 1328/1374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 78944 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78944 steps, saw 41740 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1328 rows 1567 cols
[2023-03-19 10:34:43] [INFO ] Computed 550 place invariants in 6 ms
[2023-03-19 10:34:44] [INFO ] [Real]Absence check using 550 positive place invariants in 287 ms returned sat
[2023-03-19 10:34:44] [INFO ] After 979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:34:45] [INFO ] [Nat]Absence check using 550 positive place invariants in 260 ms returned sat
[2023-03-19 10:34:48] [INFO ] After 2174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:34:48] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-19 10:34:50] [INFO ] After 2517ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:34:51] [INFO ] Deduced a trap composed of 10 places in 506 ms of which 2 ms to minimize.
[2023-03-19 10:34:52] [INFO ] Deduced a trap composed of 12 places in 624 ms of which 2 ms to minimize.
[2023-03-19 10:34:52] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 1 ms to minimize.
[2023-03-19 10:34:53] [INFO ] Deduced a trap composed of 13 places in 441 ms of which 1 ms to minimize.
[2023-03-19 10:34:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2516 ms
[2023-03-19 10:34:54] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 1 ms to minimize.
[2023-03-19 10:34:55] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-19 10:34:55] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2023-03-19 10:34:55] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-19 10:34:56] [INFO ] Deduced a trap composed of 6 places in 381 ms of which 11 ms to minimize.
[2023-03-19 10:34:56] [INFO ] Deduced a trap composed of 9 places in 481 ms of which 2 ms to minimize.
[2023-03-19 10:34:57] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 0 ms to minimize.
[2023-03-19 10:34:57] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2023-03-19 10:34:58] [INFO ] Deduced a trap composed of 6 places in 327 ms of which 0 ms to minimize.
[2023-03-19 10:34:58] [INFO ] Deduced a trap composed of 16 places in 359 ms of which 0 ms to minimize.
[2023-03-19 10:34:58] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 0 ms to minimize.
[2023-03-19 10:34:59] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2023-03-19 10:34:59] [INFO ] Deduced a trap composed of 8 places in 524 ms of which 1 ms to minimize.
[2023-03-19 10:35:00] [INFO ] Deduced a trap composed of 19 places in 365 ms of which 1 ms to minimize.
[2023-03-19 10:35:01] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 1 ms to minimize.
[2023-03-19 10:35:01] [INFO ] Deduced a trap composed of 12 places in 367 ms of which 1 ms to minimize.
[2023-03-19 10:35:01] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 9 ms to minimize.
[2023-03-19 10:35:02] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 1 ms to minimize.
[2023-03-19 10:35:02] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 0 ms to minimize.
[2023-03-19 10:35:02] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 1 ms to minimize.
[2023-03-19 10:35:03] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8671 ms
[2023-03-19 10:35:03] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 1 ms to minimize.
[2023-03-19 10:35:04] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 1 ms to minimize.
[2023-03-19 10:35:04] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 1 ms to minimize.
[2023-03-19 10:35:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1755 ms
[2023-03-19 10:35:05] [INFO ] Deduced a trap composed of 11 places in 452 ms of which 1 ms to minimize.
[2023-03-19 10:35:06] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 0 ms to minimize.
[2023-03-19 10:35:06] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2023-03-19 10:35:07] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 2 ms to minimize.
[2023-03-19 10:35:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1915 ms
[2023-03-19 10:35:07] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-19 10:35:08] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 2 ms to minimize.
[2023-03-19 10:35:08] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 1 ms to minimize.
[2023-03-19 10:35:10] [INFO ] Deduced a trap composed of 11 places in 1228 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 10:35:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:35:10] [INFO ] After 25298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 155 ms.
Support contains 252 out of 1567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1328/1328 transitions.
Applied a total of 0 rules in 75 ms. Remains 1567 /1567 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1567/1567 places, 1328/1328 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1328/1328 transitions.
Applied a total of 0 rules in 37 ms. Remains 1567 /1567 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2023-03-19 10:35:10] [INFO ] Invariant cache hit.
[2023-03-19 10:35:11] [INFO ] Implicit Places using invariants in 723 ms returned [1544, 1548]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 725 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1565/1567 places, 1328/1328 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1563 transition count 1326
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1563 transition count 1326
Applied a total of 4 rules in 63 ms. Remains 1563 /1565 variables (removed 2) and now considering 1326/1328 (removed 2) transitions.
// Phase 1: matrix 1326 rows 1563 cols
[2023-03-19 10:35:11] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-19 10:35:12] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-19 10:35:12] [INFO ] Invariant cache hit.
[2023-03-19 10:35:13] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 10:35:17] [INFO ] Implicit Places using invariants and state equation in 5141 ms returned []
Implicit Place search using SMT with State Equation took 6161 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1563/1567 places, 1326/1328 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6986 ms. Remains : 1563/1567 places, 1326/1328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 75219 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75219 steps, saw 39852 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-19 10:35:21] [INFO ] Invariant cache hit.
[2023-03-19 10:35:22] [INFO ] [Real]Absence check using 548 positive place invariants in 288 ms returned sat
[2023-03-19 10:35:22] [INFO ] After 860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:35:23] [INFO ] [Nat]Absence check using 548 positive place invariants in 215 ms returned sat
[2023-03-19 10:35:26] [INFO ] After 2147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:35:26] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 10:35:28] [INFO ] After 2649ms SMT Verify possible using 202 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:35:29] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 1 ms to minimize.
[2023-03-19 10:35:29] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 0 ms to minimize.
[2023-03-19 10:35:29] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-19 10:35:30] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 1 ms to minimize.
[2023-03-19 10:35:30] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 1 ms to minimize.
[2023-03-19 10:35:31] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 0 ms to minimize.
[2023-03-19 10:35:31] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 0 ms to minimize.
[2023-03-19 10:35:31] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 1 ms to minimize.
[2023-03-19 10:35:32] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2023-03-19 10:35:32] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 0 ms to minimize.
[2023-03-19 10:35:33] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
[2023-03-19 10:35:34] [INFO ] Deduced a trap composed of 7 places in 789 ms of which 2 ms to minimize.
[2023-03-19 10:35:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5269 ms
[2023-03-19 10:35:35] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 1 ms to minimize.
[2023-03-19 10:35:35] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2023-03-19 10:35:36] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 1 ms to minimize.
[2023-03-19 10:35:36] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 0 ms to minimize.
[2023-03-19 10:35:37] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 0 ms to minimize.
[2023-03-19 10:35:37] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 0 ms to minimize.
[2023-03-19 10:35:37] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2023-03-19 10:35:38] [INFO ] Deduced a trap composed of 16 places in 335 ms of which 1 ms to minimize.
[2023-03-19 10:35:38] [INFO ] Deduced a trap composed of 14 places in 340 ms of which 2 ms to minimize.
[2023-03-19 10:35:39] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 2 ms to minimize.
[2023-03-19 10:35:39] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 0 ms to minimize.
[2023-03-19 10:35:39] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2023-03-19 10:35:40] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-19 10:35:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5254 ms
[2023-03-19 10:35:40] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-19 10:35:41] [INFO ] Deduced a trap composed of 8 places in 404 ms of which 1 ms to minimize.
[2023-03-19 10:35:41] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2023-03-19 10:35:42] [INFO ] Deduced a trap composed of 7 places in 311 ms of which 1 ms to minimize.
[2023-03-19 10:35:42] [INFO ] Deduced a trap composed of 8 places in 328 ms of which 1 ms to minimize.
[2023-03-19 10:35:42] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 1 ms to minimize.
[2023-03-19 10:35:42] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 1 ms to minimize.
[2023-03-19 10:35:43] [INFO ] Deduced a trap composed of 12 places in 316 ms of which 1 ms to minimize.
[2023-03-19 10:35:43] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 1 ms to minimize.
[2023-03-19 10:35:44] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2023-03-19 10:35:44] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 1 ms to minimize.
[2023-03-19 10:35:45] [INFO ] Deduced a trap composed of 16 places in 421 ms of which 1 ms to minimize.
[2023-03-19 10:35:45] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 0 ms to minimize.
[2023-03-19 10:35:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5012 ms
[2023-03-19 10:35:46] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 0 ms to minimize.
[2023-03-19 10:35:46] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 2 ms to minimize.
[2023-03-19 10:35:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 929 ms
[2023-03-19 10:35:47] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 14 ms to minimize.
[2023-03-19 10:35:47] [INFO ] Deduced a trap composed of 5 places in 333 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 10:35:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:35:47] [INFO ] After 25119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 395 ms.
Support contains 252 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1326/1326 transitions.
Applied a total of 0 rules in 46 ms. Remains 1563 /1563 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1563/1563 places, 1326/1326 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1326/1326 transitions.
Applied a total of 0 rules in 46 ms. Remains 1563 /1563 variables (removed 0) and now considering 1326/1326 (removed 0) transitions.
[2023-03-19 10:35:48] [INFO ] Invariant cache hit.
[2023-03-19 10:35:48] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-19 10:35:48] [INFO ] Invariant cache hit.
[2023-03-19 10:35:49] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-19 10:35:53] [INFO ] Implicit Places using invariants and state equation in 5155 ms returned []
Implicit Place search using SMT with State Equation took 5852 ms to find 0 implicit places.
[2023-03-19 10:35:54] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-19 10:35:54] [INFO ] Invariant cache hit.
[2023-03-19 10:35:54] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6828 ms. Remains : 1563/1563 places, 1326/1326 transitions.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 0 with 201 rules applied. Total rules applied 201 place count 1563 transition count 1326
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 204 place count 1563 transition count 1323
Applied a total of 204 rules in 106 ms. Remains 1563 /1563 variables (removed 0) and now considering 1323/1326 (removed 3) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1323 rows 1563 cols
[2023-03-19 10:35:54] [INFO ] Computed 548 place invariants in 5 ms
[2023-03-19 10:35:55] [INFO ] [Real]Absence check using 548 positive place invariants in 205 ms returned sat
[2023-03-19 10:35:55] [INFO ] After 649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:35:56] [INFO ] [Nat]Absence check using 548 positive place invariants in 167 ms returned sat
[2023-03-19 10:35:58] [INFO ] After 1973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:35:58] [INFO ] State equation strengthened by 159 read => feed constraints.
[2023-03-19 10:36:00] [INFO ] After 2091ms SMT Verify possible using 159 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:36:01] [INFO ] Deduced a trap composed of 11 places in 542 ms of which 1 ms to minimize.
[2023-03-19 10:36:02] [INFO ] Deduced a trap composed of 6 places in 934 ms of which 1 ms to minimize.
[2023-03-19 10:36:03] [INFO ] Deduced a trap composed of 8 places in 510 ms of which 1 ms to minimize.
[2023-03-19 10:36:04] [INFO ] Deduced a trap composed of 6 places in 551 ms of which 2 ms to minimize.
[2023-03-19 10:36:04] [INFO ] Deduced a trap composed of 7 places in 652 ms of which 1 ms to minimize.
[2023-03-19 10:36:05] [INFO ] Deduced a trap composed of 11 places in 727 ms of which 1 ms to minimize.
[2023-03-19 10:36:06] [INFO ] Deduced a trap composed of 8 places in 514 ms of which 1 ms to minimize.
[2023-03-19 10:36:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5154 ms
[2023-03-19 10:36:07] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 1 ms to minimize.
[2023-03-19 10:36:07] [INFO ] Deduced a trap composed of 7 places in 492 ms of which 1 ms to minimize.
[2023-03-19 10:36:08] [INFO ] Deduced a trap composed of 8 places in 421 ms of which 1 ms to minimize.
[2023-03-19 10:36:08] [INFO ] Deduced a trap composed of 20 places in 457 ms of which 1 ms to minimize.
[2023-03-19 10:36:09] [INFO ] Deduced a trap composed of 5 places in 429 ms of which 1 ms to minimize.
[2023-03-19 10:36:09] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2023-03-19 10:36:10] [INFO ] Deduced a trap composed of 17 places in 423 ms of which 0 ms to minimize.
[2023-03-19 10:36:10] [INFO ] Deduced a trap composed of 15 places in 454 ms of which 1 ms to minimize.
[2023-03-19 10:36:11] [INFO ] Deduced a trap composed of 9 places in 455 ms of which 1 ms to minimize.
[2023-03-19 10:36:12] [INFO ] Deduced a trap composed of 11 places in 803 ms of which 1 ms to minimize.
[2023-03-19 10:36:13] [INFO ] Deduced a trap composed of 14 places in 714 ms of which 37 ms to minimize.
[2023-03-19 10:36:13] [INFO ] Deduced a trap composed of 12 places in 479 ms of which 1 ms to minimize.
[2023-03-19 10:36:14] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 1 ms to minimize.
[2023-03-19 10:36:14] [INFO ] Deduced a trap composed of 9 places in 422 ms of which 1 ms to minimize.
[2023-03-19 10:36:15] [INFO ] Deduced a trap composed of 14 places in 487 ms of which 0 ms to minimize.
[2023-03-19 10:36:15] [INFO ] Deduced a trap composed of 11 places in 610 ms of which 1 ms to minimize.
[2023-03-19 10:36:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9241 ms
[2023-03-19 10:36:16] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-19 10:36:16] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2023-03-19 10:36:17] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-19 10:36:17] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-19 10:36:17] [INFO ] Deduced a trap composed of 14 places in 301 ms of which 1 ms to minimize.
[2023-03-19 10:36:18] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 1 ms to minimize.
[2023-03-19 10:36:18] [INFO ] Deduced a trap composed of 12 places in 320 ms of which 0 ms to minimize.
[2023-03-19 10:36:19] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 1 ms to minimize.
[2023-03-19 10:36:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3000 ms
[2023-03-19 10:36:19] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 0 ms to minimize.
[2023-03-19 10:36:19] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2023-03-19 10:36:20] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 1 ms to minimize.
[2023-03-19 10:36:20] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2023-03-19 10:36:21] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 1 ms to minimize.
[2023-03-19 10:36:21] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 0 ms to minimize.
[2023-03-19 10:36:21] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 0 ms to minimize.
[2023-03-19 10:36:22] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 1 ms to minimize.
[2023-03-19 10:36:22] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 1 ms to minimize.
[2023-03-19 10:36:23] [INFO ] Deduced a trap composed of 15 places in 559 ms of which 1 ms to minimize.
[2023-03-19 10:36:23] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 1 ms to minimize.
[2023-03-19 10:36:24] [INFO ] Deduced a trap composed of 15 places in 405 ms of which 1 ms to minimize.
[2023-03-19 10:36:24] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 1 ms to minimize.
[2023-03-19 10:36:24] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 0 ms to minimize.
[2023-03-19 10:36:25] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2023-03-19 10:36:25] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 1 ms to minimize.
[2023-03-19 10:36:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6540 ms
[2023-03-19 10:36:26] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 1 ms to minimize.
[2023-03-19 10:36:26] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 1 ms to minimize.
[2023-03-19 10:36:27] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 1 ms to minimize.
[2023-03-19 10:36:27] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 1 ms to minimize.
[2023-03-19 10:36:28] [INFO ] Deduced a trap composed of 20 places in 375 ms of which 1 ms to minimize.
[2023-03-19 10:36:28] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 1 ms to minimize.
[2023-03-19 10:36:29] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 1 ms to minimize.
[2023-03-19 10:36:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3161 ms
[2023-03-19 10:36:29] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 1 ms to minimize.
[2023-03-19 10:36:30] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2023-03-19 10:36:30] [INFO ] Deduced a trap composed of 7 places in 427 ms of which 1 ms to minimize.
[2023-03-19 10:36:31] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 0 ms to minimize.
[2023-03-19 10:36:31] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 1 ms to minimize.
[2023-03-19 10:36:31] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 0 ms to minimize.
[2023-03-19 10:36:32] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 1 ms to minimize.
[2023-03-19 10:36:32] [INFO ] Deduced a trap composed of 6 places in 419 ms of which 1 ms to minimize.
[2023-03-19 10:36:33] [INFO ] Deduced a trap composed of 7 places in 349 ms of which 1 ms to minimize.
[2023-03-19 10:36:33] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 0 ms to minimize.
[2023-03-19 10:36:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4321 ms
[2023-03-19 10:36:34] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2023-03-19 10:36:34] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 1 ms to minimize.
[2023-03-19 10:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 882 ms
[2023-03-19 10:36:35] [INFO ] Deduced a trap composed of 7 places in 575 ms of which 1 ms to minimize.
[2023-03-19 10:36:35] [INFO ] Deduced a trap composed of 16 places in 362 ms of which 1 ms to minimize.
[2023-03-19 10:36:36] [INFO ] Deduced a trap composed of 21 places in 434 ms of which 1 ms to minimize.
[2023-03-19 10:36:36] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 1 ms to minimize.
[2023-03-19 10:36:37] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 1 ms to minimize.
[2023-03-19 10:36:37] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-19 10:36:38] [INFO ] Deduced a trap composed of 16 places in 602 ms of which 0 ms to minimize.
[2023-03-19 10:36:38] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 14 ms to minimize.
[2023-03-19 10:36:39] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 1 ms to minimize.
[2023-03-19 10:36:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4339 ms
[2023-03-19 10:36:39] [INFO ] Deduced a trap composed of 5 places in 325 ms of which 1 ms to minimize.
[2023-03-19 10:36:40] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-19 10:36:40] [INFO ] Deduced a trap composed of 6 places in 405 ms of which 1 ms to minimize.
[2023-03-19 10:36:41] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 0 ms to minimize.
[2023-03-19 10:36:41] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 1 ms to minimize.
[2023-03-19 10:36:42] [INFO ] Deduced a trap composed of 12 places in 489 ms of which 0 ms to minimize.
[2023-03-19 10:36:42] [INFO ] Deduced a trap composed of 12 places in 368 ms of which 1 ms to minimize.
[2023-03-19 10:36:42] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 2 ms to minimize.
[2023-03-19 10:36:43] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 0 ms to minimize.
[2023-03-19 10:36:44] [INFO ] Deduced a trap composed of 12 places in 419 ms of which 1 ms to minimize.
[2023-03-19 10:36:44] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 1 ms to minimize.
[2023-03-19 10:36:44] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 0 ms to minimize.
[2023-03-19 10:36:45] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2023-03-19 10:36:45] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 0 ms to minimize.
[2023-03-19 10:36:46] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 1 ms to minimize.
[2023-03-19 10:36:46] [INFO ] Deduced a trap composed of 18 places in 490 ms of which 0 ms to minimize.
[2023-03-19 10:36:47] [INFO ] Deduced a trap composed of 15 places in 544 ms of which 0 ms to minimize.
[2023-03-19 10:36:47] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 1 ms to minimize.
[2023-03-19 10:36:47] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8355 ms
[2023-03-19 10:36:48] [INFO ] Deduced a trap composed of 14 places in 332 ms of which 0 ms to minimize.
[2023-03-19 10:36:48] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2023-03-19 10:36:49] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 0 ms to minimize.
[2023-03-19 10:36:49] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 0 ms to minimize.
[2023-03-19 10:36:49] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2023-03-19 10:36:50] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 0 ms to minimize.
[2023-03-19 10:36:50] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 1 ms to minimize.
[2023-03-19 10:36:51] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 1 ms to minimize.
[2023-03-19 10:36:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3208 ms
[2023-03-19 10:36:51] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2023-03-19 10:36:52] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 1 ms to minimize.
[2023-03-19 10:36:52] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2023-03-19 10:36:53] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 1 ms to minimize.
[2023-03-19 10:36:53] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 0 ms to minimize.
[2023-03-19 10:36:53] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 0 ms to minimize.
[2023-03-19 10:36:54] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 1 ms to minimize.
[2023-03-19 10:36:54] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 1 ms to minimize.
[2023-03-19 10:36:54] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2023-03-19 10:36:55] [INFO ] Deduced a trap composed of 14 places in 312 ms of which 1 ms to minimize.
[2023-03-19 10:36:55] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 1 ms to minimize.
[2023-03-19 10:36:56] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 1 ms to minimize.
[2023-03-19 10:36:56] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2023-03-19 10:36:56] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 1 ms to minimize.
[2023-03-19 10:36:57] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 1 ms to minimize.
[2023-03-19 10:36:57] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 0 ms to minimize.
[2023-03-19 10:36:57] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 1 ms to minimize.
[2023-03-19 10:36:57] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6449 ms
[2023-03-19 10:36:58] [INFO ] After 59160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 2850 ms.
[2023-03-19 10:37:00] [INFO ] After 65214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-19 10:37:01] [INFO ] Flatten gal took : 89 ms
[2023-03-19 10:37:01] [INFO ] Flatten gal took : 51 ms
[2023-03-19 10:37:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11801374105964498470.gal : 10 ms
[2023-03-19 10:37:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9036772697707586780.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/ReachabilityCardinality11801374105964498470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9036772697707586780.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/ReachabilityCardinality9036772697707586780.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 13
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :13 after 16
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :16 after 17
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :17 after 27
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :27 after 115
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :115 after 371
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :371 after 37451
Detected timeout of ITS tools.
[2023-03-19 10:37:16] [INFO ] Flatten gal took : 53 ms
[2023-03-19 10:37:16] [INFO ] Applying decomposition
[2023-03-19 10:37:16] [INFO ] Flatten gal took : 48 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/graph1796062063500793635.txt' '-o' '/tmp/graph1796062063500793635.bin' '-w' '/tmp/graph1796062063500793635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1796062063500793635.bin' '-l' '-1' '-v' '-w' '/tmp/graph1796062063500793635.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:37:16] [INFO ] Decomposing Gal with order
[2023-03-19 10:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:37:16] [INFO ] Removed a total of 304 redundant transitions.
[2023-03-19 10:37:17] [INFO ] Flatten gal took : 178 ms
[2023-03-19 10:37:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 31 ms.
[2023-03-19 10:37:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15003296695448198399.gal : 20 ms
[2023-03-19 10:37:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9800620881053615329.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/ReachabilityCardinality15003296695448198399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9800620881053615329.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/ReachabilityCardinality9800620881053615329.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 8
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :8 after 26
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :26 after 2822
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :2822 after 136382
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :136382 after 3.56639e+10
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3.56639e+10 after 1.60487e+11
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1.60487e+11 after 1.01084e+20
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13499403515120268326
[2023-03-19 10:37:32] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13499403515120268326
Running compilation step : cd /tmp/ltsmin13499403515120268326;'/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 2894 ms.
Running link step : cd /tmp/ltsmin13499403515120268326;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin13499403515120268326;'/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' 'ShieldPPPtPT050BReachabilityFireability00==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-19 10:37:47] [INFO ] Flatten gal took : 89 ms
[2023-03-19 10:37:47] [INFO ] Applying decomposition
[2023-03-19 10:37:47] [INFO ] Flatten gal took : 123 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/graph7773830416476039126.txt' '-o' '/tmp/graph7773830416476039126.bin' '-w' '/tmp/graph7773830416476039126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7773830416476039126.bin' '-l' '-1' '-v' '-w' '/tmp/graph7773830416476039126.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:37:47] [INFO ] Decomposing Gal with order
[2023-03-19 10:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:37:48] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 10:37:48] [INFO ] Flatten gal took : 176 ms
[2023-03-19 10:37:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 10:37:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6436265975330867572.gal : 43 ms
[2023-03-19 10:37:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7351455241569604458.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/ReachabilityCardinality6436265975330867572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7351455241569604458.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 ...307
Loading property file /tmp/ReachabilityCardinality7351455241569604458.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :1 after 19986
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :19986 after 2.64884e+13
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 11:07:51] [INFO ] Flatten gal took : 606 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4825370251670367537
[2023-03-19 11:07:52] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2023-03-19 11:07:52] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 11:07:52] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2023-03-19 11:07:52] [INFO ] Computation of Complete enable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 11:07:52] [INFO ] Applying decomposition
[2023-03-19 11:07:52] [INFO ] Flatten gal took : 451 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/graph17572409641444823383.txt' '-o' '/tmp/graph17572409641444823383.bin' '-w' '/tmp/graph17572409641444823383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17572409641444823383.bin' '-l' '-1' '-v' '-w' '/tmp/graph17572409641444823383.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:07:56] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2023-03-19 11:07:56] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 11:07:56] [INFO ] Decomposing Gal with order
[2023-03-19 11:07:56] [INFO ] Built C files in 5038ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4825370251670367537
[2023-03-19 11:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin4825370251670367537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '65' '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'
[2023-03-19 11:07:57] [INFO ] Removed a total of 557 redundant transitions.
[2023-03-19 11:07:57] [INFO ] Flatten gal took : 100 ms
[2023-03-19 11:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 274 labels/synchronizations in 47 ms.
[2023-03-19 11:07:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15728647857636511822.gal : 16 ms
[2023-03-19 11:07:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5674832779207802532.prop : 2 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/ReachabilityFireability15728647857636511822.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5674832779207802532.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/ReachabilityFireability5674832779207802532.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :1 after 22
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :22 after 1147
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :1147 after 590827
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :590827 after 3.86889e+11
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-05 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-050B-ReachabilityFireability-01 does not hold.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-050B-ReachabilityFireability-00 is true.
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :6.03881e+31 after 4.00109e+62
Compilation finished in 4878 ms.
Running link step : cd /tmp/ltsmin4825370251670367537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability02==true'
WARNING : LTSmin timed out (>327 s) on command cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability02==true'
Running LTSmin : cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability03==true'
WARNING : LTSmin timed out (>327 s) on command cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability03==true'
Running LTSmin : cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability06==true'
WARNING : LTSmin timed out (>327 s) on command cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability06==true'
Running LTSmin : cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability07==true'
WARNING : LTSmin timed out (>327 s) on command cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability07==true'
Running LTSmin : cd /tmp/ltsmin4825370251670367537;'/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' 'ShieldPPPtPT050BReachabilityFireability10==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 449028 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16093212 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="ShieldPPPt-PT-050B"
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 ShieldPPPt-PT-050B, 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 r389-oct2-167903713800687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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