Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950400388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J06T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950400388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679511374220

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 18:56:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 18:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:56:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 18:56:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 18:56:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 866 ms
[2023-03-22 18:56:17] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 18:56:17] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2023-03-22 18:56:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 3 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 18:56:17] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 18:56:17] [INFO ] Computed 26 place invariants in 15 ms
[2023-03-22 18:56:18] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-22 18:56:18] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 18:56:18] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2023-03-22 18:56:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 18:56:18] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-22 18:56:18] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-22 18:56:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 18:56:18] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 9 ms returned sat
[2023-03-22 18:56:18] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-22 18:56:18] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-22 18:56:18] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 18:56:18] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 25 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
[2023-03-22 18:56:18] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2023-03-22 18:56:18] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-22 18:56:18] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 2 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Reduce places removed 0 places and 2 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 2 /59 variables (removed 57) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 85 ms. Remains : 2/81 places, 0/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2023-03-22 18:56:18] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-22 18:56:18] [INFO ] Flatten gal took : 30 ms
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 18:56:18] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2023-03-22 18:56:18] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 36 ms.
[2023-03-22 18:56:18] [INFO ] Unfolded 13 HLPN properties in 1 ms.
[2023-03-22 18:56:18] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 479 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 49 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
[2023-03-22 18:56:18] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2023-03-22 18:56:18] [INFO ] Computed 56 place invariants in 84 ms
[2023-03-22 18:56:19] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2023-03-22 18:56:19] [INFO ] Flow matrix only has 1522 transitions (discarded 20 similar events)
// Phase 1: matrix 1522 rows 842 cols
[2023-03-22 18:56:19] [INFO ] Computed 56 place invariants in 57 ms
[2023-03-22 18:56:19] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-22 18:56:19] [INFO ] Flow matrix only has 1522 transitions (discarded 20 similar events)
[2023-03-22 18:56:19] [INFO ] Invariant cache hit.
[2023-03-22 18:56:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:56:21] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 2139 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 842/844 places, 1542/1652 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 840 transition count 1522
Reduce places removed 20 places and 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 22 place count 820 transition count 1502
Applied a total of 22 rules in 30 ms. Remains 820 /842 variables (removed 22) and now considering 1502/1542 (removed 40) transitions.
[2023-03-22 18:56:21] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
// Phase 1: matrix 1482 rows 820 cols
[2023-03-22 18:56:21] [INFO ] Computed 56 place invariants in 53 ms
[2023-03-22 18:56:22] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-22 18:56:22] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
[2023-03-22 18:56:22] [INFO ] Invariant cache hit.
[2023-03-22 18:56:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:56:25] [INFO ] Implicit Places using invariants and state equation in 3479 ms returned []
Implicit Place search using SMT with State Equation took 3810 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 820/844 places, 1502/1652 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6976 ms. Remains : 820/844 places, 1502/1652 transitions.
Support contains 479 out of 820 places after structural reductions.
[2023-03-22 18:56:25] [INFO ] Flatten gal took : 130 ms
[2023-03-22 18:56:26] [INFO ] Flatten gal took : 126 ms
[2023-03-22 18:56:26] [INFO ] Input system was already deterministic with 1502 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:56:26] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
[2023-03-22 18:56:26] [INFO ] Invariant cache hit.
[2023-03-22 18:56:26] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 18:56:26] [INFO ] [Real]Absence check using 12 positive and 44 generalized place invariants in 36 ms returned sat
[2023-03-22 18:56:26] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 91 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 67 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 18:56:27] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-22 18:56:27] [INFO ] Computed 56 place invariants in 30 ms
[2023-03-22 18:56:27] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
[2023-03-22 18:56:27] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:27] [INFO ] Invariant cache hit.
[2023-03-22 18:56:28] [INFO ] Implicit Places using invariants in 531 ms returned [624, 625, 626, 627, 628, 629, 630, 631, 632, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 534 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/820 places, 1482/1502 transitions.
Applied a total of 0 rules in 15 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1391 ms. Remains : 790/820 places, 1482/1502 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s183 1) (LT s193 1)) (OR (LT s184 1) (LT s194 1)) (OR (LT s187 1) (LT s197 1)) (OR (LT s188 1) (LT s198 1)) (OR (LT s191 1) (LT s201 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 797 ms.
Product exploration explored 100000 steps with 50000 reset in 732 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-00 finished in 3264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (p1||G(p0))))))))'
Support contains 21 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 43 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 18:56:30] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:30] [INFO ] Invariant cache hit.
[2023-03-22 18:56:31] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
[2023-03-22 18:56:31] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:31] [INFO ] Invariant cache hit.
[2023-03-22 18:56:31] [INFO ] Implicit Places using invariants in 613 ms returned [624, 625, 626, 627, 628, 629, 630, 631, 632, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 616 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/820 places, 1482/1502 transitions.
Applied a total of 0 rules in 21 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1397 ms. Remains : 790/820 places, 1482/1502 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s485 1) (GEQ s484 1) (GEQ s483 1) (GEQ s482 1) (GEQ s481 1) (GEQ s480 1) (GEQ s479 1) (GEQ s478 1) (GEQ s487 1) (GEQ s486 1))) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2718 reset in 491 ms.
Product exploration explored 100000 steps with 2711 reset in 539 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:56:33] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-22 18:56:33] [INFO ] Computed 46 place invariants in 26 ms
[2023-03-22 18:56:33] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-22 18:56:33] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 36 ms returned sat
[2023-03-22 18:56:33] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-22 18:56:34] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:34] [INFO ] Invariant cache hit.
[2023-03-22 18:56:35] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-22 18:56:35] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 86 ms returned sat
[2023-03-22 18:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:56:36] [INFO ] [Real]Absence check using state equation in 1508 ms returned sat
[2023-03-22 18:56:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:56:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-22 18:56:37] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 82 ms returned sat
[2023-03-22 18:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:56:39] [INFO ] [Nat]Absence check using state equation in 2304 ms returned sat
[2023-03-22 18:56:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:56:40] [INFO ] [Nat]Added 120 Read/Feed constraints in 467 ms returned sat
[2023-03-22 18:56:40] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2023-03-22 18:56:40] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2023-03-22 18:56:40] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 1 ms to minimize.
[2023-03-22 18:56:40] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2023-03-22 18:56:41] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2023-03-22 18:56:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 894 ms
[2023-03-22 18:56:41] [INFO ] Computed and/alt/rep : 770/1508/760 causal constraints (skipped 700 transitions) in 140 ms.
[2023-03-22 18:56:45] [INFO ] Added : 239 causal constraints over 48 iterations in 4579 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Applied a total of 0 rules in 21 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
[2023-03-22 18:56:45] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:45] [INFO ] Invariant cache hit.
[2023-03-22 18:56:46] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2023-03-22 18:56:46] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:46] [INFO ] Invariant cache hit.
[2023-03-22 18:56:47] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-22 18:56:47] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:47] [INFO ] Invariant cache hit.
[2023-03-22 18:56:47] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:56:51] [INFO ] Implicit Places using invariants and state equation in 4657 ms returned []
Implicit Place search using SMT with State Equation took 5225 ms to find 0 implicit places.
[2023-03-22 18:56:51] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:51] [INFO ] Invariant cache hit.
[2023-03-22 18:56:52] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6662 ms. Remains : 790/790 places, 1482/1482 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 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 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 102 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 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-22 18:56:53] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:56:53] [INFO ] Invariant cache hit.
[2023-03-22 18:56:54] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 18:56:54] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 95 ms returned sat
[2023-03-22 18:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:56:55] [INFO ] [Real]Absence check using state equation in 1573 ms returned sat
[2023-03-22 18:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:56:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 18:56:56] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 79 ms returned sat
[2023-03-22 18:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:56:58] [INFO ] [Nat]Absence check using state equation in 2215 ms returned sat
[2023-03-22 18:56:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:56:59] [INFO ] [Nat]Added 120 Read/Feed constraints in 463 ms returned sat
[2023-03-22 18:56:59] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2023-03-22 18:56:59] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2023-03-22 18:56:59] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2023-03-22 18:56:59] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2023-03-22 18:57:00] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 0 ms to minimize.
[2023-03-22 18:57:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 858 ms
[2023-03-22 18:57:00] [INFO ] Computed and/alt/rep : 770/1508/760 causal constraints (skipped 700 transitions) in 94 ms.
[2023-03-22 18:57:04] [INFO ] Added : 239 causal constraints over 48 iterations in 4443 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2721 reset in 345 ms.
Product exploration explored 100000 steps with 2718 reset in 370 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 790 transition count 1482
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 50 place count 790 transition count 1592
Deduced a syphon composed of 160 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 160 place count 790 transition count 1592
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 230 place count 790 transition count 1592
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 260 place count 760 transition count 1562
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 290 place count 760 transition count 1562
Deduced a syphon composed of 210 places in 0 ms
Applied a total of 290 rules in 160 ms. Remains 760 /790 variables (removed 30) and now considering 1562/1482 (removed -80) transitions.
[2023-03-22 18:57:06] [INFO ] Flow matrix only has 1542 transitions (discarded 20 similar events)
// Phase 1: matrix 1542 rows 760 cols
[2023-03-22 18:57:06] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-22 18:57:06] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
[2023-03-22 18:57:06] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-22 18:57:06] [INFO ] Flow matrix only has 1542 transitions (discarded 20 similar events)
[2023-03-22 18:57:06] [INFO ] Invariant cache hit.
[2023-03-22 18:57:07] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/790 places, 1562/1482 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1817 ms. Remains : 760/790 places, 1562/1482 transitions.
Support contains 21 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1482/1482 transitions.
Applied a total of 0 rules in 9 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
[2023-03-22 18:57:07] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 790 cols
[2023-03-22 18:57:07] [INFO ] Computed 46 place invariants in 19 ms
[2023-03-22 18:57:08] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
[2023-03-22 18:57:08] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:08] [INFO ] Invariant cache hit.
[2023-03-22 18:57:09] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-22 18:57:09] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:09] [INFO ] Invariant cache hit.
[2023-03-22 18:57:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:57:14] [INFO ] Implicit Places using invariants and state equation in 5499 ms returned []
Implicit Place search using SMT with State Equation took 6061 ms to find 0 implicit places.
[2023-03-22 18:57:14] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:14] [INFO ] Invariant cache hit.
[2023-03-22 18:57:15] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7464 ms. Remains : 790/790 places, 1482/1482 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-01 finished in 45027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G((!p1&&X(!p0)))) U X(X(X(G(!p2))))))'
Support contains 43 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 36 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 18:57:15] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-22 18:57:15] [INFO ] Computed 56 place invariants in 26 ms
[2023-03-22 18:57:16] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
[2023-03-22 18:57:16] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:16] [INFO ] Invariant cache hit.
[2023-03-22 18:57:16] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-22 18:57:16] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:16] [INFO ] Invariant cache hit.
[2023-03-22 18:57:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:57:19] [INFO ] Implicit Places using invariants and state equation in 2667 ms returned []
Implicit Place search using SMT with State Equation took 3239 ms to find 0 implicit places.
[2023-03-22 18:57:19] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:19] [INFO ] Invariant cache hit.
[2023-03-22 18:57:20] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 800/820 places, 1482/1502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4705 ms. Remains : 800/820 places, 1482/1502 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, p2, (OR p2 p0 p1), p2, p2, p2, p2, p2, p2]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 8}], [{ cond=(OR p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR p0 p1), acceptance={} source=3 dest: 8}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(OR p0 p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=p2, acceptance={} source=8 dest: 0}, { cond=(NOT p2), acceptance={} source=8 dest: 8}]], initial=4, aps=[p0:(OR (AND (GEQ s496 1) (GEQ s497 1)) (AND (GEQ s496 1) (GEQ s506 1)) (AND (GEQ s496 1) (GEQ s504 1)) (AND (GEQ s496 1) (GEQ s505 1)) (AND (GEQ s496 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-02 finished in 5073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 71 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 35 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 18:57:20] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:20] [INFO ] Invariant cache hit.
[2023-03-22 18:57:21] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
[2023-03-22 18:57:21] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:57:21] [INFO ] Invariant cache hit.
[2023-03-22 18:57:21] [INFO ] Implicit Places using invariants in 543 ms returned [624, 625, 626, 627, 628, 629, 630, 631, 632, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 545 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/820 places, 1482/1502 transitions.
Applied a total of 0 rules in 9 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1291 ms. Remains : 790/820 places, 1482/1502 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s157 1) (LT s287 1)) (OR (LT s147 1) (LT s287 1)) (OR (LT s176 1) (LT s287 1)) (OR (LT s177 1) (LT s287 1)) (OR (LT s127 1) (LT s287 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 416 ms.
Product exploration explored 100000 steps with 33333 reset in 449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 47 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-03 finished in 2334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(!p1)))'
Support contains 98 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 820 transition count 1412
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 730 transition count 1412
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 730 transition count 1312
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 630 transition count 1312
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 540 place count 550 transition count 1232
Applied a total of 540 rules in 90 ms. Remains 550 /820 variables (removed 270) and now considering 1232/1502 (removed 270) transitions.
[2023-03-22 18:57:22] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
// Phase 1: matrix 1212 rows 550 cols
[2023-03-22 18:57:22] [INFO ] Computed 56 place invariants in 21 ms
[2023-03-22 18:57:23] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2023-03-22 18:57:23] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
[2023-03-22 18:57:23] [INFO ] Invariant cache hit.
[2023-03-22 18:57:23] [INFO ] Implicit Places using invariants in 476 ms returned [494, 495, 496, 497, 498, 499, 500, 501, 502, 503]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 481 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/820 places, 1232/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 530 transition count 1222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 530 transition count 1222
Applied a total of 20 rules in 29 ms. Remains 530 /540 variables (removed 10) and now considering 1222/1232 (removed 10) transitions.
[2023-03-22 18:57:24] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-22 18:57:24] [INFO ] Computed 46 place invariants in 13 ms
[2023-03-22 18:57:24] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-22 18:57:24] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:57:24] [INFO ] Invariant cache hit.
[2023-03-22 18:57:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:57:30] [INFO ] Implicit Places using invariants and state equation in 6178 ms returned []
Implicit Place search using SMT with State Equation took 6594 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 530/820 places, 1222/1502 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7813 ms. Remains : 530/820 places, 1222/1502 transitions.
Stuttering acceptance computed with spot in 64 ms :[p1, p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s137 1) (LT s217 1)) (OR (LT s127 1) (LT s217 1)) (OR (LT s156 1) (LT s217 1)) (OR (LT s157 1) (LT s217 1)) (OR (LT s107 1) (LT s217 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2959 steps with 111 reset in 61 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-04 finished in 7958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(F(p0))) U X(G((X(p0)||p1))))))'
Support contains 81 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Applied a total of 20 rules in 21 ms. Remains 810 /820 variables (removed 10) and now considering 1492/1502 (removed 10) transitions.
[2023-03-22 18:57:30] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
// Phase 1: matrix 1472 rows 810 cols
[2023-03-22 18:57:30] [INFO ] Computed 56 place invariants in 24 ms
[2023-03-22 18:57:31] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
[2023-03-22 18:57:31] [INFO ] Flow matrix only has 1472 transitions (discarded 20 similar events)
[2023-03-22 18:57:31] [INFO ] Invariant cache hit.
[2023-03-22 18:57:32] [INFO ] Implicit Places using invariants in 555 ms returned [624, 625, 626, 627, 628, 629, 630, 631, 632, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 559 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/820 places, 1492/1502 transitions.
Applied a total of 0 rules in 9 ms. Remains 800 /800 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1312 ms. Remains : 800/820 places, 1492/1502 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (GEQ s593 1) (GEQ s592 1) (GEQ s595 1) (GEQ s594 1) (GEQ s597 1) (GEQ s596 1) (GEQ s599 1) (GEQ s598 1) (GEQ s601 1) (GEQ s600 1)), p1:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-06 finished in 1563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(!p0))))'
Support contains 94 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 820 transition count 1432
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 150 place count 750 transition count 1422
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 160 place count 740 transition count 1422
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 160 place count 740 transition count 1392
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 220 place count 710 transition count 1392
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 360 place count 640 transition count 1322
Applied a total of 360 rules in 61 ms. Remains 640 /820 variables (removed 180) and now considering 1322/1502 (removed 180) transitions.
[2023-03-22 18:57:32] [INFO ] Flow matrix only has 1302 transitions (discarded 20 similar events)
// Phase 1: matrix 1302 rows 640 cols
[2023-03-22 18:57:32] [INFO ] Computed 56 place invariants in 14 ms
[2023-03-22 18:57:33] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
[2023-03-22 18:57:33] [INFO ] Flow matrix only has 1302 transitions (discarded 20 similar events)
[2023-03-22 18:57:33] [INFO ] Invariant cache hit.
[2023-03-22 18:57:33] [INFO ] Implicit Places using invariants in 480 ms returned [514, 515, 516, 517, 518, 519, 520, 521, 522, 523]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 482 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/820 places, 1322/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 620 transition count 1312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 620 transition count 1312
Applied a total of 20 rules in 28 ms. Remains 620 /630 variables (removed 10) and now considering 1312/1322 (removed 10) transitions.
[2023-03-22 18:57:33] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
// Phase 1: matrix 1292 rows 620 cols
[2023-03-22 18:57:33] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-22 18:57:34] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-22 18:57:34] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:57:34] [INFO ] Invariant cache hit.
[2023-03-22 18:57:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:57:39] [INFO ] Implicit Places using invariants and state equation in 5763 ms returned []
Implicit Place search using SMT with State Equation took 6257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 620/820 places, 1312/1502 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7449 ms. Remains : 620/820 places, 1312/1502 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s448 1) (LT s564 1)) (OR (LT s447 1) (LT s550 1)) (OR (LT s459 1) (LT s584 1)) (OR (LT s455 1) (LT s589 1)) (OR (LT s452 1) (LT s559 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3965 reset in 991 ms.
Product exploration explored 100000 steps with 3953 reset in 1013 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:57:42] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:57:42] [INFO ] Invariant cache hit.
[2023-03-22 18:57:42] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 18:57:42] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 26 ms returned sat
[2023-03-22 18:57:43] [INFO ] After 417ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 407 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
[2023-03-22 18:57:43] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:57:43] [INFO ] Invariant cache hit.
[2023-03-22 18:57:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-22 18:57:45] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 223 ms returned sat
[2023-03-22 18:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:57:47] [INFO ] [Real]Absence check using state equation in 1749 ms returned sat
[2023-03-22 18:57:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:57:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-22 18:57:48] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 226 ms returned sat
[2023-03-22 18:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:57:51] [INFO ] [Nat]Absence check using state equation in 2268 ms returned sat
[2023-03-22 18:57:51] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:57:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 240 ms returned sat
[2023-03-22 18:57:51] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-22 18:57:51] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2023-03-22 18:57:51] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
[2023-03-22 18:57:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1403 ms
[2023-03-22 18:57:52] [INFO ] Computed and/alt/rep : 510/1128/500 causal constraints (skipped 790 transitions) in 100 ms.
[2023-03-22 18:57:54] [INFO ] Added : 76 causal constraints over 16 iterations in 1478 ms. Result :sat
Could not prove EG p0
Support contains 84 out of 620 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1312/1312 transitions.
Applied a total of 0 rules in 21 ms. Remains 620 /620 variables (removed 0) and now considering 1312/1312 (removed 0) transitions.
[2023-03-22 18:57:54] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:57:54] [INFO ] Invariant cache hit.
[2023-03-22 18:57:54] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
[2023-03-22 18:57:54] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:57:54] [INFO ] Invariant cache hit.
[2023-03-22 18:57:55] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-22 18:57:55] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:57:55] [INFO ] Invariant cache hit.
[2023-03-22 18:57:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:57:59] [INFO ] Implicit Places using invariants and state equation in 4561 ms returned []
Implicit Place search using SMT with State Equation took 5003 ms to find 0 implicit places.
[2023-03-22 18:58:00] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-22 18:58:00] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:58:00] [INFO ] Invariant cache hit.
[2023-03-22 18:58:00] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6350 ms. Remains : 620/620 places, 1312/1312 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
[2023-03-22 18:58:01] [INFO ] Flow matrix only has 1292 transitions (discarded 20 similar events)
[2023-03-22 18:58:01] [INFO ] Invariant cache hit.
[2023-03-22 18:58:02] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-22 18:58:02] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 227 ms returned sat
[2023-03-22 18:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:58:04] [INFO ] [Real]Absence check using state equation in 1789 ms returned sat
[2023-03-22 18:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:58:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-22 18:58:06] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 218 ms returned sat
[2023-03-22 18:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:58:08] [INFO ] [Nat]Absence check using state equation in 2202 ms returned sat
[2023-03-22 18:58:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:08] [INFO ] [Nat]Added 120 Read/Feed constraints in 250 ms returned sat
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 0 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 0 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 0 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2023-03-22 18:58:09] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2023-03-22 18:58:10] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 0 ms to minimize.
[2023-03-22 18:58:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1340 ms
[2023-03-22 18:58:10] [INFO ] Computed and/alt/rep : 510/1128/500 causal constraints (skipped 790 transitions) in 76 ms.
[2023-03-22 18:58:11] [INFO ] Added : 76 causal constraints over 16 iterations in 1508 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Product exploration explored 100000 steps with 3967 reset in 933 ms.
Product exploration explored 100000 steps with 3958 reset in 954 ms.
Support contains 84 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 1312/1312 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 620 transition count 1302
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 610 transition count 1302
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 600 transition count 1292
Applied a total of 40 rules in 29 ms. Remains 600 /620 variables (removed 20) and now considering 1292/1312 (removed 20) transitions.
[2023-03-22 18:58:13] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
// Phase 1: matrix 1272 rows 600 cols
[2023-03-22 18:58:13] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-22 18:58:14] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2023-03-22 18:58:14] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2023-03-22 18:58:14] [INFO ] Invariant cache hit.
[2023-03-22 18:58:14] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-22 18:58:14] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2023-03-22 18:58:14] [INFO ] Invariant cache hit.
[2023-03-22 18:58:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:20] [INFO ] Implicit Places using invariants and state equation in 5530 ms returned []
Implicit Place search using SMT with State Equation took 5993 ms to find 0 implicit places.
[2023-03-22 18:58:20] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 18:58:20] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2023-03-22 18:58:20] [INFO ] Invariant cache hit.
[2023-03-22 18:58:20] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/620 places, 1292/1312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7244 ms. Remains : 600/620 places, 1292/1312 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-08 finished in 48575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 31 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 29 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 18:58:20] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
// Phase 1: matrix 1462 rows 800 cols
[2023-03-22 18:58:20] [INFO ] Computed 56 place invariants in 28 ms
[2023-03-22 18:58:21] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
[2023-03-22 18:58:21] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:58:21] [INFO ] Invariant cache hit.
[2023-03-22 18:58:22] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-22 18:58:22] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:58:22] [INFO ] Invariant cache hit.
[2023-03-22 18:58:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:24] [INFO ] Implicit Places using invariants and state equation in 2710 ms returned []
Implicit Place search using SMT with State Equation took 3294 ms to find 0 implicit places.
[2023-03-22 18:58:24] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:58:24] [INFO ] Invariant cache hit.
[2023-03-22 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 800/820 places, 1482/1502 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4757 ms. Remains : 800/820 places, 1482/1502 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s11 1) (GEQ s633 1) (GEQ s697 1)) (AND (GEQ s4 1) (GEQ s626 1) (GEQ s697 1)) (AND (GEQ s5 1) (GEQ s627 1) (GEQ s697 1)) (AND (GEQ s10 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-09 finished in 4882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((X((!p2 U (!p3||G(!p2))))&&p1))))'
Support contains 82 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 810 transition count 1492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 810 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 800 transition count 1482
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 800 transition count 1482
Applied a total of 40 rules in 32 ms. Remains 800 /820 variables (removed 20) and now considering 1482/1502 (removed 20) transitions.
[2023-03-22 18:58:25] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:58:25] [INFO ] Invariant cache hit.
[2023-03-22 18:58:26] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
[2023-03-22 18:58:26] [INFO ] Flow matrix only has 1462 transitions (discarded 20 similar events)
[2023-03-22 18:58:26] [INFO ] Invariant cache hit.
[2023-03-22 18:58:27] [INFO ] Implicit Places using invariants in 540 ms returned [624, 625, 626, 627, 628, 629, 630, 631, 632, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 542 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 790/820 places, 1482/1502 transitions.
Applied a total of 0 rules in 8 ms. Remains 790 /790 variables (removed 0) and now considering 1482/1482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1294 ms. Remains : 790/820 places, 1482/1502 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 p3)), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3 p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 p0 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) p0) (AND p0 p3 p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p1) (AND p3 p2)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LT s713 1) (LT s712 1) (LT s711 1) (LT s710 1) (LT s717 1) (LT s716 1) (LT s715 1) (LT s714 1) (LT s719 1) (LT s718 1)), p0:(OR (AND (GEQ s113 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-10 finished in 1513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 33 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 820 transition count 1422
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 740 transition count 1422
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 160 place count 740 transition count 1322
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 360 place count 640 transition count 1322
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 480 place count 580 transition count 1262
Applied a total of 480 rules in 60 ms. Remains 580 /820 variables (removed 240) and now considering 1262/1502 (removed 240) transitions.
[2023-03-22 18:58:27] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-22 18:58:27] [INFO ] Computed 56 place invariants in 27 ms
[2023-03-22 18:58:27] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
[2023-03-22 18:58:27] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
[2023-03-22 18:58:27] [INFO ] Invariant cache hit.
[2023-03-22 18:58:28] [INFO ] Implicit Places using invariants in 534 ms returned [524, 525, 526, 527, 528, 529, 530, 531, 532, 533]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 536 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/820 places, 1262/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 560 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 560 transition count 1252
Applied a total of 20 rules in 30 ms. Remains 560 /570 variables (removed 10) and now considering 1252/1262 (removed 10) transitions.
[2023-03-22 18:58:28] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 560 cols
[2023-03-22 18:58:28] [INFO ] Computed 46 place invariants in 23 ms
[2023-03-22 18:58:29] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-22 18:58:29] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:29] [INFO ] Invariant cache hit.
[2023-03-22 18:58:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:35] [INFO ] Implicit Places using invariants and state equation in 6501 ms returned []
Implicit Place search using SMT with State Equation took 7003 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 560/820 places, 1252/1502 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8247 ms. Remains : 560/820 places, 1252/1502 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (GEQ s230 1) (GEQ s231 1) (GEQ s232 1) (GEQ s233 1) (GEQ s226 1) (GEQ s227 1) (GEQ s228 1) (GEQ s229 1) (GEQ s234 1) (GEQ s235 1) (GEQ s216 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2566 reset in 377 ms.
Product exploration explored 100000 steps with 2560 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2023-03-22 18:58:37] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:37] [INFO ] Invariant cache hit.
[2023-03-22 18:58:37] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 18:58:37] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 96 ms returned sat
[2023-03-22 18:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:58:39] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2023-03-22 18:58:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:58:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 18:58:39] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 83 ms returned sat
[2023-03-22 18:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:58:41] [INFO ] [Nat]Absence check using state equation in 1842 ms returned sat
[2023-03-22 18:58:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 300 ms returned sat
[2023-03-22 18:58:42] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 1 ms to minimize.
[2023-03-22 18:58:42] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2023-03-22 18:58:42] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 0 ms to minimize.
[2023-03-22 18:58:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 842 ms
[2023-03-22 18:58:42] [INFO ] Computed and/alt/rep : 450/918/440 causal constraints (skipped 790 transitions) in 76 ms.
[2023-03-22 18:58:43] [INFO ] Added : 60 causal constraints over 12 iterations in 1183 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 20 out of 560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1252/1252 transitions.
Applied a total of 0 rules in 19 ms. Remains 560 /560 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-22 18:58:43] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:43] [INFO ] Invariant cache hit.
[2023-03-22 18:58:44] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
[2023-03-22 18:58:44] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:44] [INFO ] Invariant cache hit.
[2023-03-22 18:58:45] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-22 18:58:45] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:45] [INFO ] Invariant cache hit.
[2023-03-22 18:58:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:51] [INFO ] Implicit Places using invariants and state equation in 5968 ms returned []
Implicit Place search using SMT with State Equation took 6459 ms to find 0 implicit places.
[2023-03-22 18:58:51] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 18:58:51] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:51] [INFO ] Invariant cache hit.
[2023-03-22 18:58:51] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7700 ms. Remains : 560/560 places, 1252/1252 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=38 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
[2023-03-22 18:58:52] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:58:52] [INFO ] Invariant cache hit.
[2023-03-22 18:58:52] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 18:58:52] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 88 ms returned sat
[2023-03-22 18:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:58:53] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-22 18:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:58:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 18:58:54] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 83 ms returned sat
[2023-03-22 18:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:58:56] [INFO ] [Nat]Absence check using state equation in 1847 ms returned sat
[2023-03-22 18:58:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:58:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 299 ms returned sat
[2023-03-22 18:58:57] [INFO ] Deduced a trap composed of 68 places in 222 ms of which 0 ms to minimize.
[2023-03-22 18:58:57] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2023-03-22 18:58:57] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
[2023-03-22 18:58:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 854 ms
[2023-03-22 18:58:57] [INFO ] Computed and/alt/rep : 450/918/440 causal constraints (skipped 790 transitions) in 76 ms.
[2023-03-22 18:58:58] [INFO ] Added : 60 causal constraints over 12 iterations in 1170 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2556 reset in 364 ms.
Product exploration explored 100000 steps with 2555 reset in 386 ms.
Support contains 20 out of 560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1252/1252 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 560 transition count 1242
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 550 transition count 1242
Applied a total of 20 rules in 19 ms. Remains 550 /560 variables (removed 10) and now considering 1242/1252 (removed 10) transitions.
[2023-03-22 18:58:59] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 550 cols
[2023-03-22 18:58:59] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-22 18:59:00] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2023-03-22 18:59:00] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:00] [INFO ] Invariant cache hit.
[2023-03-22 18:59:00] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-22 18:59:00] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:00] [INFO ] Invariant cache hit.
[2023-03-22 18:59:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:06] [INFO ] Implicit Places using invariants and state equation in 6090 ms returned []
Implicit Place search using SMT with State Equation took 6560 ms to find 0 implicit places.
[2023-03-22 18:59:06] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 18:59:06] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:06] [INFO ] Invariant cache hit.
[2023-03-22 18:59:07] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 550/560 places, 1242/1252 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7803 ms. Remains : 550/560 places, 1242/1252 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-11 finished in 40148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G((X(!p0)||p2)))))))'
Support contains 36 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Applied a total of 0 rules in 8 ms. Remains 820 /820 variables (removed 0) and now considering 1502/1502 (removed 0) transitions.
[2023-03-22 18:59:07] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
// Phase 1: matrix 1482 rows 820 cols
[2023-03-22 18:59:07] [INFO ] Computed 56 place invariants in 27 ms
[2023-03-22 18:59:08] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
[2023-03-22 18:59:08] [INFO ] Flow matrix only has 1482 transitions (discarded 20 similar events)
[2023-03-22 18:59:08] [INFO ] Invariant cache hit.
[2023-03-22 18:59:08] [INFO ] Implicit Places using invariants in 529 ms returned [624, 625, 626, 627, 628, 629, 630, 631, 632, 633]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 531 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 810/820 places, 1502/1502 transitions.
Applied a total of 0 rules in 10 ms. Remains 810 /810 variables (removed 0) and now considering 1502/1502 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1271 ms. Remains : 810/820 places, 1502/1502 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s664 1) (LT s665 1) (LT s668 1) (LT s669 1) (LT s666 1) (LT s667 1) (LT s672 1) (LT s673 1) (LT s670 1) (LT s671 1)), p1:(OR (AND (GEQ s299 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 31652 steps with 264 reset in 497 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-13 finished in 1960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 81 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 820 transition count 1412
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 730 transition count 1412
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 730 transition count 1312
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 630 transition count 1312
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 540 place count 550 transition count 1232
Applied a total of 540 rules in 45 ms. Remains 550 /820 variables (removed 270) and now considering 1232/1502 (removed 270) transitions.
[2023-03-22 18:59:09] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
// Phase 1: matrix 1212 rows 550 cols
[2023-03-22 18:59:09] [INFO ] Computed 56 place invariants in 20 ms
[2023-03-22 18:59:10] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
[2023-03-22 18:59:10] [INFO ] Flow matrix only has 1212 transitions (discarded 20 similar events)
[2023-03-22 18:59:10] [INFO ] Invariant cache hit.
[2023-03-22 18:59:10] [INFO ] Implicit Places using invariants in 477 ms returned [494, 495, 496, 497, 498, 499, 500, 501, 502, 503]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 479 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 540/820 places, 1232/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 530 transition count 1222
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 530 transition count 1222
Applied a total of 20 rules in 21 ms. Remains 530 /540 variables (removed 10) and now considering 1222/1232 (removed 10) transitions.
[2023-03-22 18:59:10] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 530 cols
[2023-03-22 18:59:10] [INFO ] Computed 46 place invariants in 18 ms
[2023-03-22 18:59:11] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-22 18:59:11] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:11] [INFO ] Invariant cache hit.
[2023-03-22 18:59:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:16] [INFO ] Implicit Places using invariants and state equation in 5487 ms returned []
Implicit Place search using SMT with State Equation took 5971 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 530/820 places, 1222/1502 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7137 ms. Remains : 530/820 places, 1222/1502 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s461 2) (GEQ s452 2) (GEQ s453 2) (GEQ s454 2) (GEQ s455 2) (GEQ s456 2) (GEQ s457 2) (GEQ s458 2) (GEQ s460 2) (GEQ s459 2) (AND (OR (LT s0 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4701 reset in 776 ms.
Product exploration explored 100000 steps with 4629 reset in 782 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 81 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 18 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-22 18:59:18] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:18] [INFO ] Invariant cache hit.
[2023-03-22 18:59:19] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
[2023-03-22 18:59:19] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:19] [INFO ] Invariant cache hit.
[2023-03-22 18:59:19] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-22 18:59:19] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:19] [INFO ] Invariant cache hit.
[2023-03-22 18:59:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:25] [INFO ] Implicit Places using invariants and state equation in 6079 ms returned []
Implicit Place search using SMT with State Equation took 6531 ms to find 0 implicit places.
[2023-03-22 18:59:25] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-22 18:59:25] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:25] [INFO ] Invariant cache hit.
[2023-03-22 18:59:26] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7698 ms. Remains : 530/530 places, 1222/1222 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4528 reset in 755 ms.
Product exploration explored 100000 steps with 4750 reset in 756 ms.
Support contains 81 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 1222/1222 transitions.
Applied a total of 0 rules in 16 ms. Remains 530 /530 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
[2023-03-22 18:59:28] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:28] [INFO ] Invariant cache hit.
[2023-03-22 18:59:29] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
[2023-03-22 18:59:29] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:29] [INFO ] Invariant cache hit.
[2023-03-22 18:59:29] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-22 18:59:29] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:29] [INFO ] Invariant cache hit.
[2023-03-22 18:59:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:35] [INFO ] Implicit Places using invariants and state equation in 6048 ms returned []
Implicit Place search using SMT with State Equation took 6507 ms to find 0 implicit places.
[2023-03-22 18:59:35] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 18:59:35] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2023-03-22 18:59:35] [INFO ] Invariant cache hit.
[2023-03-22 18:59:36] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7656 ms. Remains : 530/530 places, 1222/1222 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-14 finished in 26812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0 U (p1||G(p0))))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLFireability-01
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 21 out of 820 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 820/820 places, 1502/1502 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 820 transition count 1442
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 760 transition count 1432
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 750 transition count 1432
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 140 place count 750 transition count 1322
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 360 place count 640 transition count 1322
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 500 place count 570 transition count 1252
Applied a total of 500 rules in 51 ms. Remains 570 /820 variables (removed 250) and now considering 1252/1502 (removed 250) transitions.
[2023-03-22 18:59:36] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
// Phase 1: matrix 1232 rows 570 cols
[2023-03-22 18:59:36] [INFO ] Computed 56 place invariants in 20 ms
[2023-03-22 18:59:37] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
[2023-03-22 18:59:37] [INFO ] Flow matrix only has 1232 transitions (discarded 20 similar events)
[2023-03-22 18:59:37] [INFO ] Invariant cache hit.
[2023-03-22 18:59:37] [INFO ] Implicit Places using invariants in 521 ms returned [514, 515, 516, 517, 518, 519, 520, 521, 522, 523]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 522 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 560/820 places, 1252/1502 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 550 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 550 transition count 1242
Applied a total of 20 rules in 19 ms. Remains 550 /560 variables (removed 10) and now considering 1242/1252 (removed 10) transitions.
[2023-03-22 18:59:37] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 550 cols
[2023-03-22 18:59:37] [INFO ] Computed 46 place invariants in 21 ms
[2023-03-22 18:59:38] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-22 18:59:38] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:38] [INFO ] Invariant cache hit.
[2023-03-22 18:59:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:43] [INFO ] Implicit Places using invariants and state equation in 4823 ms returned []
Implicit Place search using SMT with State Equation took 5334 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 550/820 places, 1242/1502 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6546 ms. Remains : 550/820 places, 1242/1502 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (GEQ s405 1) (GEQ s404 1) (GEQ s403 1) (GEQ s402 1) (GEQ s401 1) (GEQ s400 1) (GEQ s399 1) (GEQ s398 1) (GEQ s407 1) (GEQ s406 1))) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3799 reset in 492 ms.
Product exploration explored 100000 steps with 3804 reset in 504 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:59:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:44] [INFO ] Invariant cache hit.
[2023-03-22 18:59:44] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 18:59:44] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 27 ms returned sat
[2023-03-22 18:59:44] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-22 18:59:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:44] [INFO ] Invariant cache hit.
[2023-03-22 18:59:45] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 18:59:45] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 113 ms returned sat
[2023-03-22 18:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:59:47] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2023-03-22 18:59:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:59:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 18:59:48] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 109 ms returned sat
[2023-03-22 18:59:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:59:49] [INFO ] [Nat]Absence check using state equation in 1575 ms returned sat
[2023-03-22 18:59:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 509 ms returned sat
[2023-03-22 18:59:50] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 1 ms to minimize.
[2023-03-22 18:59:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-22 18:59:50] [INFO ] Computed and/alt/rep : 440/918/430 causal constraints (skipped 790 transitions) in 77 ms.
[2023-03-22 18:59:51] [INFO ] Added : 41 causal constraints over 9 iterations in 808 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 21 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Applied a total of 0 rules in 5 ms. Remains 550 /550 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-22 18:59:51] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:51] [INFO ] Invariant cache hit.
[2023-03-22 18:59:51] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
[2023-03-22 18:59:51] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:51] [INFO ] Invariant cache hit.
[2023-03-22 18:59:52] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-22 18:59:52] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:52] [INFO ] Invariant cache hit.
[2023-03-22 18:59:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 18:59:56] [INFO ] Implicit Places using invariants and state equation in 4338 ms returned []
Implicit Place search using SMT with State Equation took 4814 ms to find 0 implicit places.
[2023-03-22 18:59:56] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:56] [INFO ] Invariant cache hit.
[2023-03-22 18:59:57] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5974 ms. Remains : 550/550 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 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 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 116 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 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-22 18:59:57] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 18:59:57] [INFO ] Invariant cache hit.
[2023-03-22 18:59:58] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 18:59:58] [INFO ] [Real]Absence check using 12 positive and 34 generalized place invariants in 113 ms returned sat
[2023-03-22 18:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:00:00] [INFO ] [Real]Absence check using state equation in 1465 ms returned sat
[2023-03-22 19:00:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:00:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-22 19:00:00] [INFO ] [Nat]Absence check using 12 positive and 34 generalized place invariants in 106 ms returned sat
[2023-03-22 19:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:00:02] [INFO ] [Nat]Absence check using state equation in 1506 ms returned sat
[2023-03-22 19:00:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 19:00:02] [INFO ] [Nat]Added 120 Read/Feed constraints in 511 ms returned sat
[2023-03-22 19:00:03] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 0 ms to minimize.
[2023-03-22 19:00:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2023-03-22 19:00:03] [INFO ] Computed and/alt/rep : 440/918/430 causal constraints (skipped 790 transitions) in 73 ms.
[2023-03-22 19:00:03] [INFO ] Added : 41 causal constraints over 9 iterations in 789 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3804 reset in 360 ms.
Product exploration explored 100000 steps with 3819 reset in 376 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 21 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Applied a total of 0 rules in 27 ms. Remains 550 /550 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-22 19:00:05] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 19:00:05] [INFO ] Invariant cache hit.
[2023-03-22 19:00:05] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
[2023-03-22 19:00:05] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 19:00:05] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 19:00:05] [INFO ] Invariant cache hit.
[2023-03-22 19:00:06] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1202 ms. Remains : 550/550 places, 1242/1242 transitions.
Support contains 21 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1242/1242 transitions.
Applied a total of 0 rules in 4 ms. Remains 550 /550 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-22 19:00:06] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 19:00:06] [INFO ] Invariant cache hit.
[2023-03-22 19:00:06] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2023-03-22 19:00:06] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 19:00:06] [INFO ] Invariant cache hit.
[2023-03-22 19:00:07] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-22 19:00:07] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 19:00:07] [INFO ] Invariant cache hit.
[2023-03-22 19:00:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-22 19:00:12] [INFO ] Implicit Places using invariants and state equation in 5432 ms returned []
Implicit Place search using SMT with State Equation took 5906 ms to find 0 implicit places.
[2023-03-22 19:00:12] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
[2023-03-22 19:00:12] [INFO ] Invariant cache hit.
[2023-03-22 19:00:13] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7087 ms. Remains : 550/550 places, 1242/1242 transitions.
Treatment of property PolyORBLF-COL-S02J06T10-LTLFireability-01 finished in 37189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(!p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-22 19:00:13] [INFO ] Flatten gal took : 74 ms
[2023-03-22 19:00:13] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-22 19:00:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 820 places, 1502 transitions and 6390 arcs took 8 ms.
Total runtime 237642 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1961/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1961/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1961/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1961/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-COL-S02J06T10-LTLFireability-01
Could not compute solution for formula : PolyORBLF-COL-S02J06T10-LTLFireability-08
Could not compute solution for formula : PolyORBLF-COL-S02J06T10-LTLFireability-11
Could not compute solution for formula : PolyORBLF-COL-S02J06T10-LTLFireability-14

BK_STOP 1679511617439

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBLF-COL-S02J06T10-LTLFireability-01
ltl formula formula --ltl=/tmp/1961/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 820 places, 1502 transitions and 6390 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.040 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PolyORBLF-COL-S02J06T10-LTLFireability-08
ltl formula formula --ltl=/tmp/1961/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 820 places, 1502 transitions and 6390 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.040 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name PolyORBLF-COL-S02J06T10-LTLFireability-11
ltl formula formula --ltl=/tmp/1961/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 820 places, 1502 transitions and 6390 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1961/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1961/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1961/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1961/ltl_2_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name PolyORBLF-COL-S02J06T10-LTLFireability-14
ltl formula formula --ltl=/tmp/1961/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 820 places, 1502 transitions and 6390 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1961/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1961/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1961/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1961/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size

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="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J06T10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950400388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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