Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200627.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 HealthRecord-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 71K 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 HealthRecord-PT-12-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749003252171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 02:14:14] [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-04 02:14:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 02:14:15] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-06-04 02:14:15] [INFO ] Transformed 160 places.
[2025-06-04 02:14:15] [INFO ] Transformed 340 transitions.
[2025-06-04 02:14:15] [INFO ] Found NUPN structural information;
[2025-06-04 02:14:15] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-12-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 82 transition count 164
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 82 transition count 164
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 161 place count 77 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 166 place count 77 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 171 place count 77 transition count 149
Applied a total of 171 rules in 160 ms. Remains 77 /160 variables (removed 83) and now considering 149/312 (removed 163) transitions.
[2025-06-04 02:14:16] [INFO ] Flow matrix only has 145 transitions (discarded 4 similar events)
// Phase 1: matrix 145 rows 77 cols
[2025-06-04 02:14:16] [INFO ] Computed 10 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:14:16] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-04 02:14:16] [INFO ] Flow matrix only has 145 transitions (discarded 4 similar events)
[2025-06-04 02:14:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:14:16] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2025-06-04 02:14:16] [INFO ] Flow matrix only has 145 transitions (discarded 4 similar events)
[2025-06-04 02:14:16] [INFO ] Invariant cache hit.
[2025-06-04 02:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:18] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:18] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:18] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:19] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:19] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:20] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:20] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 144/221 variables, 77/94 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 1/222 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 95 constraints, problems are : Problem set: 0 solved, 148 unsolved in 12005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:30] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:30] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:30] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:31] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 144/221 variables, 77/98 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 148/246 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 1/222 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:42] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:14:53] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 6 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/222 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 249 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42215ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 42233ms
Starting structural reductions in LTL mode, iteration 1 : 77/160 places, 149/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43077 ms. Remains : 77/160 places, 149/312 transitions.
Support contains 30 out of 77 places after structural reductions.
[2025-06-04 02:14:59] [INFO ] Flatten gal took : 78 ms
[2025-06-04 02:14:59] [INFO ] Flatten gal took : 39 ms
[2025-06-04 02:14:59] [INFO ] Input system was already deterministic with 149 transitions.
RANDOM walk for 40000 steps (2868 resets) in 2087 ms. (19 steps per ms) remains 8/19 properties
BEST_FIRST walk for 40003 steps (363 resets) in 489 ms. (81 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (358 resets) in 356 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (361 resets) in 304 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (359 resets) in 274 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (355 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (353 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (364 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
[2025-06-04 02:15:00] [INFO ] Flow matrix only has 145 transitions (discarded 4 similar events)
[2025-06-04 02:15:00] [INFO ] Invariant cache hit.
[2025-06-04 02:15:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 31/77 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 144/221 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/222 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 88 constraints, problems are : Problem set: 0 solved, 7 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:01] [INFO ] Deduced a trap composed of 19 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-04 02:15:01] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:01] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:01] [INFO ] Deduced a trap composed of 19 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-04 02:15:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 31/77 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:01] [INFO ] Deduced a trap composed of 13 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-04 02:15:01] [INFO ] Deduced a trap composed of 25 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-04 02:15:01] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:01] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:02] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 144/221 variables, 77/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 7/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/222 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:02] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 106 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2428ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 642 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 149/149 transitions.
Graph (trivial) has 88 edges and 77 vertex of which 6 / 77 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 310 edges and 74 vertex of which 72 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 72 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 70 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 70 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 69 transition count 135
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 23 place count 54 transition count 105
Iterating global reduction 2 with 15 rules applied. Total rules applied 38 place count 54 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 54 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 43 place count 50 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 50 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 50 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 53 place count 47 transition count 84
Iterating global reduction 4 with 3 rules applied. Total rules applied 56 place count 47 transition count 84
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 59 place count 44 transition count 78
Iterating global reduction 4 with 3 rules applied. Total rules applied 62 place count 44 transition count 78
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 71 place count 44 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 43 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 74 place count 43 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 84 place count 38 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 85 place count 38 transition count 97
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 89 place count 38 transition count 93
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 93 place count 34 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 95 place count 34 transition count 91
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 97 place count 34 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 100 place count 32 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 103 place count 32 transition count 163
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 104 place count 31 transition count 126
Iterating global reduction 8 with 1 rules applied. Total rules applied 105 place count 31 transition count 126
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 106 place count 30 transition count 123
Iterating global reduction 8 with 1 rules applied. Total rules applied 107 place count 30 transition count 123
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 117 place count 30 transition count 113
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 126 place count 30 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 135 place count 30 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 136 place count 30 transition count 104
Applied a total of 136 rules in 124 ms. Remains 30 /77 variables (removed 47) and now considering 104/149 (removed 45) transitions.
Running 88 sub problems to find dead transitions.
[2025-06-04 02:15:03] [INFO ] Flow matrix only has 80 transitions (discarded 24 similar events)
// Phase 1: matrix 80 rows 30 cols
[2025-06-04 02:15:03] [INFO ] Computed 8 invariants in 3 ms
[2025-06-04 02:15:03] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 3 (OVERLAPS) 80/110 variables, 30/38 constraints. Problems are: Problem set: 2 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 16/54 constraints. Problems are: Problem set: 2 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 54 constraints, problems are : Problem set: 2 solved, 86 unsolved in 3603 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 86 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 80/110 variables, 30/38 constraints. Problems are: Problem set: 2 solved, 86 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 16/54 constraints. Problems are: Problem set: 5 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 83/137 constraints. Problems are: Problem set: 5 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/137 constraints. Problems are: Problem set: 5 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 137 constraints, problems are : Problem set: 5 solved, 83 unsolved in 7517 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 83/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11217ms problems are : Problem set: 5 solved, 83 unsolved
Search for dead transitions found 5 dead transitions in 11219ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/77 places, 99/149 transitions.
Graph (complete) has 110 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 28 transition count 98
Applied a total of 3 rules in 14 ms. Remains 28 /30 variables (removed 2) and now considering 98/99 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11358 ms. Remains : 28/77 places, 98/149 transitions.
RANDOM walk for 1868 steps (290 resets) in 57 ms. (32 steps per ms) remains 0/1 properties
Computed a total of 5 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((X(p0)&&((!p1 U (p2||G(!p1))) U ((!p0&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))'
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 63 transition count 122
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 63 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 63 transition count 121
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 60 transition count 115
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 60 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 60 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 59 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 59 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 58 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 58 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 58 transition count 104
Applied a total of 45 rules in 15 ms. Remains 58 /77 variables (removed 19) and now considering 104/149 (removed 45) transitions.
[2025-06-04 02:15:15] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
// Phase 1: matrix 101 rows 58 cols
[2025-06-04 02:15:15] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:15:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 02:15:15] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:15:15] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-04 02:15:15] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:15:15] [INFO ] Invariant cache hit.
[2025-06-04 02:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:16] [INFO ] Deduced a trap composed of 20 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-04 02:15:17] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 100/158 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 70 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6883 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:23] [INFO ] Deduced a trap composed of 11 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-04 02:15:23] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:24] [INFO ] Deduced a trap composed of 20 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-04 02:15:24] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 100/158 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 103/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 1/159 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 177 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12995 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19927ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 19929ms
Starting structural reductions in LTL mode, iteration 1 : 58/77 places, 104/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20177 ms. Remains : 58/77 places, 104/149 transitions.
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-02 finished in 20714 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(p0))'
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Graph (trivial) has 92 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 54 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 54 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 54 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 49 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 49 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 49 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 46 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 46 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 43 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 43 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 72 place count 43 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 42 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 42 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 40 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 81 place count 40 transition count 81
Applied a total of 81 rules in 30 ms. Remains 40 /77 variables (removed 37) and now considering 81/149 (removed 68) transitions.
[2025-06-04 02:15:36] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
// Phase 1: matrix 73 rows 40 cols
[2025-06-04 02:15:36] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:15:36] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 02:15:36] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2025-06-04 02:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:15:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 02:15:36] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:15:36] [INFO ] Redundant transitions in 29 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-04 02:15:36] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2025-06-04 02:15:36] [INFO ] Invariant cache hit.
[2025-06-04 02:15:36] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:37] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 72/112 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/113 variables, and 65 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2582 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:39] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 72/112 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 65/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/112 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/113 variables, and 131 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4319 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6922ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 6922ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/77 places, 81/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7150 ms. Remains : 40/77 places, 81/149 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-03 finished in 7214 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(X(F((X((X(p1)||p0))&&F(p2)))))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 62 transition count 120
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 62 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 62 transition count 119
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 58 transition count 111
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 58 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 56 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 54 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 54 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 54 transition count 92
Applied a total of 56 rules in 11 ms. Remains 54 /77 variables (removed 23) and now considering 92/149 (removed 57) transitions.
[2025-06-04 02:15:43] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2025-06-04 02:15:43] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:15:43] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-04 02:15:43] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:15:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:15:43] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-04 02:15:43] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:15:43] [INFO ] Invariant cache hit.
[2025-06-04 02:15:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:44] [INFO ] Deduced a trap composed of 16 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-04 02:15:44] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:45] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:48] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 68 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6471 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:50] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:15:50] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 91/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 161 constraints, problems are : Problem set: 0 solved, 91 unsolved in 11265 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17783ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 17784ms
Starting structural reductions in LTL mode, iteration 1 : 54/77 places, 92/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18015 ms. Remains : 54/77 places, 92/149 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-04
Product exploration explored 100000 steps with 19344 reset in 300 ms.
Product exploration explored 100000 steps with 19339 reset in 260 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (2886 resets) in 216 ms. (184 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (404 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (367 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (350 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (370 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
[2025-06-04 02:16:03] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:16:03] [INFO ] Invariant cache hit.
[2025-06-04 02:16:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 64 constraints, problems are : Problem set: 0 solved, 5 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/63 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 3/66 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 67 constraints, problems are : Problem set: 2 solved, 3 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 458ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 45 edges and 54 vertex of which 6 / 54 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 195 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 50 transition count 79
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 47 transition count 78
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 42 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 110
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 42 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 38 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 38 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 38 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 37 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 37 transition count 213
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 36 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 36 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 35 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 35 transition count 171
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 55 place count 35 transition count 156
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 66 place count 35 transition count 156
Applied a total of 66 rules in 54 ms. Remains 35 /54 variables (removed 19) and now considering 156/92 (removed -64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 35/54 places, 156/92 transitions.
RANDOM walk for 40000 steps (3031 resets) in 301 ms. (132 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
[2025-06-04 02:16:03] [INFO ] Flow matrix only has 117 transitions (discarded 39 similar events)
// Phase 1: matrix 117 rows 35 cols
[2025-06-04 02:16:03] [INFO ] Computed 8 invariants in 2 ms
[2025-06-04 02:16:03] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/152 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:04] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 117/152 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 8 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (G (OR p0 p1 p2)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 354 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2025-06-04 02:16:05] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2025-06-04 02:16:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:16:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 02:16:05] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:16:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:16:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:16:05] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-04 02:16:05] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:16:05] [INFO ] Invariant cache hit.
[2025-06-04 02:16:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:06] [INFO ] Deduced a trap composed of 16 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-04 02:16:06] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/142 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:07] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:10] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 68 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6579 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:12] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:12] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 91/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 161 constraints, problems are : Problem set: 0 solved, 91 unsolved in 10843 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17456ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 17457ms
Finished structural reductions in LTL mode , in 1 iterations and 17653 ms. Remains : 54/54 places, 92/92 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (2897 resets) in 178 ms. (223 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (403 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (357 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
[2025-06-04 02:16:23] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2025-06-04 02:16:23] [INFO ] Invariant cache hit.
[2025-06-04 02:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/54 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 64 constraints, problems are : Problem set: 0 solved, 3 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 32/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:23] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 17/54 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 68 constraints, problems are : Problem set: 0 solved, 3 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 45 edges and 54 vertex of which 6 / 54 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 195 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 50 transition count 79
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 47 transition count 78
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 42 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 42 transition count 110
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 42 transition count 106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 38 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 38 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 38 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 37 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 36 place count 37 transition count 213
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 36 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 36 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 39 place count 35 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 35 transition count 171
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 55 place count 35 transition count 156
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 66 place count 35 transition count 156
Applied a total of 66 rules in 62 ms. Remains 35 /54 variables (removed 19) and now considering 156/92 (removed -64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 35/54 places, 156/92 transitions.
RANDOM walk for 40000 steps (3069 resets) in 325 ms. (122 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
[2025-06-04 02:16:24] [INFO ] Flow matrix only has 117 transitions (discarded 39 similar events)
// Phase 1: matrix 117 rows 35 cols
[2025-06-04 02:16:24] [INFO ] Computed 8 invariants in 2 ms
[2025-06-04 02:16:24] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 117/152 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 25/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:24] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 117/152 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 483ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 42 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT (OR p0 p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 275 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 384 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 386 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 20000 reset in 355 ms.
Product exploration explored 100000 steps with 20000 reset in 257 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 45 edges and 54 vertex of which 6 / 54 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 50 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 50 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 50 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 50 transition count 129
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 50 transition count 128
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 16 ms. Remains 50 /54 variables (removed 4) and now considering 128/92 (removed -36) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:16:27] [INFO ] Redundant transitions in 39 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-04 02:16:27] [INFO ] Flow matrix only has 114 transitions (discarded 14 similar events)
// Phase 1: matrix 114 rows 50 cols
[2025-06-04 02:16:27] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 02:16:27] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:28] [INFO ] Deduced a trap composed of 6 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-04 02:16:28] [INFO ] Deduced a trap composed of 16 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-04 02:16:28] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:28] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:28] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 5 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:28] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 5 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:29] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/17 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 113/163 variables, 50/67 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 17/84 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/85 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 85 constraints, problems are : Problem set: 10 solved, 102 unsolved in 7373 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 6/50 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/17 constraints. Problems are: Problem set: 10 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:35] [INFO ] Deduced a trap composed of 7 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-04 02:16:35] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/20 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 113/163 variables, 50/70 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 17/87 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 102/189 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/189 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/190 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/190 constraints. Problems are: Problem set: 10 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/190 constraints. Problems are: Problem set: 10 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 190 constraints, problems are : Problem set: 10 solved, 102 unsolved in 16298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 102/112 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23735ms problems are : Problem set: 10 solved, 102 unsolved
Search for dead transitions found 10 dead transitions in 23736ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/54 places, 118/92 transitions.
Graph (complete) has 204 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 45 /50 variables (removed 5) and now considering 118/118 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/54 places, 118/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23805 ms. Remains : 45/54 places, 118/92 transitions.
Built C files in :
/tmp/ltsmin301563519092630862
[2025-06-04 02:16:51] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin301563519092630862
Running compilation step : cd /tmp/ltsmin301563519092630862;'/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 414 ms.
Running link step : cd /tmp/ltsmin301563519092630862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin301563519092630862;'/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/stateBased1045148779856712927.hoa' '--buchi-type=spotba'
LTSmin run took 283 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLCardinality-04 finished in 68498 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(X(F(p0)))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 61 transition count 118
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 61 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 61 transition count 117
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 57 transition count 109
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 57 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 57 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 55 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 55 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 53 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 53 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 53 transition count 90
Applied a total of 58 rules in 6 ms. Remains 53 /77 variables (removed 24) and now considering 90/149 (removed 59) transitions.
[2025-06-04 02:16:51] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 53 cols
[2025-06-04 02:16:51] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:16:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 02:16:51] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-04 02:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:16:52] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-04 02:16:52] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-04 02:16:52] [INFO ] Invariant cache hit.
[2025-06-04 02:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:53] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:53] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:53] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/139 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 66 constraints, problems are : Problem set: 0 solved, 89 unsolved in 6239 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:58] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:59] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:59] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:16:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/139 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 89/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 159 constraints, problems are : Problem set: 0 solved, 89 unsolved in 10214 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16471ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 16472ms
Starting structural reductions in LTL mode, iteration 1 : 53/77 places, 90/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16686 ms. Remains : 53/77 places, 90/149 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-05
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Product exploration explored 100000 steps with 25000 reset in 248 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2903 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (357 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 571002 steps, run visited all 1 properties in 856 ms. (steps per millisecond=667 )
Probabilistic random walk after 571002 steps, saw 74738 distinct states, run finished after 861 ms. (steps per millisecond=663 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 90/90 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2025-06-04 02:17:10] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-04 02:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:17:10] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 02:17:10] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-04 02:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:17:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:17:11] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-04 02:17:11] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-04 02:17:11] [INFO ] Invariant cache hit.
[2025-06-04 02:17:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:12] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:12] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:12] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/139 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 66 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5920 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:17] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:17] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:17] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:17] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/139 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 89/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 159 constraints, problems are : Problem set: 0 solved, 89 unsolved in 10792 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16750ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 16751ms
Finished structural reductions in LTL mode , in 1 iterations and 16963 ms. Remains : 53/53 places, 90/90 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2890 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (357 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 571002 steps, run visited all 1 properties in 828 ms. (steps per millisecond=689 )
Probabilistic random walk after 571002 steps, saw 74738 distinct states, run finished after 829 ms. (steps per millisecond=688 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 223 ms.
Product exploration explored 100000 steps with 25000 reset in 248 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 90/90 transitions.
Graph (trivial) has 48 edges and 53 vertex of which 8 / 53 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 48 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 48 transition count 127
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 11 ms. Remains 48 /53 variables (removed 5) and now considering 127/90 (removed -37) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:17:30] [INFO ] Redundant transitions in 37 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-04 02:17:30] [INFO ] Flow matrix only has 111 transitions (discarded 16 similar events)
// Phase 1: matrix 111 rows 48 cols
[2025-06-04 02:17:30] [INFO ] Computed 9 invariants in 1 ms
[2025-06-04 02:17:30] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:31] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:31] [INFO ] Deduced a trap composed of 17 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-04 02:17:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:32] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 4 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 7/16 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 110/158 variables, 48/64 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 18/82 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/159 variables, 1/83 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/83 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/83 constraints. Problems are: Problem set: 10 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 83 constraints, problems are : Problem set: 10 solved, 101 unsolved in 7288 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 6/48 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 7/16 constraints. Problems are: Problem set: 10 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:38] [INFO ] Deduced a trap composed of 7 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-04 02:17:38] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/18 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 110/158 variables, 48/66 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 18/84 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 101/185 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/185 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/159 variables, 1/186 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/186 constraints. Problems are: Problem set: 10 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/186 constraints. Problems are: Problem set: 10 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 186 constraints, problems are : Problem set: 10 solved, 101 unsolved in 15444 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 101/111 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22793ms problems are : Problem set: 10 solved, 101 unsolved
Search for dead transitions found 10 dead transitions in 22794ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/53 places, 117/90 transitions.
Graph (complete) has 201 edges and 48 vertex of which 43 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 43 /48 variables (removed 5) and now considering 117/117 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/53 places, 117/90 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22857 ms. Remains : 43/53 places, 117/90 transitions.
Built C files in :
/tmp/ltsmin2770867891719787460
[2025-06-04 02:17:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2770867891719787460
Running compilation step : cd /tmp/ltsmin2770867891719787460;'/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 242 ms.
Running link step : cd /tmp/ltsmin2770867891719787460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2770867891719787460;'/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/stateBased9402115546522315257.hoa' '--buchi-type=spotba'
LTSmin run took 160 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLCardinality-05 finished in 61909 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 (!p0&&G(p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Graph (trivial) has 87 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 56 transition count 113
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 56 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 56 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 53 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 53 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 53 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 52 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 52 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 51 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 51 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 51 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 50 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 50 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 49 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 49 transition count 102
Applied a total of 55 rules in 18 ms. Remains 49 /77 variables (removed 28) and now considering 102/149 (removed 47) transitions.
[2025-06-04 02:17:53] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
// Phase 1: matrix 96 rows 49 cols
[2025-06-04 02:17:53] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:17:53] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 02:17:53] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
[2025-06-04 02:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:17:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-04 02:17:54] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:17:54] [INFO ] Redundant transitions in 27 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 02:17:54] [INFO ] Flow matrix only has 96 transitions (discarded 6 similar events)
[2025-06-04 02:17:54] [INFO ] Invariant cache hit.
[2025-06-04 02:17:54] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:54] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:55] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 95/144 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/144 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/145 variables, and 71 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4900 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 8/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:17:59] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 95/144 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 86/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/145 variables, and 158 constraints, problems are : Problem set: 0 solved, 86 unsolved in 6104 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11036ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 11037ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/77 places, 102/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11298 ms. Remains : 49/77 places, 102/149 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-06 finished in 11425 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 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Graph (trivial) has 88 edges and 77 vertex of which 6 / 77 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 57 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 57 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 34 place count 57 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 53 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 53 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 53 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 50 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 47 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 47 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 66 place count 47 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 46 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 44 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 44 transition count 89
Applied a total of 74 rules in 20 ms. Remains 44 /77 variables (removed 33) and now considering 89/149 (removed 60) transitions.
[2025-06-04 02:18:05] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
// Phase 1: matrix 81 rows 44 cols
[2025-06-04 02:18:05] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:05] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-04 02:18:05] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
[2025-06-04 02:18:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 02:18:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:18:05] [INFO ] Redundant transitions in 35 ms returned []
Running 73 sub problems to find dead transitions.
[2025-06-04 02:18:05] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
[2025-06-04 02:18:05] [INFO ] Invariant cache hit.
[2025-06-04 02:18:05] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:06] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:06] [INFO ] Deduced a trap composed of 13 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-04 02:18:06] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 80/124 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/125 variables, and 70 constraints, problems are : Problem set: 0 solved, 73 unsolved in 3371 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:09] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 80/124 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 73/144 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/125 variables, and 144 constraints, problems are : Problem set: 0 solved, 73 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9009ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 9010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/77 places, 89/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9290 ms. Remains : 44/77 places, 89/149 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-07 finished in 9353 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||F(!p1)) U G(p2)) U X((p3 U p0))))'
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 62 transition count 120
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 62 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 62 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 59 transition count 113
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 59 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 58 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 58 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 57 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 57 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 57 transition count 105
Applied a total of 44 rules in 6 ms. Remains 57 /77 variables (removed 20) and now considering 105/149 (removed 44) transitions.
[2025-06-04 02:18:14] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
// Phase 1: matrix 102 rows 57 cols
[2025-06-04 02:18:14] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 02:18:14] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2025-06-04 02:18:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:18:14] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2025-06-04 02:18:14] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2025-06-04 02:18:14] [INFO ] Invariant cache hit.
[2025-06-04 02:18:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:16] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:16] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:16] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:16] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:17] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 101/158 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:19] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1/159 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 74 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8399 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 101/158 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 104/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 179 constraints, problems are : Problem set: 0 solved, 104 unsolved in 14293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22717ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 22717ms
Starting structural reductions in LTL mode, iteration 1 : 57/77 places, 105/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22928 ms. Remains : 57/77 places, 105/149 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (NOT p2), p1, (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p0 p1 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND p2 (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND p2 (NOT p0) p1 p3))), (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 p3)))), (X (X (NOT (AND p2 (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND p2 (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 28 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-12-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-12-LTLCardinality-11 finished in 23801 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(G(p0)))'
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 59 transition count 114
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 59 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 59 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 54 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 54 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 51 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 51 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 48 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 48 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 48 transition count 76
Applied a total of 71 rules in 4 ms. Remains 48 /77 variables (removed 29) and now considering 76/149 (removed 73) transitions.
[2025-06-04 02:18:38] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 48 cols
[2025-06-04 02:18:38] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-04 02:18:38] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2025-06-04 02:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:18:38] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2025-06-04 02:18:38] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2025-06-04 02:18:38] [INFO ] Invariant cache hit.
[2025-06-04 02:18:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:39] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:39] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/120 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 60 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:43] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:43] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 72/120 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 75/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 137 constraints, problems are : Problem set: 0 solved, 75 unsolved in 6785 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11190ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 11191ms
Starting structural reductions in LTL mode, iteration 1 : 48/77 places, 76/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11401 ms. Remains : 48/77 places, 76/149 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-12 finished in 11495 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((p0||X(p0))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 60 transition count 116
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 60 transition count 116
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 55 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 55 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 68 place count 49 transition count 79
Applied a total of 68 rules in 2 ms. Remains 49 /77 variables (removed 28) and now considering 79/149 (removed 70) transitions.
[2025-06-04 02:18:49] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2025-06-04 02:18:49] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:49] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-04 02:18:49] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 02:18:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:18:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:18:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-06-04 02:18:50] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 02:18:50] [INFO ] Invariant cache hit.
[2025-06-04 02:18:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:50] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:50] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 62 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4416 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:54] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:18:55] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/124 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 142 constraints, problems are : Problem set: 0 solved, 78 unsolved in 8558 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12984ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 12984ms
Starting structural reductions in LTL mode, iteration 1 : 49/77 places, 79/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13123 ms. Remains : 49/77 places, 79/149 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLCardinality-13 finished in 13210 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((X(p1)||p0))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 149/149 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 61 transition count 117
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 61 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 61 transition count 116
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 56 transition count 106
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 56 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 53 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 50 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 50 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 66 place count 50 transition count 80
Applied a total of 66 rules in 3 ms. Remains 50 /77 variables (removed 27) and now considering 80/149 (removed 69) transitions.
[2025-06-04 02:19:03] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 50 cols
[2025-06-04 02:19:03] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:19:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 02:19:03] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
[2025-06-04 02:19:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:19:03] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-04 02:19:03] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
[2025-06-04 02:19:03] [INFO ] Invariant cache hit.
[2025-06-04 02:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:19:04] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:19:04] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:19:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:19:04] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 75/125 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 65 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5089 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 75/125 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 79/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 144 constraints, problems are : Problem set: 0 solved, 79 unsolved in 6816 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11919ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 11920ms
Starting structural reductions in LTL mode, iteration 1 : 50/77 places, 80/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12049 ms. Remains : 50/77 places, 80/149 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-12-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-12-LTLCardinality-15 finished in 12578 ms.
All properties solved by simple procedures.
Total runtime 300890 ms.

BK_STOP 1749003555733

--------------------
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="HealthRecord-PT-12"
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 HealthRecord-PT-12, 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 r100-smll-174867008200627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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