Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423200691.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is LamportFastMutEx-PT-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423200691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 206K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 420K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 265K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748885758489

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-7
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 17:35:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:36:00] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2025-06-02 17:36:00] [INFO ] Transformed 264 places.
[2025-06-02 17:36:00] [INFO ] Transformed 536 transitions.
[2025-06-02 17:36:00] [INFO ] Found NUPN structural information;
[2025-06-02 17:36:00] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2025-06-02 17:36:00] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 171 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2025-06-02 17:36:00] [INFO ] Computed 65 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:00] [INFO ] Implicit Places using invariants in 398 ms returned [135, 136, 138, 139, 140, 141]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 439 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 213/219 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 476 ms. Remains : 213/219 places, 462/462 transitions.
Support contains 171 out of 213 places after structural reductions.
[2025-06-02 17:36:01] [INFO ] Flatten gal took : 60 ms
[2025-06-02 17:36:01] [INFO ] Flatten gal took : 38 ms
[2025-06-02 17:36:01] [INFO ] Input system was already deterministic with 462 transitions.
RANDOM walk for 40000 steps (8 resets) in 1396 ms. (28 steps per ms) remains 1/19 properties
BEST_FIRST walk for 18191 steps (3 resets) in 88 ms. (204 steps per ms) remains 0/1 properties
Computed a total of 1 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&((p2 U G(p3)) U !(p3 U p0)))))'
Support contains 77 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:01] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 213 cols
[2025-06-02 17:36:01] [INFO ] Computed 59 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:02] [INFO ] Implicit Places using invariants in 181 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 197 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 520 ms :[(OR p1 p0), (OR p1 p0), true, p1, (NOT p3), (NOT p3), (AND (NOT p3) p0 p2), p0]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-00 finished in 813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (X(X(p1))&&(!p1 U p2))))'
Support contains 63 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 10 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:02] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:02] [INFO ] Implicit Places using invariants in 178 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-02
Product exploration explored 100000 steps with 3516 reset in 466 ms.
Product exploration explored 100000 steps with 3524 reset in 382 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (OR p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (NOT p0)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1)), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 155 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 17198 steps (3 resets) in 140 ms. (121 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (OR p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (NOT p0)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1)), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F p0)]
Knowledge based reduction with 16 factoid took 442 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1)]
[2025-06-02 17:36:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2025-06-02 17:36:05] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:36:06] [INFO ] [Real]Absence check using 58 positive place invariants in 78 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (OR p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p1), (X (NOT p0)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (OR p2 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p1)), (X (X (NOT p0))), (X (X (OR (AND (NOT p2) p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2)))), (F p0), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 16 factoid took 435 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-7-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-02 finished in 3942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&(!p0||X(p1))) U (G((X(p0)&&(!p0||X(p1))))||(X(p0)&&(!p0||X(p1))&&(p1 U (p2||G(p1)))))))'
Support contains 35 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 10 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:06] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 213 cols
[2025-06-02 17:36:06] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:06] [INFO ] Implicit Places using invariants in 205 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-04 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 7 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:07] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:07] [INFO ] Implicit Places using invariants in 190 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-05 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 21 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:07] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:07] [INFO ] Implicit Places using invariants in 178 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-06
Product exploration explored 100000 steps with 1089 reset in 285 ms.
Stack based approach found an accepted trace after 2273 steps with 25 reset with depth 261 and stack size 261 in 8 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-06 finished in 629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p0||(F(p1)&&F(p0))))))'
Support contains 63 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:36:08] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:36:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:08] [INFO ] Implicit Places using invariants in 156 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-07 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 213 transition count 456
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 207 transition count 456
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 201 transition count 450
Applied a total of 24 rules in 39 ms. Remains 201 /213 variables (removed 12) and now considering 450/462 (removed 12) transitions.
[2025-06-02 17:36:08] [INFO ] Flow matrix only has 324 transitions (discarded 126 similar events)
// Phase 1: matrix 324 rows 201 cols
[2025-06-02 17:36:08] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:08] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-02 17:36:08] [INFO ] Flow matrix only has 324 transitions (discarded 126 similar events)
[2025-06-02 17:36:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:08] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-02 17:36:09] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:36:09] [INFO ] Redundant transitions in 31 ms returned []
Running 443 sub problems to find dead transitions.
[2025-06-02 17:36:09] [INFO ] Flow matrix only has 324 transitions (discarded 126 similar events)
[2025-06-02 17:36:09] [INFO ] Invariant cache hit.
[2025-06-02 17:36:09] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 201/201 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 59/260 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 16 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 6 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 9 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:11] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 5 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 9 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:12] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 8 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/280 constraints. Problems are: Problem set: 23 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:14] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
Problem TDEAD127 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:15] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:16] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 8 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/300 constraints. Problems are: Problem set: 41 solved, 402 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:18] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:18] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:18] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:18] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:18] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:19] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:20] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 9 ms to minimize.
Problem TDEAD203 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/320 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:21] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:21] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:22] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:22] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:22] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:22] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:22] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:23] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:24] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:24] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:24] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:24] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:24] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:24] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 20/340 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:25] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:25] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:25] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:26] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:27] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:27] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:27] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:27] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:28] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:28] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:28] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 20/360 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:31] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:31] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:31] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:32] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:32] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:32] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:32] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:32] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:33] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:34] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:34] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:34] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:34] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 20/380 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:34] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:35] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:36] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:36] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:36] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:36] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:36] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:37] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:37] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:37] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:38] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:38] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:38] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:38] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:38] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:38] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 16/396 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/525 variables, and 396 constraints, problems are : Problem set: 42 solved, 401 unsolved in 30025 ms.
Refiners :[Domain max(s): 201/201 constraints, Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 0/201 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 136/136 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 9/203 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 105/308 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/308 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 7/201 variables, 50/358 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 7/365 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 31/396 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:43] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/397 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:44] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:45] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:45] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:45] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:46] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:46] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 7/404 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:48] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:48] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:48] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:48] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:48] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:50] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:51] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 7/411 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/411 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 11 (OVERLAPS) 324/525 variables, 201/612 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 49/661 constraints. Problems are: Problem set: 42 solved, 401 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 401/1062 constraints. Problems are: Problem set: 42 solved, 401 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 1062 constraints, problems are : Problem set: 42 solved, 401 unsolved in 30022 ms.
Refiners :[Domain max(s): 201/201 constraints, Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 201/201 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 401/443 constraints, Known Traps: 151/151 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60222ms problems are : Problem set: 42 solved, 401 unsolved
Search for dead transitions found 42 dead transitions in 60230ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 201/213 places, 408/462 transitions.
Applied a total of 0 rules in 13 ms. Remains 201 /201 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:37:09] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 60970 ms. Remains : 201/213 places, 408/462 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-10
Product exploration explored 100000 steps with 4033 reset in 241 ms.
Product exploration explored 100000 steps with 4151 reset in 406 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 29 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 408/408 transitions.
Applied a total of 0 rules in 18 ms. Remains 201 /201 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2025-06-02 17:37:10] [INFO ] Flow matrix only has 296 transitions (discarded 112 similar events)
// Phase 1: matrix 296 rows 201 cols
[2025-06-02 17:37:10] [INFO ] Computed 59 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:37:10] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 17:37:10] [INFO ] Flow matrix only has 296 transitions (discarded 112 similar events)
[2025-06-02 17:37:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:37:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:37:11] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:37:11] [INFO ] Redundant transitions in 3 ms returned []
Running 401 sub problems to find dead transitions.
[2025-06-02 17:37:11] [INFO ] Flow matrix only has 296 transitions (discarded 112 similar events)
[2025-06-02 17:37:11] [INFO ] Invariant cache hit.
[2025-06-02 17:37:11] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (OVERLAPS) 7/201 variables, 50/253 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:16] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:17] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:18] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:19] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:20] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:23] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:26] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:26] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:26] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:27] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:31] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:31] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:31] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:31] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:31] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:32] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:32] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:32] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:32] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:32] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:32] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:33] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:34] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:34] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 20/360 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:36] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:37] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:37] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:37] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:37] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:38] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:38] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:38] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:38] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:38] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:38] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:39] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:39] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:39] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 14/374 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:40] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:40] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/497 variables, and 376 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30018 ms.
Refiners :[Domain max(s): 201/201 constraints, Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 0/201 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 116/116 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 82/285 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 7/201 variables, 50/335 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 34/376 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:44] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:44] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:44] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:44] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:44] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:44] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:45] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:45] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:46] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:46] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:46] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:46] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:47] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:48] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 20/396 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:49] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:50] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:50] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:50] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:50] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:51] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:51] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:51] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:51] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 9/405 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:52] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:53] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:54] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:55] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:55] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 12 (OVERLAPS) 296/497 variables, 201/611 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 42/653 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 401/1054 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 1054 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30019 ms.
Refiners :[Domain max(s): 201/201 constraints, Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 201/201 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 150/150 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60833 ms. Remains : 201/201 places, 408/408 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 34 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3983 reset in 233 ms.
Product exploration explored 100000 steps with 4024 reset in 299 ms.
Built C files in :
/tmp/ltsmin17070144692725427783
[2025-06-02 17:38:12] [INFO ] Computing symmetric may disable matrix : 408 transitions.
[2025-06-02 17:38:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:38:12] [INFO ] Computing symmetric may enable matrix : 408 transitions.
[2025-06-02 17:38:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:38:12] [INFO ] Computing Do-Not-Accords matrix : 408 transitions.
[2025-06-02 17:38:12] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 17:38:12] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17070144692725427783
Running compilation step : cd /tmp/ltsmin17070144692725427783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1082 ms.
Running link step : cd /tmp/ltsmin17070144692725427783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin17070144692725427783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11965063566964193455.hoa' '--buchi-type=spotba'
LTSmin run took 1200 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-10 finished in 126766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 213 transition count 456
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 207 transition count 456
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 200 transition count 449
Applied a total of 26 rules in 25 ms. Remains 200 /213 variables (removed 13) and now considering 449/462 (removed 13) transitions.
[2025-06-02 17:38:15] [INFO ] Flow matrix only has 323 transitions (discarded 126 similar events)
// Phase 1: matrix 323 rows 200 cols
[2025-06-02 17:38:15] [INFO ] Computed 59 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:15] [INFO ] Implicit Places using invariants in 205 ms returned [128]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 207 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/213 places, 449/462 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 199 transition count 448
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 198 transition count 448
Applied a total of 2 rules in 12 ms. Remains 198 /199 variables (removed 1) and now considering 448/449 (removed 1) transitions.
[2025-06-02 17:38:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2025-06-02 17:38:15] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:15] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-02 17:38:15] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:38:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:38:16] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/213 places, 448/462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 860 ms. Remains : 198/213 places, 448/462 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 292 steps with 0 reset with depth 293 and stack size 293 in 2 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-13 finished in 1190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 213 /213 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:38:16] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 213 cols
[2025-06-02 17:38:16] [INFO ] Computed 59 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:16] [INFO ] Implicit Places using invariants in 185 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/213 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 212/213 places, 462/462 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-14
Product exploration explored 100000 steps with 6869 reset in 338 ms.
Product exploration explored 100000 steps with 6842 reset in 312 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 36545 steps (7 resets) in 261 ms. (139 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
[2025-06-02 17:38:18] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2025-06-02 17:38:18] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:38:18] [INFO ] [Real]Absence check using 58 positive place invariants in 50 ms returned sat
[2025-06-02 17:38:19] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2025-06-02 17:38:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:38:19] [INFO ] [Nat]Absence check using 58 positive place invariants in 37 ms returned sat
[2025-06-02 17:38:19] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-02 17:38:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:38:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:20] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:20] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:20] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:20] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 3 ms to minimize.
[2025-06-02 17:38:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 619 ms
[2025-06-02 17:38:20] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 18 ms.
[2025-06-02 17:38:22] [INFO ] Added : 220 causal constraints over 45 iterations in 1635 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2025-06-02 17:38:22] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:22] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 17:38:22] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:38:22] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2025-06-02 17:38:22] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2025-06-02 17:38:22] [INFO ] Invariant cache hit.
[2025-06-02 17:38:22] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 58/270 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:24] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:24] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 9 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:24] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 9 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 9 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 8 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 9 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 6 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:25] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 20/290 constraints. Problems are: Problem set: 14 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:27] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 10 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:28] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:29] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 5 ms to minimize.
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:29] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 6 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 3 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 20/310 constraints. Problems are: Problem set: 33 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:31] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:31] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Problem TDEAD123 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:31] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:32] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 6 ms to minimize.
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD264 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 20/330 constraints. Problems are: Problem set: 41 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:33] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:34] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:34] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:34] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:34] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:34] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:35] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:35] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:35] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:35] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:35] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 7 ms to minimize.
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:36] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:36] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:36] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:36] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:36] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:36] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:37] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:37] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Problem TDEAD203 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/350 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:38] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:39] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:40] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:41] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:41] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:41] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/370 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:44] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:45] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:45] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:45] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:46] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:46] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 8/378 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:48] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 1/379 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:50] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/380 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/548 variables, and 380 constraints, problems are : Problem set: 42 solved, 413 unsolved in 30022 ms.
Refiners :[Domain max(s): 212/212 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/212 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 110/110 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 9/214 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 66/280 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/280 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 4 (OVERLAPS) 7/212 variables, 49/329 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 7/336 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 44/380 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:55] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:57] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:57] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:57] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:58] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:58] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:58] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:58] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:58] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 9/389 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:59] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:01] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:01] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:01] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:01] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 5/394 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 7/401 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:07] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:07] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 2/403 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:10] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:10] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:10] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:10] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:10] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:11] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 6/409 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:13] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:14] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:14] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:14] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 4/413 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/413 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 14 (OVERLAPS) 336/548 variables, 212/625 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 42/667 constraints. Problems are: Problem set: 42 solved, 413 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 413/1080 constraints. Problems are: Problem set: 42 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 1080 constraints, problems are : Problem set: 42 solved, 413 unsolved in 30014 ms.
Refiners :[Domain max(s): 212/212 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 413/455 constraints, Known Traps: 143/143 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 42 solved, 413 unsolved
Search for dead transitions found 42 dead transitions in 60131ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in LTL mode, iteration 1 : 212/212 places, 420/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60764 ms. Remains : 212/212 places, 420/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 37687 steps (8 resets) in 249 ms. (150 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 334 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
[2025-06-02 17:39:24] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 212 cols
[2025-06-02 17:39:24] [INFO ] Computed 58 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:39:24] [INFO ] [Real]Absence check using 58 positive place invariants in 51 ms returned sat
[2025-06-02 17:39:24] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-06-02 17:39:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 17:39:24] [INFO ] [Nat]Absence check using 58 positive place invariants in 32 ms returned sat
[2025-06-02 17:39:24] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-02 17:39:24] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-06-02 17:39:25] [INFO ] [Nat]Added 35 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:26] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:26] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 6 ms to minimize.
[2025-06-02 17:39:26] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1207 ms
[2025-06-02 17:39:26] [INFO ] Computed and/alt/rep : 273/1575/273 causal constraints (skipped 28 transitions) in 21 ms.
[2025-06-02 17:39:27] [INFO ] Added : 244 causal constraints over 50 iterations in 1679 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6814 reset in 335 ms.
Product exploration explored 100000 steps with 6836 reset in 267 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 420/420 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 420
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 23 ms. Remains 212 /212 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:39:28] [INFO ] Redundant transitions in 1 ms returned []
Running 413 sub problems to find dead transitions.
[2025-06-02 17:39:28] [INFO ] Flow matrix only has 308 transitions (discarded 112 similar events)
// Phase 1: matrix 308 rows 212 cols
[2025-06-02 17:39:28] [INFO ] Computed 58 invariants in 7 ms
[2025-06-02 17:39:29] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 7/212 variables, 49/263 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:34] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:34] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:36] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:37] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:37] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:37] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:37] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD223 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 20/310 constraints. Problems are: Problem set: 5 solved, 408 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:42] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD218 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:42] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:42] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:42] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:42] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:43] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 8 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 20/330 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:45] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:46] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:46] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:46] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:46] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:46] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:48] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:48] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:48] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:48] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 20/350 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:49] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:49] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:49] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:50] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:50] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:50] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:50] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:51] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:52] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 20/370 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:55] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:56] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:56] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:56] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:56] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:56] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:57] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:58] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:58] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:58] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 20/390 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:58] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 212/520 variables, and 391 constraints, problems are : Problem set: 7 solved, 406 unsolved in 30014 ms.
Refiners :[Domain max(s): 212/212 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/212 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 121/121 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 9/207 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 89/296 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/296 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 14/212 variables, 49/345 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 14/359 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 32/391 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:02] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:02] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:02] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:02] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:03] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:03] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:03] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:04] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:04] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:04] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:04] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:04] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:05] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 20/411 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:06] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:07] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:08] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:08] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 4/415 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:10] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:10] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:11] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:11] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:11] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:12] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:12] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:12] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 8/423 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/423 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 11 (OVERLAPS) 308/520 variables, 212/635 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 35/670 constraints. Problems are: Problem set: 7 solved, 406 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 406/1076 constraints. Problems are: Problem set: 7 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 1076 constraints, problems are : Problem set: 7 solved, 406 unsolved in 30038 ms.
Refiners :[Domain max(s): 212/212 constraints, Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 212/212 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 406/413 constraints, Known Traps: 153/153 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 7 solved, 406 unsolved
Search for dead transitions found 7 dead transitions in 60127ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 413/420 transitions.
Graph (complete) has 1086 edges and 212 vertex of which 205 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 205 /212 variables (removed 7) and now considering 413/413 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 205/212 places, 413/420 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60171 ms. Remains : 205/212 places, 413/420 transitions.
Built C files in :
/tmp/ltsmin242862213603951310
[2025-06-02 17:40:29] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin242862213603951310
Running compilation step : cd /tmp/ltsmin242862213603951310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 654 ms.
Running link step : cd /tmp/ltsmin242862213603951310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin242862213603951310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7981281242603795369.hoa' '--buchi-type=spotba'
LTSmin run took 1741 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-14 finished in 135228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 462/462 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 213 transition count 456
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 207 transition count 456
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 26 place count 200 transition count 449
Applied a total of 26 rules in 20 ms. Remains 200 /213 variables (removed 13) and now considering 449/462 (removed 13) transitions.
[2025-06-02 17:40:31] [INFO ] Flow matrix only has 323 transitions (discarded 126 similar events)
// Phase 1: matrix 323 rows 200 cols
[2025-06-02 17:40:31] [INFO ] Computed 59 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:31] [INFO ] Implicit Places using invariants in 180 ms returned [128]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/213 places, 449/462 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 199 transition count 448
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 198 transition count 448
Applied a total of 2 rules in 10 ms. Remains 198 /199 variables (removed 1) and now considering 448/449 (removed 1) transitions.
[2025-06-02 17:40:31] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2025-06-02 17:40:31] [INFO ] Computed 58 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:31] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-02 17:40:31] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:40:32] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/213 places, 448/462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 815 ms. Remains : 198/213 places, 448/462 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLCardinality-15
Product exploration explored 100000 steps with 1380 reset in 229 ms.
Product exploration explored 100000 steps with 1385 reset in 245 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 280 steps (0 resets) in 8 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-06-02 17:40:33] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:33] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 17:40:33] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:40:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 17:40:34] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:40:34] [INFO ] Redundant transitions in 4 ms returned []
Running 441 sub problems to find dead transitions.
[2025-06-02 17:40:34] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2025-06-02 17:40:34] [INFO ] Invariant cache hit.
[2025-06-02 17:40:34] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 58/256 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 9 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 7 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 6 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 5 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 5 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 5 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 4 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 20/276 constraints. Problems are: Problem set: 17 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:39] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 11 ms to minimize.
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 11 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 20/296 constraints. Problems are: Problem set: 37 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Problem TDEAD125 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:42] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:42] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:43] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
Problem TDEAD203 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:45] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:45] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:45] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 8 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 20/316 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:46] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:46] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:46] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:46] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:46] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:47] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:47] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:47] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:47] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:47] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:48] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:48] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:48] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:48] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:48] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:48] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:49] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:49] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:49] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:49] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 20/336 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:50] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:50] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:51] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:51] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:51] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:51] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:51] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:52] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:52] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:52] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:52] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:52] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:52] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:53] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 20/356 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:56] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:57] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:57] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 3/359 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:58] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:58] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:58] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:58] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:59] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:00] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:01] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:01] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:01] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:01] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 19/378 constraints. Problems are: Problem set: 42 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:04] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 12 ms to minimize.
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 42 solved, 399 unsolved
Search for dead transitions found 42 dead transitions in 30214ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 198/198 places, 406/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:41:04] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 30870 ms. Remains : 198/198 places, 406/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 182 steps (0 resets) in 7 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1397 reset in 219 ms.
Stack based approach found an accepted trace after 30276 steps with 415 reset with depth 83 and stack size 83 in 73 ms.
FORMULA LamportFastMutEx-PT-7-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-7-LTLCardinality-15 finished in 33574 ms.
All properties solved by simple procedures.
Total runtime 305292 ms.

BK_STOP 1748886065225

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LamportFastMutEx-PT-7"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-7, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876423200691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;