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.r133-smll-167819411100484.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 itstools
Input is DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411100484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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 DoubleExponent-PT-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678501392769

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 02:23:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 02:23:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:23:16] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2023-03-11 02:23:16] [INFO ] Transformed 1064 places.
[2023-03-11 02:23:16] [INFO ] Transformed 998 transitions.
[2023-03-11 02:23:16] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 329 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:23:18] [INFO ] Invariants computation overflowed in 234 ms
[2023-03-11 02:23:19] [INFO ] Implicit Places using invariants in 1354 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:23:19] [INFO ] Invariants computation overflowed in 252 ms
[2023-03-11 02:23:20] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 2750 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:23:20] [INFO ] Invariants computation overflowed in 94 ms
[2023-03-11 02:23:21] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1060/1064 places, 998/998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4133 ms. Remains : 1060/1064 places, 998/998 transitions.
Support contains 42 out of 1060 places after structural reductions.
[2023-03-11 02:23:22] [INFO ] Flatten gal took : 155 ms
[2023-03-11 02:23:22] [INFO ] Flatten gal took : 92 ms
[2023-03-11 02:23:22] [INFO ] Input system was already deterministic with 998 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 853 ms. (steps per millisecond=11 ) properties (out of 26) seen :4
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 33 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:23:24] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-11 02:23:29] [INFO ] After 3886ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:20
[2023-03-11 02:23:31] [INFO ] Deduced a trap composed of 25 places in 918 ms of which 9 ms to minimize.
[2023-03-11 02:23:32] [INFO ] Deduced a trap composed of 16 places in 937 ms of which 2 ms to minimize.
[2023-03-11 02:23:32] [INFO ] Deduced a trap composed of 18 places in 714 ms of which 3 ms to minimize.
[2023-03-11 02:23:33] [INFO ] Deduced a trap composed of 41 places in 631 ms of which 3 ms to minimize.
[2023-03-11 02:23:33] [INFO ] Deduced a trap composed of 139 places in 391 ms of which 1 ms to minimize.
[2023-03-11 02:23:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4135 ms
[2023-03-11 02:23:34] [INFO ] Deduced a trap composed of 235 places in 357 ms of which 1 ms to minimize.
[2023-03-11 02:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 673 ms
[2023-03-11 02:23:35] [INFO ] After 9631ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-11 02:23:35] [INFO ] After 10826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-11 02:23:47] [INFO ] After 10401ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2023-03-11 02:23:47] [INFO ] Deduced a trap composed of 157 places in 327 ms of which 1 ms to minimize.
[2023-03-11 02:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-11 02:23:50] [INFO ] Deduced a trap composed of 151 places in 440 ms of which 2 ms to minimize.
[2023-03-11 02:23:50] [INFO ] Deduced a trap composed of 139 places in 347 ms of which 1 ms to minimize.
[2023-03-11 02:23:51] [INFO ] Deduced a trap composed of 125 places in 458 ms of which 1 ms to minimize.
[2023-03-11 02:23:52] [INFO ] Deduced a trap composed of 127 places in 516 ms of which 1 ms to minimize.
[2023-03-11 02:23:53] [INFO ] Deduced a trap composed of 115 places in 515 ms of which 1 ms to minimize.
[2023-03-11 02:23:53] [INFO ] Deduced a trap composed of 113 places in 600 ms of which 1 ms to minimize.
[2023-03-11 02:23:54] [INFO ] Deduced a trap composed of 101 places in 543 ms of which 1 ms to minimize.
[2023-03-11 02:23:55] [INFO ] Deduced a trap composed of 103 places in 673 ms of which 3 ms to minimize.
[2023-03-11 02:23:55] [INFO ] Deduced a trap composed of 89 places in 641 ms of which 1 ms to minimize.
[2023-03-11 02:23:56] [INFO ] Deduced a trap composed of 91 places in 616 ms of which 2 ms to minimize.
[2023-03-11 02:23:57] [INFO ] Deduced a trap composed of 77 places in 455 ms of which 1 ms to minimize.
[2023-03-11 02:23:57] [INFO ] Deduced a trap composed of 79 places in 420 ms of which 1 ms to minimize.
[2023-03-11 02:23:58] [INFO ] Deduced a trap composed of 65 places in 432 ms of which 1 ms to minimize.
[2023-03-11 02:23:58] [INFO ] Deduced a trap composed of 67 places in 449 ms of which 1 ms to minimize.
[2023-03-11 02:23:59] [INFO ] Deduced a trap composed of 41 places in 586 ms of which 2 ms to minimize.
[2023-03-11 02:24:00] [INFO ] Deduced a trap composed of 43 places in 502 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 02:24:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:24:00] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 31555 ms.
Support contains 33 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 1057 transition count 787
Reduce places removed 209 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 218 rules applied. Total rules applied 431 place count 848 transition count 778
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 440 place count 839 transition count 778
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 440 place count 839 transition count 739
Deduced a syphon composed of 39 places in 11 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 518 place count 800 transition count 739
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 14 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 866 place count 626 transition count 565
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 12 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 936 place count 591 transition count 565
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 938 place count 591 transition count 563
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 940 place count 589 transition count 563
Free-agglomeration rule (complex) applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 1013 place count 589 transition count 490
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 1086 place count 516 transition count 490
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 1173 place count 516 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1174 place count 515 transition count 489
Applied a total of 1174 rules in 400 ms. Remains 515 /1060 variables (removed 545) and now considering 489/998 (removed 509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 515/1060 places, 489/998 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 73 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 87 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 106639 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106639 steps, saw 53370 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 489 rows 515 cols
[2023-03-11 02:24:36] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-11 02:24:37] [INFO ] After 631ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-11 02:24:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-11 02:24:39] [INFO ] After 1568ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-11 02:24:39] [INFO ] After 2596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-11 02:24:42] [INFO ] After 2666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-11 02:24:48] [INFO ] After 6335ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-11 02:24:49] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2023-03-11 02:24:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2023-03-11 02:24:50] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2023-03-11 02:24:50] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 1 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 1 ms to minimize.
[2023-03-11 02:24:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1074 ms
[2023-03-11 02:24:52] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 1 ms to minimize.
[2023-03-11 02:24:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2023-03-11 02:24:52] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 1 ms to minimize.
[2023-03-11 02:24:53] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:24:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-03-11 02:24:53] [INFO ] After 11405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3178 ms.
[2023-03-11 02:24:57] [INFO ] After 18023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 30001 ms.
Support contains 33 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 489/489 transitions.
Applied a total of 0 rules in 43 ms. Remains 515 /515 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 515/515 places, 489/489 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 489/489 transitions.
Applied a total of 0 rules in 24 ms. Remains 515 /515 variables (removed 0) and now considering 489/489 (removed 0) transitions.
// Phase 1: matrix 489 rows 515 cols
[2023-03-11 02:25:27] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 02:25:27] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 489 rows 515 cols
[2023-03-11 02:25:27] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 02:25:27] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-11 02:25:51] [INFO ] Implicit Places using invariants and state equation in 23646 ms returned [14, 193, 216, 222, 252, 310, 315, 338, 374, 402, 423, 426, 430, 451, 457, 479, 484, 507, 513]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 24083 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/515 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 495 transition count 488
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 495 transition count 488
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 495 transition count 484
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 491 transition count 484
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 491 transition count 484
Applied a total of 19 rules in 118 ms. Remains 491 /496 variables (removed 5) and now considering 484/489 (removed 5) transitions.
// Phase 1: matrix 484 rows 491 cols
[2023-03-11 02:25:51] [INFO ] Computed 81 place invariants in 112 ms
[2023-03-11 02:25:52] [INFO ] Implicit Places using invariants in 979 ms returned [44, 50, 72, 77, 128, 134, 163, 186, 223, 269, 276, 385, 467]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 982 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 478/515 places, 484/489 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 478 transition count 476
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 476
Applied a total of 16 rules in 55 ms. Remains 470 /478 variables (removed 8) and now considering 476/484 (removed 8) transitions.
// Phase 1: matrix 476 rows 470 cols
[2023-03-11 02:25:52] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-11 02:25:52] [INFO ] Implicit Places using invariants in 559 ms returned []
// Phase 1: matrix 476 rows 470 cols
[2023-03-11 02:25:53] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-11 02:25:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-11 02:26:05] [INFO ] Implicit Places using invariants and state equation in 12106 ms returned []
Implicit Place search using SMT with State Equation took 12673 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/515 places, 476/489 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 37938 ms. Remains : 470/515 places, 476/489 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 U p1))))'
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 50 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:26:05] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-11 02:26:06] [INFO ] Implicit Places using invariants in 768 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:26:06] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-11 02:26:28] [INFO ] Implicit Places using invariants and state equation in 22900 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23672 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 180 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:26:29] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-11 02:26:29] [INFO ] Implicit Places using invariants in 790 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:26:30] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-11 02:26:51] [INFO ] Implicit Places using invariants and state equation in 21859 ms returned []
Implicit Place search using SMT with State Equation took 22652 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46557 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s922 1) (LT s591 1)), p0:(GEQ s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3301 reset in 371 ms.
Product exploration explored 100000 steps with 3323 reset in 394 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.21 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 501 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 296 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 161809 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161809 steps, saw 80926 distinct states, run finished after 3006 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:26:57] [INFO ] Invariants computation overflowed in 158 ms
[2023-03-11 02:27:00] [INFO ] After 2970ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 02:27:03] [INFO ] After 2876ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 02:27:04] [INFO ] Deduced a trap composed of 39 places in 475 ms of which 2 ms to minimize.
[2023-03-11 02:27:04] [INFO ] Deduced a trap composed of 42 places in 590 ms of which 9 ms to minimize.
[2023-03-11 02:27:05] [INFO ] Deduced a trap composed of 18 places in 655 ms of which 2 ms to minimize.
[2023-03-11 02:27:06] [INFO ] Deduced a trap composed of 127 places in 442 ms of which 1 ms to minimize.
[2023-03-11 02:27:06] [INFO ] Deduced a trap composed of 113 places in 493 ms of which 1 ms to minimize.
[2023-03-11 02:27:07] [INFO ] Deduced a trap composed of 115 places in 532 ms of which 1 ms to minimize.
[2023-03-11 02:27:08] [INFO ] Deduced a trap composed of 101 places in 507 ms of which 2 ms to minimize.
[2023-03-11 02:27:08] [INFO ] Deduced a trap composed of 103 places in 541 ms of which 2 ms to minimize.
[2023-03-11 02:27:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5112 ms
[2023-03-11 02:27:09] [INFO ] After 8615ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-11 02:27:09] [INFO ] After 9161ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2003 ms.
Support contains 3 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 926 place count 593 transition count 533
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 556 transition count 533
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 1079 place count 556 transition count 454
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 1158 place count 477 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1237 place count 477 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 476 transition count 453
Applied a total of 1238 rules in 165 ms. Remains 476 /1057 variables (removed 581) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 476/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 241129 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241129 steps, saw 120626 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-11 02:27:15] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 02:27:16] [INFO ] After 937ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 02:27:16] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:27:17] [INFO ] After 1025ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-11 02:27:17] [INFO ] After 1109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:27:17] [INFO ] After 2155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:27:18] [INFO ] After 984ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:18] [INFO ] After 142ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 02:27:18] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-11 02:27:18] [INFO ] After 1383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 627 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 26 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 26 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2023-03-11 02:27:19] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 02:27:20] [INFO ] Implicit Places using invariants in 822 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2023-03-11 02:27:20] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:27:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:27:50] [INFO ] Performed 332/476 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 02:28:05] [INFO ] Implicit Places using invariants and state equation in 44867 ms returned [451, 468, 474]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 45695 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 452
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 472 transition count 452
Applied a total of 3 rules in 48 ms. Remains 472 /473 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 472 cols
[2023-03-11 02:28:05] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 02:28:05] [INFO ] Implicit Places using invariants in 841 ms returned []
// Phase 1: matrix 452 rows 472 cols
[2023-03-11 02:28:06] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 02:28:06] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:28:22] [INFO ] Implicit Places using invariants and state equation in 16798 ms returned [73, 94, 99, 119, 146, 151, 152, 172, 198, 225, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 414, 420, 442, 447]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 17647 ms to find 25 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 447/476 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 447 transition count 443
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 438 transition count 443
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 438 transition count 443
Applied a total of 25 rules in 38 ms. Remains 438 /447 variables (removed 9) and now considering 443/452 (removed 9) transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-11 02:28:22] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-11 02:28:23] [INFO ] Implicit Places using invariants in 755 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2023-03-11 02:28:23] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:28:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:28:54] [INFO ] Performed 432/438 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 02:28:54] [INFO ] Implicit Places using invariants and state equation in 30969 ms returned []
Implicit Place search using SMT with State Equation took 31728 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 438/476 places, 443/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 95183 ms. Remains : 438/476 places, 443/453 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 76 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:28:55] [INFO ] Invariants computation overflowed in 239 ms
[2023-03-11 02:28:56] [INFO ] Implicit Places using invariants in 1158 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:28:56] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-11 02:29:20] [INFO ] Implicit Places using invariants and state equation in 24104 ms returned []
Implicit Place search using SMT with State Equation took 25264 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:29:20] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-11 02:29:21] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26538 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 316 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 179336 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179336 steps, saw 89688 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:29:25] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-11 02:29:28] [INFO ] After 2592ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 02:29:29] [INFO ] Deduced a trap composed of 39 places in 647 ms of which 1 ms to minimize.
[2023-03-11 02:29:29] [INFO ] Deduced a trap composed of 18 places in 700 ms of which 2 ms to minimize.
[2023-03-11 02:29:30] [INFO ] Deduced a trap composed of 115 places in 387 ms of which 1 ms to minimize.
[2023-03-11 02:29:30] [INFO ] Deduced a trap composed of 113 places in 358 ms of which 2 ms to minimize.
[2023-03-11 02:29:31] [INFO ] Deduced a trap composed of 145 places in 306 ms of which 1 ms to minimize.
[2023-03-11 02:29:31] [INFO ] Deduced a trap composed of 174 places in 283 ms of which 1 ms to minimize.
[2023-03-11 02:29:31] [INFO ] Deduced a trap composed of 150 places in 272 ms of which 1 ms to minimize.
[2023-03-11 02:29:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3453 ms
[2023-03-11 02:29:31] [INFO ] After 6300ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:29:31] [INFO ] After 6485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:29:34] [INFO ] After 2277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:29:35] [INFO ] Deduced a trap composed of 42 places in 543 ms of which 2 ms to minimize.
[2023-03-11 02:29:35] [INFO ] Deduced a trap composed of 18 places in 593 ms of which 1 ms to minimize.
[2023-03-11 02:29:36] [INFO ] Deduced a trap composed of 113 places in 490 ms of which 2 ms to minimize.
[2023-03-11 02:29:36] [INFO ] Deduced a trap composed of 115 places in 496 ms of which 1 ms to minimize.
[2023-03-11 02:29:37] [INFO ] Deduced a trap composed of 127 places in 498 ms of which 1 ms to minimize.
[2023-03-11 02:29:37] [INFO ] Deduced a trap composed of 142 places in 423 ms of which 5 ms to minimize.
[2023-03-11 02:29:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3466 ms
[2023-03-11 02:29:38] [INFO ] After 5865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-11 02:29:38] [INFO ] After 6142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 438 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 16 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 5 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 930 place count 591 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1006 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 1083 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1239 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1240 place count 475 transition count 453
Applied a total of 1240 rules in 210 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1302 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311464 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311464 steps, saw 155821 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:29:41] [INFO ] Computed 99 place invariants in 54 ms
[2023-03-11 02:29:42] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-11 02:29:42] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 74 ms returned sat
[2023-03-11 02:29:42] [INFO ] After 563ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 02:29:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:29:43] [INFO ] After 452ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:29:43] [INFO ] After 1257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:29:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 02:29:43] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 70 ms returned sat
[2023-03-11 02:29:43] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:29:44] [INFO ] After 405ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:29:44] [INFO ] After 455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 02:29:44] [INFO ] After 1317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 102 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 18 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 16 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-11 02:29:44] [INFO ] Invariant cache hit.
[2023-03-11 02:29:47] [INFO ] Implicit Places using invariants in 3013 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3016 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 50 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 02:29:47] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 02:29:48] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 02:29:48] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 02:29:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:30:07] [INFO ] Implicit Places using invariants and state equation in 19208 ms returned []
Implicit Place search using SMT with State Equation took 19790 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22872 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 343255 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 343255 steps, saw 171655 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 02:30:10] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 02:30:11] [INFO ] After 432ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 02:30:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:30:11] [INFO ] After 313ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:30:11] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:30:11] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:30:11] [INFO ] After 138ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:30:12] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 02:30:12] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 11 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 02:30:12] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 02:30:12] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 02:30:12] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-11 02:30:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:30:40] [INFO ] Implicit Places using invariants and state equation in 28309 ms returned []
Implicit Place search using SMT with State Equation took 28791 ms to find 0 implicit places.
[2023-03-11 02:30:40] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 02:30:40] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-11 02:30:41] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29158 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 37 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-11 02:30:41] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-11 02:30:42] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:30:43] [INFO ] After 928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 02:30:43] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:30:43] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 1 ms to minimize.
[2023-03-11 02:30:43] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2023-03-11 02:30:43] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 0 ms to minimize.
[2023-03-11 02:30:44] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2023-03-11 02:30:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2023-03-11 02:30:44] [INFO ] After 1150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 02:30:44] [INFO ] After 2233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3364 reset in 216 ms.
Product exploration explored 100000 steps with 3281 reset in 236 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1056 transition count 996
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 239 place count 1056 transition count 1035
Deduced a syphon composed of 280 places in 20 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 281 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 285 place count 1052 transition count 1031
Deduced a syphon composed of 276 places in 21 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 289 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 458 places in 13 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 471 place count 1052 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 472 place count 1051 transition count 1069
Deduced a syphon composed of 457 places in 13 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 473 place count 1051 transition count 1069
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -251
Deduced a syphon composed of 497 places in 10 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 513 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 554 place count 1010 transition count 1238
Deduced a syphon composed of 456 places in 7 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 595 place count 1010 transition count 1238
Deduced a syphon composed of 456 places in 6 ms
Applied a total of 595 rules in 781 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2023-03-11 02:30:46] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2023-03-11 02:30:46] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-11 02:30:47] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2196 ms. Remains : 1010/1057 places, 1238/997 transitions.
Built C files in :
/tmp/ltsmin13381161138851018920
[2023-03-11 02:30:48] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13381161138851018920
Running compilation step : cd /tmp/ltsmin13381161138851018920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13381161138851018920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13381161138851018920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 47 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:30:51] [INFO ] Invariants computation overflowed in 149 ms
[2023-03-11 02:30:51] [INFO ] Implicit Places using invariants in 854 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:30:52] [INFO ] Invariants computation overflowed in 138 ms
[2023-03-11 02:31:15] [INFO ] Implicit Places using invariants and state equation in 23043 ms returned []
Implicit Place search using SMT with State Equation took 23901 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:31:15] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-11 02:31:16] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25180 ms. Remains : 1057/1057 places, 997/997 transitions.
Built C files in :
/tmp/ltsmin9665720150888140397
[2023-03-11 02:31:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9665720150888140397
Running compilation step : cd /tmp/ltsmin9665720150888140397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2848 ms.
Running link step : cd /tmp/ltsmin9665720150888140397;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin9665720150888140397;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased315517262508040284.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 02:31:31] [INFO ] Flatten gal took : 89 ms
[2023-03-11 02:31:31] [INFO ] Flatten gal took : 82 ms
[2023-03-11 02:31:31] [INFO ] Time to serialize gal into /tmp/LTL6413238881274832436.gal : 15 ms
[2023-03-11 02:31:31] [INFO ] Time to serialize properties into /tmp/LTL1957700403081595703.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6413238881274832436.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15229957784864765835.hoa' '-atoms' '/tmp/LTL1957700403081595703.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1957700403081595703.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15229957784864765835.hoa
Detected timeout of ITS tools.
[2023-03-11 02:31:46] [INFO ] Flatten gal took : 43 ms
[2023-03-11 02:31:46] [INFO ] Flatten gal took : 41 ms
[2023-03-11 02:31:46] [INFO ] Time to serialize gal into /tmp/LTL9887006623642702702.gal : 6 ms
[2023-03-11 02:31:46] [INFO ] Time to serialize properties into /tmp/LTL12418359478680401939.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9887006623642702702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12418359478680401939.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p509>=1)")U("((p877>=1)||(p579<1))")))))
Formula 0 simplified : XF(!"(p509>=1)" R !"((p877>=1)||(p579<1))")
Detected timeout of ITS tools.
[2023-03-11 02:32:01] [INFO ] Flatten gal took : 36 ms
[2023-03-11 02:32:01] [INFO ] Applying decomposition
[2023-03-11 02:32:02] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7637717194744419755.txt' '-o' '/tmp/graph7637717194744419755.bin' '-w' '/tmp/graph7637717194744419755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7637717194744419755.bin' '-l' '-1' '-v' '-w' '/tmp/graph7637717194744419755.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:32:02] [INFO ] Decomposing Gal with order
[2023-03-11 02:32:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:32:02] [INFO ] Removed a total of 280 redundant transitions.
[2023-03-11 02:32:02] [INFO ] Flatten gal took : 225 ms
[2023-03-11 02:32:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 55 ms.
[2023-03-11 02:32:02] [INFO ] Time to serialize gal into /tmp/LTL17138492682555083910.gal : 44 ms
[2023-03-11 02:32:02] [INFO ] Time to serialize properties into /tmp/LTL18189336026757140090.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17138492682555083910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18189336026757140090.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i5.i1.i2.u225.p509>=1)")U("((i10.u393.p877>=1)||(i5.i0.i3.u255.p579<1))")))))
Formula 0 simplified : XF(!"(i5.i1.i2.u225.p509>=1)" R !"((i10.u393.p877>=1)||(i5.i0.i3.u255.p579<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16108086783611663484
[2023-03-11 02:32:17] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16108086783611663484
Running compilation step : cd /tmp/ltsmin16108086783611663484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2869 ms.
Running link step : cd /tmp/ltsmin16108086783611663484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16108086783611663484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 387728 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((G(p0)&&F((p1&&X((p1 U (p0||G(p1)))))))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1059 transition count 758
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 3 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 920 place count 599 transition count 537
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 996 place count 561 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 997 place count 560 transition count 536
Applied a total of 997 rules in 122 ms. Remains 560 /1060 variables (removed 500) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 560 cols
[2023-03-11 02:32:33] [INFO ] Computed 101 place invariants in 57 ms
[2023-03-11 02:32:33] [INFO ] Implicit Places using invariants in 693 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 696 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1060 places, 536/998 transitions.
Graph (complete) has 1745 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 554 transition count 532
Applied a total of 7 rules in 42 ms. Remains 554 /558 variables (removed 4) and now considering 532/536 (removed 4) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-11 02:32:33] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-11 02:32:34] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2023-03-11 02:32:34] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 02:32:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:32:49] [INFO ] Implicit Places using invariants and state equation in 15338 ms returned []
Implicit Place search using SMT with State Equation took 15787 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 554/1060 places, 532/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16650 ms. Remains : 554/1060 places, 532/998 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s44 1), p1:(GEQ s321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-02 finished in 16873 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(G(p0)))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1059 transition count 759
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 821 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 16 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 6 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 922 place count 598 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 998 place count 560 transition count 536
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 560 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 559 transition count 535
Applied a total of 1000 rules in 186 ms. Remains 559 /1060 variables (removed 501) and now considering 535/998 (removed 463) transitions.
// Phase 1: matrix 535 rows 559 cols
[2023-03-11 02:32:50] [INFO ] Computed 101 place invariants in 58 ms
[2023-03-11 02:32:50] [INFO ] Implicit Places using invariants in 548 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 550 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1060 places, 535/998 transitions.
Graph (complete) has 1749 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 553 transition count 531
Applied a total of 7 rules in 25 ms. Remains 553 /557 variables (removed 4) and now considering 531/535 (removed 4) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:32:50] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-11 02:32:51] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:32:51] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-11 02:32:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:33:21] [INFO ] Performed 255/553 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 02:33:28] [INFO ] Implicit Places using invariants and state equation in 36996 ms returned []
Implicit Place search using SMT with State Equation took 37568 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1060 places, 531/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38332 ms. Remains : 553/1060 places, 531/998 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s353 1) (LT s365 1)) (OR (LT s177 1) (LT s185 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13940 reset in 176 ms.
Product exploration explored 100000 steps with 13887 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
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 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 799 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265640 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265640 steps, saw 132859 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:33:31] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 02:33:31] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:33:33] [INFO ] After 1407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:33:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:33:34] [INFO ] After 1376ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:33:37] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 2 ms to minimize.
[2023-03-11 02:33:37] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 1 ms to minimize.
[2023-03-11 02:33:38] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 1 ms to minimize.
[2023-03-11 02:33:38] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 1 ms to minimize.
[2023-03-11 02:33:38] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 2 ms to minimize.
[2023-03-11 02:33:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1870 ms
[2023-03-11 02:33:39] [INFO ] After 5684ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-11 02:33:39] [INFO ] After 7534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 805 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 73 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1253 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294998 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294998 steps, saw 147585 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2023-03-11 02:33:43] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 02:33:43] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:33:44] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:33:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:33:45] [INFO ] After 1029ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:33:45] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 1 ms to minimize.
[2023-03-11 02:33:45] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2023-03-11 02:33:45] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:33:46] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 1 ms to minimize.
[2023-03-11 02:33:46] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 1 ms to minimize.
[2023-03-11 02:33:46] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 0 ms to minimize.
[2023-03-11 02:33:47] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2023-03-11 02:33:47] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2023-03-11 02:33:47] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2023-03-11 02:33:48] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 1 ms to minimize.
[2023-03-11 02:33:48] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 1 ms to minimize.
[2023-03-11 02:33:48] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2023-03-11 02:33:49] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2023-03-11 02:33:49] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 1 ms to minimize.
[2023-03-11 02:33:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4600 ms
[2023-03-11 02:33:49] [INFO ] After 5795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 573 ms.
[2023-03-11 02:33:50] [INFO ] After 6826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1771 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 11 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2023-03-11 02:33:52] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-11 02:33:52] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2023-03-11 02:33:52] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 02:33:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:34:19] [INFO ] Implicit Places using invariants and state equation in 27232 ms returned [48, 94, 338, 365, 371, 392, 394, 398, 418, 424, 446, 451, 472, 478]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 27730 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 466/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 466 transition count 453
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 461 transition count 453
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 461 transition count 453
Applied a total of 14 rules in 35 ms. Remains 461 /466 variables (removed 5) and now considering 453/458 (removed 5) transitions.
// Phase 1: matrix 453 rows 461 cols
[2023-03-11 02:34:20] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 02:34:20] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 453 rows 461 cols
[2023-03-11 02:34:20] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-11 02:34:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:34:43] [INFO ] Implicit Places using invariants and state equation in 23080 ms returned [97, 205, 231, 282, 287, 308, 340, 439]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 23574 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 453/480 places, 453/458 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 453 transition count 449
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 449 transition count 449
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 449 transition count 449
Applied a total of 11 rules in 30 ms. Remains 449 /453 variables (removed 4) and now considering 449/453 (removed 4) transitions.
// Phase 1: matrix 449 rows 449 cols
[2023-03-11 02:34:43] [INFO ] Computed 77 place invariants in 51 ms
[2023-03-11 02:34:44] [INFO ] Implicit Places using invariants in 929 ms returned [42, 67, 72, 115, 121, 148, 171, 176, 197, 209, 223, 250, 256]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 931 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 436/480 places, 449/458 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 436 transition count 441
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 428 transition count 441
Applied a total of 16 rules in 30 ms. Remains 428 /436 variables (removed 8) and now considering 441/449 (removed 8) transitions.
// Phase 1: matrix 441 rows 428 cols
[2023-03-11 02:34:44] [INFO ] Computed 64 place invariants in 82 ms
[2023-03-11 02:34:45] [INFO ] Implicit Places using invariants in 907 ms returned []
[2023-03-11 02:34:45] [INFO ] Invariant cache hit.
[2023-03-11 02:34:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:35:12] [INFO ] Implicit Places using invariants and state equation in 27032 ms returned []
Implicit Place search using SMT with State Equation took 27941 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 428/480 places, 441/458 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 80282 ms. Remains : 428/480 places, 441/458 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 24 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:35:12] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 02:35:13] [INFO ] Implicit Places using invariants in 485 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:35:13] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 02:35:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:35:39] [INFO ] Implicit Places using invariants and state equation in 26030 ms returned []
Implicit Place search using SMT with State Equation took 26517 ms to find 0 implicit places.
[2023-03-11 02:35:39] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:35:39] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 02:35:39] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26921 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
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 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 780 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276727 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276727 steps, saw 138417 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:35:42] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 02:35:42] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:35:44] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:35:45] [INFO ] After 1364ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:48] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-11 02:35:48] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 0 ms to minimize.
[2023-03-11 02:35:48] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 1 ms to minimize.
[2023-03-11 02:35:48] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
[2023-03-11 02:35:48] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2023-03-11 02:35:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1116 ms
[2023-03-11 02:35:49] [INFO ] After 4902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-11 02:35:49] [INFO ] After 6306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 481 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 37 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318250 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318250 steps, saw 159212 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2023-03-11 02:35:52] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 02:35:52] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:35:53] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:35:54] [INFO ] After 924ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:54] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:35:54] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:35:54] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:35:55] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2023-03-11 02:35:55] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2023-03-11 02:35:55] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 1 ms to minimize.
[2023-03-11 02:35:55] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 1 ms to minimize.
[2023-03-11 02:35:56] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 0 ms to minimize.
[2023-03-11 02:35:56] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 1 ms to minimize.
[2023-03-11 02:35:56] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2023-03-11 02:35:57] [INFO ] Deduced a trap composed of 20 places in 294 ms of which 1 ms to minimize.
[2023-03-11 02:35:57] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 1 ms to minimize.
[2023-03-11 02:35:57] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2023-03-11 02:35:57] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:35:57] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3502 ms
[2023-03-11 02:35:57] [INFO ] After 4549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 546 ms.
[2023-03-11 02:35:58] [INFO ] After 5512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1822 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2023-03-11 02:36:00] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-11 02:36:00] [INFO ] Implicit Places using invariants in 624 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2023-03-11 02:36:00] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 02:36:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:36:27] [INFO ] Implicit Places using invariants and state equation in 26325 ms returned [152, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 26953 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 467 transition count 452
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 461 transition count 452
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 461 transition count 452
Applied a total of 13 rules in 29 ms. Remains 461 /467 variables (removed 6) and now considering 452/458 (removed 6) transitions.
// Phase 1: matrix 452 rows 461 cols
[2023-03-11 02:36:27] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:36:27] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 452 rows 461 cols
[2023-03-11 02:36:27] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-11 02:36:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:36:54] [INFO ] Implicit Places using invariants and state equation in 26739 ms returned [42, 99, 125, 174, 232, 283, 288, 309, 337]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 27190 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 452/480 places, 452/458 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 451
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 9 place count 451 transition count 451
Applied a total of 9 rules in 31 ms. Remains 451 /452 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 451 cols
[2023-03-11 02:36:54] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 02:36:54] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 451 rows 451 cols
[2023-03-11 02:36:55] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 02:36:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:37:13] [INFO ] Implicit Places using invariants and state equation in 18945 ms returned [67, 72, 196, 202, 209, 223, 332]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 19443 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 444/480 places, 451/458 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 444 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 439 transition count 446
Applied a total of 10 rules in 18 ms. Remains 439 /444 variables (removed 5) and now considering 446/451 (removed 5) transitions.
// Phase 1: matrix 446 rows 439 cols
[2023-03-11 02:37:13] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 02:37:14] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 446 rows 439 cols
[2023-03-11 02:37:14] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 02:37:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:37:38] [INFO ] Implicit Places using invariants and state equation in 23696 ms returned []
Implicit Place search using SMT with State Equation took 24138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 439/480 places, 446/458 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 97812 ms. Remains : 439/480 places, 446/458 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13843 reset in 207 ms.
Product exploration explored 100000 steps with 13889 reset in 285 ms.
Built C files in :
/tmp/ltsmin1365245671212257741
[2023-03-11 02:37:38] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2023-03-11 02:37:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:37:38] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2023-03-11 02:37:38] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:37:38] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2023-03-11 02:37:38] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:37:38] [INFO ] Built C files in 148ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1365245671212257741
Running compilation step : cd /tmp/ltsmin1365245671212257741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2185 ms.
Running link step : cd /tmp/ltsmin1365245671212257741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin1365245671212257741;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14016971293591122145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 13 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:37:53] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 02:37:54] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:37:54] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 02:37:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:38:11] [INFO ] Implicit Places using invariants and state equation in 17379 ms returned []
Implicit Place search using SMT with State Equation took 17912 ms to find 0 implicit places.
[2023-03-11 02:38:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 02:38:11] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 02:38:12] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18390 ms. Remains : 553/553 places, 531/531 transitions.
Built C files in :
/tmp/ltsmin8112756079678527818
[2023-03-11 02:38:12] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2023-03-11 02:38:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:38:12] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2023-03-11 02:38:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:38:12] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2023-03-11 02:38:12] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:38:12] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8112756079678527818
Running compilation step : cd /tmp/ltsmin8112756079678527818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2044 ms.
Running link step : cd /tmp/ltsmin8112756079678527818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8112756079678527818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10026513092151663450.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 02:38:27] [INFO ] Flatten gal took : 28 ms
[2023-03-11 02:38:27] [INFO ] Flatten gal took : 27 ms
[2023-03-11 02:38:27] [INFO ] Time to serialize gal into /tmp/LTL15006629364107780983.gal : 4 ms
[2023-03-11 02:38:27] [INFO ] Time to serialize properties into /tmp/LTL9650162849657334253.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15006629364107780983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18156018149658731649.hoa' '-atoms' '/tmp/LTL9650162849657334253.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9650162849657334253.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18156018149658731649.hoa
Detected timeout of ITS tools.
[2023-03-11 02:38:42] [INFO ] Flatten gal took : 23 ms
[2023-03-11 02:38:42] [INFO ] Flatten gal took : 24 ms
[2023-03-11 02:38:42] [INFO ] Time to serialize gal into /tmp/LTL3933516796414448438.gal : 6 ms
[2023-03-11 02:38:42] [INFO ] Time to serialize properties into /tmp/LTL2908916035055048119.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3933516796414448438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2908916035055048119.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p654<1)||(p679<1))&&((p360<1)||(p372<1)))"))))
Formula 0 simplified : GF!"(((p654<1)||(p679<1))&&((p360<1)||(p372<1)))"
Detected timeout of ITS tools.
[2023-03-11 02:38:57] [INFO ] Flatten gal took : 23 ms
[2023-03-11 02:38:57] [INFO ] Applying decomposition
[2023-03-11 02:38:57] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17774621901116066617.txt' '-o' '/tmp/graph17774621901116066617.bin' '-w' '/tmp/graph17774621901116066617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17774621901116066617.bin' '-l' '-1' '-v' '-w' '/tmp/graph17774621901116066617.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:38:57] [INFO ] Decomposing Gal with order
[2023-03-11 02:38:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:38:57] [INFO ] Removed a total of 415 redundant transitions.
[2023-03-11 02:38:57] [INFO ] Flatten gal took : 59 ms
[2023-03-11 02:38:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 18 ms.
[2023-03-11 02:38:57] [INFO ] Time to serialize gal into /tmp/LTL18205455202261599644.gal : 10 ms
[2023-03-11 02:38:57] [INFO ] Time to serialize properties into /tmp/LTL16168365653460027372.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18205455202261599644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16168365653460027372.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i4.i1.i2.u130.p654<1)||(i5.u136.p679<1))&&((i3.u67.p360<1)||(i1.u52.p372<1)))"))))
Formula 0 simplified : GF!"(((i4.i1.i2.u130.p654<1)||(i5.u136.p679<1))&&((i3.u67.p360<1)||(i1.u52.p372<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3724677496342195687
[2023-03-11 02:39:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3724677496342195687
Running compilation step : cd /tmp/ltsmin3724677496342195687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1409 ms.
Running link step : cd /tmp/ltsmin3724677496342195687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3724677496342195687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 398225 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(F(p0))&&(X(p1) U ((!p2&&X(p1))||X(G(p1))))))'
Support contains 5 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 47 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:39:28] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-11 02:39:28] [INFO ] Implicit Places using invariants in 762 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:39:28] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-11 02:39:53] [INFO ] Implicit Places using invariants and state equation in 24386 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25150 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 95 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:39:53] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-11 02:39:54] [INFO ] Implicit Places using invariants in 718 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:39:54] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-11 02:40:21] [INFO ] Implicit Places using invariants and state equation in 27268 ms returned []
Implicit Place search using SMT with State Equation took 27988 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53282 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s577 1) (GEQ s655 1)) (NOT (AND (GEQ s732 1) (GEQ s749 1)))), p0:(AND (GEQ s577 1) (GEQ s655 1)), p1:(LT s1030 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 5 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-06 finished in 53511 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(G((p0&&(p1||F(p2))))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1059 transition count 765
Reduce places removed 232 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 234 rules applied. Total rules applied 466 place count 827 transition count 763
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 468 place count 825 transition count 763
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 468 place count 825 transition count 723
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 548 place count 785 transition count 723
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 914 place count 602 transition count 540
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 988 place count 565 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 989 place count 564 transition count 539
Applied a total of 989 rules in 102 ms. Remains 564 /1060 variables (removed 496) and now considering 539/998 (removed 459) transitions.
// Phase 1: matrix 539 rows 564 cols
[2023-03-11 02:40:21] [INFO ] Computed 101 place invariants in 61 ms
[2023-03-11 02:40:22] [INFO ] Implicit Places using invariants in 708 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 714 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1060 places, 539/998 transitions.
Graph (complete) has 1746 edges and 562 vertex of which 561 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 558 transition count 535
Applied a total of 7 rules in 33 ms. Remains 558 /562 variables (removed 4) and now considering 535/539 (removed 4) transitions.
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:40:22] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 02:40:22] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:40:22] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 02:40:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:40:41] [INFO ] Implicit Places using invariants and state equation in 18424 ms returned []
Implicit Place search using SMT with State Equation took 18939 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 558/1060 places, 535/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19789 ms. Remains : 558/1060 places, 535/998 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s159 1) (LT s166 1)), p1:(GEQ s137 1), p2:(LT s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13938 reset in 250 ms.
Product exploration explored 100000 steps with 13940 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 1351 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:40:42] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 02:40:43] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 02:40:46] [INFO ] After 2303ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 02:40:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:40:46] [INFO ] After 201ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 02:40:46] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 1 ms to minimize.
[2023-03-11 02:40:46] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2023-03-11 02:40:47] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2023-03-11 02:40:47] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 1 ms to minimize.
[2023-03-11 02:40:47] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2023-03-11 02:40:47] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 1 ms to minimize.
[2023-03-11 02:40:48] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2023-03-11 02:40:48] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 1 ms to minimize.
[2023-03-11 02:40:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2013 ms
[2023-03-11 02:40:48] [INFO ] After 2272ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 02:40:48] [INFO ] After 4741ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 52 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 319399 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319399 steps, saw 159797 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:40:51] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:40:52] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:40:52] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:40:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:40:53] [INFO ] After 298ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:40:53] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-11 02:40:53] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 0 ms to minimize.
[2023-03-11 02:40:54] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 1 ms to minimize.
[2023-03-11 02:40:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 956 ms
[2023-03-11 02:40:54] [INFO ] After 1319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-11 02:40:54] [INFO ] After 2186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:40:54] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-11 02:40:55] [INFO ] Implicit Places using invariants in 931 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:40:55] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 02:40:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:41:12] [INFO ] Implicit Places using invariants and state equation in 17594 ms returned [126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 283, 288, 308, 313, 334, 339, 360, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 18529 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 447/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 447 transition count 440
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 434 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 434 transition count 440
Applied a total of 28 rules in 35 ms. Remains 434 /447 variables (removed 13) and now considering 440/453 (removed 13) transitions.
// Phase 1: matrix 440 rows 434 cols
[2023-03-11 02:41:13] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 02:41:13] [INFO ] Implicit Places using invariants in 670 ms returned []
// Phase 1: matrix 440 rows 434 cols
[2023-03-11 02:41:13] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-11 02:41:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:41:41] [INFO ] Implicit Places using invariants and state equation in 28043 ms returned []
Implicit Place search using SMT with State Equation took 28715 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/475 places, 440/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 47292 ms. Remains : 434/475 places, 440/453 transitions.
Incomplete random walk after 10000 steps, including 1410 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 326343 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326343 steps, saw 163238 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 440 rows 434 cols
[2023-03-11 02:41:44] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-11 02:41:45] [INFO ] After 725ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:41:46] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:41:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:41:47] [INFO ] After 960ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:41:47] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 1 ms to minimize.
[2023-03-11 02:41:47] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 2 ms to minimize.
[2023-03-11 02:41:47] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2023-03-11 02:41:48] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 1 ms to minimize.
[2023-03-11 02:41:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1233 ms
[2023-03-11 02:41:48] [INFO ] After 2259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 296 ms.
[2023-03-11 02:41:48] [INFO ] After 3186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 434 /434 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 434/434 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 434 /434 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 434 cols
[2023-03-11 02:41:48] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-11 02:41:49] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 440 rows 434 cols
[2023-03-11 02:41:49] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-11 02:41:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:42:19] [INFO ] Performed 354/434 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-11 02:42:24] [INFO ] Implicit Places using invariants and state equation in 35383 ms returned [68, 120]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 36053 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 432/434 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 439
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 431 transition count 439
Applied a total of 3 rules in 32 ms. Remains 431 /432 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 431 cols
[2023-03-11 02:42:24] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 02:42:25] [INFO ] Implicit Places using invariants in 694 ms returned []
// Phase 1: matrix 439 rows 431 cols
[2023-03-11 02:42:25] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-11 02:42:26] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:42:55] [INFO ] Implicit Places using invariants and state equation in 29611 ms returned []
Implicit Place search using SMT with State Equation took 30309 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 431/434 places, 439/440 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66405 ms. Remains : 431/434 places, 439/440 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 449 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 558 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 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 13 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:42:55] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-11 02:42:56] [INFO ] Implicit Places using invariants in 614 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:42:56] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-11 02:42:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:43:10] [INFO ] Implicit Places using invariants and state equation in 13790 ms returned []
Implicit Place search using SMT with State Equation took 14405 ms to find 0 implicit places.
[2023-03-11 02:43:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:43:10] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 02:43:10] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14856 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1372 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 769 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 535 rows 558 cols
[2023-03-11 02:43:11] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-11 02:43:11] [INFO ] After 884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:43:12] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:43:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:43:13] [INFO ] After 1557ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:43:14] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-11 02:43:14] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 1 ms to minimize.
[2023-03-11 02:43:14] [INFO ] Deduced a trap composed of 23 places in 227 ms of which 0 ms to minimize.
[2023-03-11 02:43:15] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2023-03-11 02:43:15] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-11 02:43:15] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 0 ms to minimize.
[2023-03-11 02:43:15] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 1 ms to minimize.
[2023-03-11 02:43:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1905 ms
[2023-03-11 02:43:15] [INFO ] After 3604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-11 02:43:16] [INFO ] After 4128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 53 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318207 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318207 steps, saw 159200 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:43:19] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:43:19] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:43:20] [INFO ] After 669ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:43:20] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:43:20] [INFO ] After 301ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:43:21] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 1 ms to minimize.
[2023-03-11 02:43:21] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 1 ms to minimize.
[2023-03-11 02:43:22] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 1 ms to minimize.
[2023-03-11 02:43:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1008 ms
[2023-03-11 02:43:22] [INFO ] After 1377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-11 02:43:22] [INFO ] After 2246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:43:22] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:43:23] [INFO ] Implicit Places using invariants in 899 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 02:43:23] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:43:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:43:53] [INFO ] Performed 437/475 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-11 02:43:56] [INFO ] Implicit Places using invariants and state equation in 33431 ms returned [283, 450, 467, 473]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 34332 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 471/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 471 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 470 transition count 452
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 470 transition count 452
Applied a total of 4 rules in 36 ms. Remains 470 /471 variables (removed 1) and now considering 452/453 (removed 1) transitions.
// Phase 1: matrix 452 rows 470 cols
[2023-03-11 02:43:56] [INFO ] Computed 95 place invariants in 52 ms
[2023-03-11 02:43:59] [INFO ] Implicit Places using invariants in 2651 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 412, 418, 440, 445]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 2661 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 436/475 places, 452/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 436 transition count 434
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 418 transition count 434
Applied a total of 36 rules in 30 ms. Remains 418 /436 variables (removed 18) and now considering 434/452 (removed 18) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-11 02:43:59] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 02:43:59] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-11 02:43:59] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 02:44:00] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:44:14] [INFO ] Implicit Places using invariants and state equation in 14730 ms returned []
Implicit Place search using SMT with State Equation took 15365 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 52437 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 321932 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321932 steps, saw 160995 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-11 02:44:17] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-11 02:44:18] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:44:18] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:44:18] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:44:20] [INFO ] After 2008ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:44:21] [INFO ] Deduced a trap composed of 117 places in 276 ms of which 1 ms to minimize.
[2023-03-11 02:44:21] [INFO ] Deduced a trap composed of 127 places in 352 ms of which 4 ms to minimize.
[2023-03-11 02:44:22] [INFO ] Deduced a trap composed of 121 places in 363 ms of which 1 ms to minimize.
[2023-03-11 02:44:22] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 1 ms to minimize.
[2023-03-11 02:44:23] [INFO ] Deduced a trap composed of 114 places in 344 ms of which 1 ms to minimize.
[2023-03-11 02:44:24] [INFO ] Deduced a trap composed of 119 places in 270 ms of which 1 ms to minimize.
[2023-03-11 02:44:24] [INFO ] Deduced a trap composed of 111 places in 371 ms of which 1 ms to minimize.
[2023-03-11 02:44:24] [INFO ] Deduced a trap composed of 127 places in 363 ms of which 1 ms to minimize.
[2023-03-11 02:44:25] [INFO ] Deduced a trap composed of 126 places in 351 ms of which 1 ms to minimize.
[2023-03-11 02:44:25] [INFO ] Deduced a trap composed of 114 places in 262 ms of which 1 ms to minimize.
[2023-03-11 02:44:26] [INFO ] Deduced a trap composed of 109 places in 358 ms of which 1 ms to minimize.
[2023-03-11 02:44:26] [INFO ] Deduced a trap composed of 106 places in 353 ms of which 1 ms to minimize.
[2023-03-11 02:44:26] [INFO ] Deduced a trap composed of 121 places in 266 ms of which 1 ms to minimize.
[2023-03-11 02:44:27] [INFO ] Deduced a trap composed of 131 places in 361 ms of which 1 ms to minimize.
[2023-03-11 02:44:27] [INFO ] Deduced a trap composed of 131 places in 354 ms of which 1 ms to minimize.
[2023-03-11 02:44:27] [INFO ] Deduced a trap composed of 112 places in 306 ms of which 1 ms to minimize.
[2023-03-11 02:44:28] [INFO ] Deduced a trap composed of 115 places in 353 ms of which 1 ms to minimize.
[2023-03-11 02:44:28] [INFO ] Deduced a trap composed of 109 places in 269 ms of which 0 ms to minimize.
[2023-03-11 02:44:29] [INFO ] Deduced a trap composed of 111 places in 340 ms of which 0 ms to minimize.
[2023-03-11 02:44:29] [INFO ] Deduced a trap composed of 106 places in 339 ms of which 0 ms to minimize.
[2023-03-11 02:44:30] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 1 ms to minimize.
[2023-03-11 02:44:30] [INFO ] Deduced a trap composed of 125 places in 352 ms of which 0 ms to minimize.
[2023-03-11 02:44:31] [INFO ] Deduced a trap composed of 124 places in 354 ms of which 1 ms to minimize.
[2023-03-11 02:44:31] [INFO ] Deduced a trap composed of 127 places in 266 ms of which 0 ms to minimize.
[2023-03-11 02:44:31] [INFO ] Deduced a trap composed of 124 places in 355 ms of which 0 ms to minimize.
[2023-03-11 02:44:32] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2023-03-11 02:44:32] [INFO ] Deduced a trap composed of 129 places in 355 ms of which 0 ms to minimize.
[2023-03-11 02:44:33] [INFO ] Deduced a trap composed of 129 places in 371 ms of which 1 ms to minimize.
[2023-03-11 02:44:33] [INFO ] Deduced a trap composed of 121 places in 351 ms of which 1 ms to minimize.
[2023-03-11 02:44:34] [INFO ] Deduced a trap composed of 128 places in 349 ms of which 1 ms to minimize.
[2023-03-11 02:44:34] [INFO ] Deduced a trap composed of 122 places in 340 ms of which 1 ms to minimize.
[2023-03-11 02:44:34] [INFO ] Deduced a trap composed of 126 places in 338 ms of which 0 ms to minimize.
[2023-03-11 02:44:35] [INFO ] Deduced a trap composed of 120 places in 341 ms of which 1 ms to minimize.
[2023-03-11 02:44:36] [INFO ] Deduced a trap composed of 121 places in 267 ms of which 1 ms to minimize.
[2023-03-11 02:44:36] [INFO ] Deduced a trap composed of 120 places in 348 ms of which 1 ms to minimize.
[2023-03-11 02:44:36] [INFO ] Deduced a trap composed of 110 places in 356 ms of which 1 ms to minimize.
[2023-03-11 02:44:37] [INFO ] Deduced a trap composed of 124 places in 346 ms of which 1 ms to minimize.
[2023-03-11 02:44:37] [INFO ] Deduced a trap composed of 120 places in 349 ms of which 1 ms to minimize.
[2023-03-11 02:44:37] [INFO ] Deduced a trap composed of 128 places in 352 ms of which 1 ms to minimize.
[2023-03-11 02:44:38] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 1 ms to minimize.
[2023-03-11 02:44:38] [INFO ] Deduced a trap composed of 114 places in 339 ms of which 1 ms to minimize.
[2023-03-11 02:44:39] [INFO ] Deduced a trap composed of 125 places in 338 ms of which 1 ms to minimize.
[2023-03-11 02:44:39] [INFO ] Deduced a trap composed of 116 places in 332 ms of which 1 ms to minimize.
[2023-03-11 02:44:40] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 0 ms to minimize.
[2023-03-11 02:44:40] [INFO ] Deduced a trap composed of 123 places in 342 ms of which 1 ms to minimize.
[2023-03-11 02:44:41] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 0 ms to minimize.
[2023-03-11 02:44:41] [INFO ] Deduced a trap composed of 121 places in 342 ms of which 1 ms to minimize.
[2023-03-11 02:44:42] [INFO ] Deduced a trap composed of 118 places in 356 ms of which 1 ms to minimize.
[2023-03-11 02:44:42] [INFO ] Deduced a trap composed of 129 places in 341 ms of which 1 ms to minimize.
[2023-03-11 02:44:42] [INFO ] Deduced a trap composed of 135 places in 350 ms of which 1 ms to minimize.
[2023-03-11 02:44:43] [INFO ] Deduced a trap composed of 124 places in 357 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 02:44:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 02:44:43] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-11 02:44:43] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-11 02:44:43] [INFO ] Implicit Places using invariants in 601 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-11 02:44:43] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-11 02:44:44] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:44:59] [INFO ] Implicit Places using invariants and state equation in 15916 ms returned []
Implicit Place search using SMT with State Equation took 16519 ms to find 0 implicit places.
[2023-03-11 02:44:59] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-11 02:44:59] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-11 02:45:00] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16938 ms. Remains : 418/418 places, 434/434 transitions.
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13940 reset in 154 ms.
Product exploration explored 100000 steps with 13918 reset in 165 ms.
Built C files in :
/tmp/ltsmin15355738617479913672
[2023-03-11 02:45:01] [INFO ] Computing symmetric may disable matrix : 535 transitions.
[2023-03-11 02:45:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:45:01] [INFO ] Computing symmetric may enable matrix : 535 transitions.
[2023-03-11 02:45:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:45:01] [INFO ] Computing Do-Not-Accords matrix : 535 transitions.
[2023-03-11 02:45:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:45:01] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15355738617479913672
Running compilation step : cd /tmp/ltsmin15355738617479913672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1942 ms.
Running link step : cd /tmp/ltsmin15355738617479913672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15355738617479913672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4452269974325320617.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 558 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Applied a total of 2 rules in 18 ms. Remains 557 /558 variables (removed 1) and now considering 534/535 (removed 1) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 02:45:16] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 02:45:16] [INFO ] Implicit Places using invariants in 553 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 02:45:16] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-11 02:45:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 02:45:37] [INFO ] Implicit Places using invariants and state equation in 20496 ms returned []
Implicit Place search using SMT with State Equation took 21052 ms to find 0 implicit places.
[2023-03-11 02:45:37] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 02:45:37] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 02:45:37] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/558 places, 534/535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21720 ms. Remains : 557/558 places, 534/535 transitions.
Built C files in :
/tmp/ltsmin14612616432031641919
[2023-03-11 02:45:37] [INFO ] Computing symmetric may disable matrix : 534 transitions.
[2023-03-11 02:45:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:45:37] [INFO ] Computing symmetric may enable matrix : 534 transitions.
[2023-03-11 02:45:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:45:38] [INFO ] Computing Do-Not-Accords matrix : 534 transitions.
[2023-03-11 02:45:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 02:45:38] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14612616432031641919
Running compilation step : cd /tmp/ltsmin14612616432031641919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1912 ms.
Running link step : cd /tmp/ltsmin14612616432031641919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14612616432031641919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5793281095420356574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 02:45:53] [INFO ] Flatten gal took : 20 ms
[2023-03-11 02:45:53] [INFO ] Flatten gal took : 20 ms
[2023-03-11 02:45:53] [INFO ] Time to serialize gal into /tmp/LTL15582064088097329698.gal : 4 ms
[2023-03-11 02:45:53] [INFO ] Time to serialize properties into /tmp/LTL9088074349795426373.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15582064088097329698.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9822859278502650717.hoa' '-atoms' '/tmp/LTL9088074349795426373.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9088074349795426373.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9822859278502650717.hoa
Detected timeout of ITS tools.
[2023-03-11 02:46:08] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:46:08] [INFO ] Flatten gal took : 19 ms
[2023-03-11 02:46:08] [INFO ] Time to serialize gal into /tmp/LTL14678652911695407460.gal : 4 ms
[2023-03-11 02:46:08] [INFO ] Time to serialize properties into /tmp/LTL2802998505919114067.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14678652911695407460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2802998505919114067.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p321<1)||(p328<1))")&&(("(p284>=1)")||(F("(p38<1)")))))))
Formula 0 simplified : GF(!"((p321<1)||(p328<1))" | (!"(p284>=1)" & G!"(p38<1)"))
Detected timeout of ITS tools.
[2023-03-11 02:46:23] [INFO ] Flatten gal took : 18 ms
[2023-03-11 02:46:23] [INFO ] Applying decomposition
[2023-03-11 02:46:23] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5042684105029285119.txt' '-o' '/tmp/graph5042684105029285119.bin' '-w' '/tmp/graph5042684105029285119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5042684105029285119.bin' '-l' '-1' '-v' '-w' '/tmp/graph5042684105029285119.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:46:23] [INFO ] Decomposing Gal with order
[2023-03-11 02:46:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:46:23] [INFO ] Removed a total of 402 redundant transitions.
[2023-03-11 02:46:23] [INFO ] Flatten gal took : 48 ms
[2023-03-11 02:46:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 18 ms.
[2023-03-11 02:46:23] [INFO ] Time to serialize gal into /tmp/LTL1064676031897725157.gal : 10 ms
[2023-03-11 02:46:23] [INFO ] Time to serialize properties into /tmp/LTL16184707873727952417.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1064676031897725157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16184707873727952417.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i3.i1.u59.p321<1)||(i3.i1.u56.p328<1))")&&(("(i3.i0.u47.p284>=1)")||(F("(i0.i1.u73.p38<1)")))))))
Formula 0 simplified : GF(!"((i3.i1.u59.p321<1)||(i3.i1.u56.p328<1))" | (!"(i3.i0.u47.p284>=1)" & G!"(i0.i1.u73.p38<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11007688107864820335
[2023-03-11 02:46:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11007688107864820335
Running compilation step : cd /tmp/ltsmin11007688107864820335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1393 ms.
Running link step : cd /tmp/ltsmin11007688107864820335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11007688107864820335;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)&&((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 392096 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(p0) U p1)||!p0) U X(p2))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 47 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:46:53] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-11 02:46:54] [INFO ] Implicit Places using invariants in 749 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:46:54] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-11 02:47:17] [INFO ] Implicit Places using invariants and state equation in 23175 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 23928 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 95 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:47:17] [INFO ] Invariants computation overflowed in 156 ms
[2023-03-11 02:47:18] [INFO ] Implicit Places using invariants in 909 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:47:18] [INFO ] Invariants computation overflowed in 215 ms
[2023-03-11 02:47:42] [INFO ] Implicit Places using invariants and state equation in 24054 ms returned []
Implicit Place search using SMT with State Equation took 24969 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49041 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 378 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s231 1) (GEQ s244 1)), p1:(GEQ s867 1), p2:(GEQ s668 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33268 reset in 579 ms.
Product exploration explored 100000 steps with 33283 reset in 672 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1734 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 79338 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79338 steps, saw 39678 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:47:50] [INFO ] Invariants computation overflowed in 150 ms
[2023-03-11 02:47:55] [INFO ] After 4474ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2023-03-11 02:47:57] [INFO ] Deduced a trap composed of 163 places in 317 ms of which 4 ms to minimize.
[2023-03-11 02:47:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2023-03-11 02:47:58] [INFO ] Deduced a trap composed of 199 places in 237 ms of which 1 ms to minimize.
[2023-03-11 02:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-11 02:47:58] [INFO ] After 7359ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-11 02:47:58] [INFO ] After 8032ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-11 02:48:16] [INFO ] After 17555ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-11 02:48:19] [INFO ] Deduced a trap composed of 163 places in 290 ms of which 1 ms to minimize.
[2023-03-11 02:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2023-03-11 02:48:19] [INFO ] Deduced a trap composed of 205 places in 226 ms of which 1 ms to minimize.
[2023-03-11 02:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2023-03-11 02:48:23] [INFO ] After 24236ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 02:48:23] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :12
Fused 19 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 12715 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 13 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 112 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 478/1057 places, 455/997 transitions.
Incomplete random walk after 10000 steps, including 1282 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 323154 steps, run timeout after 9001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 323154 steps, saw 161669 distinct states, run finished after 9001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:48:48] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 02:48:49] [INFO ] After 776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 02:48:51] [INFO ] After 2127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 02:48:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:48:54] [INFO ] After 2891ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-11 02:48:55] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 0 ms to minimize.
[2023-03-11 02:48:55] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:48:55] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 0 ms to minimize.
[2023-03-11 02:48:55] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 0 ms to minimize.
[2023-03-11 02:48:55] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2023-03-11 02:48:55] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 0 ms to minimize.
[2023-03-11 02:48:56] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 1 ms to minimize.
[2023-03-11 02:48:56] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 0 ms to minimize.
[2023-03-11 02:48:56] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 0 ms to minimize.
[2023-03-11 02:48:56] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 0 ms to minimize.
[2023-03-11 02:48:57] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 0 ms to minimize.
[2023-03-11 02:48:57] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:48:57] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 0 ms to minimize.
[2023-03-11 02:48:57] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 1 ms to minimize.
[2023-03-11 02:48:58] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 1 ms to minimize.
[2023-03-11 02:48:58] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:48:59] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 0 ms to minimize.
[2023-03-11 02:48:59] [INFO ] Deduced a trap composed of 57 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:48:59] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2023-03-11 02:49:00] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2023-03-11 02:49:00] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 1 ms to minimize.
[2023-03-11 02:49:00] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2023-03-11 02:49:00] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 0 ms to minimize.
[2023-03-11 02:49:01] [INFO ] Deduced a trap composed of 28 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:49:01] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 1 ms to minimize.
[2023-03-11 02:49:01] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2023-03-11 02:49:01] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2023-03-11 02:49:02] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 1 ms to minimize.
[2023-03-11 02:49:02] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 1 ms to minimize.
[2023-03-11 02:49:03] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2023-03-11 02:49:03] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 0 ms to minimize.
[2023-03-11 02:49:03] [INFO ] Deduced a trap composed of 34 places in 208 ms of which 1 ms to minimize.
[2023-03-11 02:49:04] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2023-03-11 02:49:05] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 0 ms to minimize.
[2023-03-11 02:49:05] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2023-03-11 02:49:05] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 1 ms to minimize.
[2023-03-11 02:49:06] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2023-03-11 02:49:06] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2023-03-11 02:49:07] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 0 ms to minimize.
[2023-03-11 02:49:07] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 0 ms to minimize.
[2023-03-11 02:49:07] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2023-03-11 02:49:07] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 0 ms to minimize.
[2023-03-11 02:49:08] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 0 ms to minimize.
[2023-03-11 02:49:08] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 13889 ms
[2023-03-11 02:49:11] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-11 02:49:11] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2023-03-11 02:49:11] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:49:12] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 1 ms to minimize.
[2023-03-11 02:49:12] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 0 ms to minimize.
[2023-03-11 02:49:12] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2023-03-11 02:49:12] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 0 ms to minimize.
[2023-03-11 02:49:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1675 ms
[2023-03-11 02:49:13] [INFO ] After 21779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 778 ms.
[2023-03-11 02:49:14] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 14011 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 16 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:49:28] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 02:49:28] [INFO ] Implicit Places using invariants in 697 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:49:29] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 02:49:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:49:59] [INFO ] Performed 381/478 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-11 02:50:10] [INFO ] Implicit Places using invariants and state equation in 41423 ms returned [362]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 42124 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 477/478 places, 455/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 477 transition count 455
Applied a total of 1 rules in 22 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2023-03-11 02:50:10] [INFO ] Computed 98 place invariants in 62 ms
[2023-03-11 02:50:12] [INFO ] Implicit Places using invariants in 1686 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180, 201, 207, 214, 228, 233, 256, 262, 284, 289, 310, 315, 336, 341, 367, 388, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1687 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 442 transition count 437
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 424 transition count 437
Applied a total of 36 rules in 22 ms. Remains 424 /442 variables (removed 18) and now considering 437/455 (removed 18) transitions.
// Phase 1: matrix 437 rows 424 cols
[2023-03-11 02:50:12] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-11 02:50:12] [INFO ] Implicit Places using invariants in 511 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2023-03-11 02:50:12] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 02:50:13] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:50:30] [INFO ] Implicit Places using invariants and state equation in 18266 ms returned []
Implicit Place search using SMT with State Equation took 18779 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62646 ms. Remains : 424/478 places, 437/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2123 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 47 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:50:33] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-11 02:50:34] [INFO ] Implicit Places using invariants in 820 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:50:34] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-11 02:50:58] [INFO ] Implicit Places using invariants and state equation in 24032 ms returned []
Implicit Place search using SMT with State Equation took 24855 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:50:58] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-11 02:50:59] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26113 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1969 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 162224 steps, run timeout after 6001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 162224 steps, saw 81134 distinct states, run finished after 6001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:51:10] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-11 02:51:12] [INFO ] After 1503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-11 02:51:13] [INFO ] Deduced a trap composed of 39 places in 632 ms of which 1 ms to minimize.
[2023-03-11 02:51:14] [INFO ] Deduced a trap composed of 149 places in 631 ms of which 1 ms to minimize.
[2023-03-11 02:51:15] [INFO ] Deduced a trap composed of 45 places in 680 ms of which 1 ms to minimize.
[2023-03-11 02:51:15] [INFO ] Deduced a trap composed of 18 places in 588 ms of which 2 ms to minimize.
[2023-03-11 02:51:16] [INFO ] Deduced a trap composed of 151 places in 331 ms of which 2 ms to minimize.
[2023-03-11 02:51:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3375 ms
[2023-03-11 02:51:16] [INFO ] After 4923ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:51:16] [INFO ] After 5333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 02:51:22] [INFO ] After 5541ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 02:51:23] [INFO ] Deduced a trap composed of 25 places in 708 ms of which 3 ms to minimize.
[2023-03-11 02:51:23] [INFO ] Deduced a trap composed of 18 places in 719 ms of which 1 ms to minimize.
[2023-03-11 02:51:24] [INFO ] Deduced a trap composed of 16 places in 776 ms of which 2 ms to minimize.
[2023-03-11 02:51:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2474 ms
[2023-03-11 02:51:25] [INFO ] Deduced a trap composed of 125 places in 357 ms of which 1 ms to minimize.
[2023-03-11 02:51:25] [INFO ] Deduced a trap composed of 163 places in 312 ms of which 1 ms to minimize.
[2023-03-11 02:51:26] [INFO ] Deduced a trap composed of 139 places in 339 ms of which 1 ms to minimize.
[2023-03-11 02:51:26] [INFO ] Deduced a trap composed of 149 places in 311 ms of which 0 ms to minimize.
[2023-03-11 02:51:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1620 ms
[2023-03-11 02:51:33] [INFO ] After 16618ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 5624 ms.
[2023-03-11 02:51:39] [INFO ] After 22721ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4164 ms.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 1055 transition count 756
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 816 transition count 716
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 776 transition count 716
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 594 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 998 place count 557 transition count 534
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1076 place count 557 transition count 456
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1154 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1235 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1236 place count 478 transition count 455
Applied a total of 1236 rules in 114 ms. Remains 478 /1057 variables (removed 579) and now considering 455/997 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 478/1057 places, 455/997 transitions.
Incomplete random walk after 10000 steps, including 1300 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 118811 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118811 steps, saw 59453 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:51:48] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 02:51:48] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 02:51:49] [INFO ] After 1340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 02:51:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:51:53] [INFO ] After 3463ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 02:51:53] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 0 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 1 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2023-03-11 02:51:54] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 4 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 1 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 0 ms to minimize.
[2023-03-11 02:51:55] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 0 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 1 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
[2023-03-11 02:51:56] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 0 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 1 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 1 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2023-03-11 02:51:57] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 0 ms to minimize.
[2023-03-11 02:51:58] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2023-03-11 02:51:58] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2023-03-11 02:51:58] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2023-03-11 02:51:59] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 1 ms to minimize.
[2023-03-11 02:51:59] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5359 ms
[2023-03-11 02:52:00] [INFO ] After 10722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1130 ms.
[2023-03-11 02:52:01] [INFO ] After 13410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:52:07] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 02:52:08] [INFO ] Implicit Places using invariants in 733 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:52:08] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 02:52:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:52:38] [INFO ] Performed 345/478 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-11 02:52:51] [INFO ] Implicit Places using invariants and state equation in 42800 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 43538 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 477/478 places, 455/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 477 transition count 455
Applied a total of 1 rules in 22 ms. Remains 477 /477 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 477 cols
[2023-03-11 02:52:51] [INFO ] Computed 98 place invariants in 52 ms
[2023-03-11 02:52:52] [INFO ] Implicit Places using invariants in 1668 ms returned [47, 67, 72, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 283, 288, 309, 314, 335, 340, 361, 367, 388, 391, 395, 415, 421, 443, 448, 452, 469, 475]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 1670 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 442/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 442 transition count 437
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 424 transition count 437
Applied a total of 36 rules in 23 ms. Remains 424 /442 variables (removed 18) and now considering 437/455 (removed 18) transitions.
// Phase 1: matrix 437 rows 424 cols
[2023-03-11 02:52:53] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:52:53] [INFO ] Implicit Places using invariants in 554 ms returned []
// Phase 1: matrix 437 rows 424 cols
[2023-03-11 02:52:53] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:52:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 02:53:22] [INFO ] Implicit Places using invariants and state equation in 28939 ms returned []
Implicit Place search using SMT with State Equation took 29495 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 74759 ms. Remains : 424/478 places, 437/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1949 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 303 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 321 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33414 reset in 579 ms.
Product exploration explored 100000 steps with 33287 reset in 590 ms.
Built C files in :
/tmp/ltsmin8146477969744988381
[2023-03-11 02:53:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8146477969744988381
Running compilation step : cd /tmp/ltsmin8146477969744988381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2812 ms.
Running link step : cd /tmp/ltsmin8146477969744988381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8146477969744988381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9726561623754272723.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 51 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:53:42] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-11 02:53:42] [INFO ] Implicit Places using invariants in 771 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:53:42] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-11 02:54:05] [INFO ] Implicit Places using invariants and state equation in 23060 ms returned []
Implicit Place search using SMT with State Equation took 23839 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:54:05] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-11 02:54:06] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25145 ms. Remains : 1057/1057 places, 997/997 transitions.
Built C files in :
/tmp/ltsmin4715772836655326906
[2023-03-11 02:54:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4715772836655326906
Running compilation step : cd /tmp/ltsmin4715772836655326906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2696 ms.
Running link step : cd /tmp/ltsmin4715772836655326906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4715772836655326906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased649224037975464661.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 02:54:22] [INFO ] Flatten gal took : 24 ms
[2023-03-11 02:54:22] [INFO ] Flatten gal took : 24 ms
[2023-03-11 02:54:22] [INFO ] Time to serialize gal into /tmp/LTL11822745521206528470.gal : 8 ms
[2023-03-11 02:54:22] [INFO ] Time to serialize properties into /tmp/LTL4241285283053111594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11822745521206528470.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10145836872255573711.hoa' '-atoms' '/tmp/LTL4241285283053111594.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4241285283053111594.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10145836872255573711.hoa
Detected timeout of ITS tools.
[2023-03-11 02:54:37] [INFO ] Flatten gal took : 24 ms
[2023-03-11 02:54:37] [INFO ] Flatten gal took : 25 ms
[2023-03-11 02:54:37] [INFO ] Time to serialize gal into /tmp/LTL12339552578511439688.gal : 5 ms
[2023-03-11 02:54:37] [INFO ] Time to serialize properties into /tmp/LTL9339289669473468584.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12339552578511439688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9339289669473468584.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((p254>=1)&&(p266>=1))"))U("(p827>=1)"))||(!("((p254>=1)&&(p266>=1))")))U(X("(p648>=1)"))))))
Formula 0 simplified : G((!"((p254>=1)&&(p266>=1))" | (F"((p254>=1)&&(p266>=1))" U "(p827>=1)")) U X"(p648>=1)")
Detected timeout of ITS tools.
[2023-03-11 02:54:52] [INFO ] Flatten gal took : 28 ms
[2023-03-11 02:54:52] [INFO ] Applying decomposition
[2023-03-11 02:54:52] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2649606435445829575.txt' '-o' '/tmp/graph2649606435445829575.bin' '-w' '/tmp/graph2649606435445829575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2649606435445829575.bin' '-l' '-1' '-v' '-w' '/tmp/graph2649606435445829575.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:54:52] [INFO ] Decomposing Gal with order
[2023-03-11 02:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:54:52] [INFO ] Removed a total of 282 redundant transitions.
[2023-03-11 02:54:52] [INFO ] Flatten gal took : 64 ms
[2023-03-11 02:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 11 ms.
[2023-03-11 02:54:52] [INFO ] Time to serialize gal into /tmp/LTL16966715627715353785.gal : 12 ms
[2023-03-11 02:54:52] [INFO ] Time to serialize properties into /tmp/LTL8948216173103542614.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16966715627715353785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8948216173103542614.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((i2.u102.p254>=1)&&(i1.u79.p266>=1))"))U("(i9.u379.p827>=1)"))||(!("((i2.u102.p254>=1)&&(i1.u79.p266>=1))")))U(X("(i7.i0...182
Formula 0 simplified : G((!"((i2.u102.p254>=1)&&(i1.u79.p266>=1))" | (F"((i2.u102.p254>=1)&&(i1.u79.p266>=1))" U "(i9.u379.p827>=1)")) U X"(i7.i0.i1.i0.u29...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13554427462692606204
[2023-03-11 02:55:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13554427462692606204
Running compilation step : cd /tmp/ltsmin13554427462692606204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13554427462692606204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13554427462692606204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 497062 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((G(F(p0))||G(p1))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1059 transition count 761
Reduce places removed 236 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 239 rules applied. Total rules applied 475 place count 823 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 3 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 994 place count 562 transition count 538
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 996 place count 562 transition count 538
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 997 place count 561 transition count 537
Iterating global reduction 3 with 1 rules applied. Total rules applied 998 place count 561 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 560 transition count 536
Applied a total of 999 rules in 116 ms. Remains 560 /1060 variables (removed 500) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 560 cols
[2023-03-11 02:55:10] [INFO ] Computed 101 place invariants in 62 ms
[2023-03-11 02:55:11] [INFO ] Implicit Places using invariants in 708 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 710 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1060 places, 536/998 transitions.
Graph (complete) has 1747 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 554 transition count 532
Applied a total of 7 rules in 23 ms. Remains 554 /558 variables (removed 4) and now considering 532/536 (removed 4) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-11 02:55:11] [INFO ] Computed 99 place invariants in 62 ms
[2023-03-11 02:55:12] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-11 02:55:12] [INFO ] Invariant cache hit.
[2023-03-11 02:55:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:55:31] [INFO ] Implicit Places using invariants and state equation in 19337 ms returned []
Implicit Place search using SMT with State Equation took 19871 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 554/1060 places, 532/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20721 ms. Remains : 554/1060 places, 532/998 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s265 1) (LT s310 1)), p0:(OR (LT s10 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13833 reset in 133 ms.
Product exploration explored 100000 steps with 13914 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 799 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 196222 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196222 steps, saw 98149 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 02:55:35] [INFO ] Invariant cache hit.
[2023-03-11 02:55:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 02:55:35] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 69 ms returned sat
[2023-03-11 02:55:36] [INFO ] After 1328ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 02:55:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 02:55:36] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 67 ms returned sat
[2023-03-11 02:55:38] [INFO ] After 1911ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 02:55:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 02:55:44] [INFO ] After 5345ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-11 02:55:44] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2023-03-11 02:55:44] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-03-11 02:55:44] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 1 ms to minimize.
[2023-03-11 02:55:45] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2023-03-11 02:55:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 982 ms
[2023-03-11 02:55:45] [INFO ] After 6550ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1222 ms.
[2023-03-11 02:55:46] [INFO ] After 9870ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1663 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 234 place count 476 transition count 454
Applied a total of 234 rules in 42 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1244 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 317808 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317808 steps, saw 158998 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-11 02:55:51] [INFO ] Computed 99 place invariants in 49 ms
[2023-03-11 02:55:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 02:55:51] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 57 ms returned sat
[2023-03-11 02:55:52] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:55:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 02:55:52] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 55 ms returned sat
[2023-03-11 02:55:52] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:55:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:55:58] [INFO ] After 5337ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:55:58] [INFO ] After 5557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-11 02:55:58] [INFO ] After 6360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2023-03-11 02:56:00] [INFO ] Invariant cache hit.
[2023-03-11 02:56:02] [INFO ] Implicit Places using invariants in 2161 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 232, 255, 261, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 2163 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 439 transition count 436
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 421 transition count 436
Applied a total of 37 rules in 28 ms. Remains 421 /439 variables (removed 18) and now considering 436/454 (removed 18) transitions.
// Phase 1: matrix 436 rows 421 cols
[2023-03-11 02:56:02] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 02:56:03] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-11 02:56:03] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 02:56:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:56:33] [INFO ] Performed 361/421 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 02:56:37] [INFO ] Implicit Places using invariants and state equation in 33709 ms returned []
Implicit Place search using SMT with State Equation took 34303 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 421/476 places, 436/454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36506 ms. Remains : 421/476 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1480 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 324024 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 324024 steps, saw 162044 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 436 rows 421 cols
[2023-03-11 02:56:40] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-11 02:56:40] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:56:41] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:56:44] [INFO ] After 3312ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:56:45] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-11 02:56:45] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2023-03-11 02:56:45] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2023-03-11 02:56:45] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2023-03-11 02:56:45] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:56:45] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2023-03-11 02:56:46] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:56:46] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 0 ms to minimize.
[2023-03-11 02:56:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1273 ms
[2023-03-11 02:56:46] [INFO ] After 4782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-11 02:56:46] [INFO ] After 5468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2023-03-11 02:56:48] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-11 02:56:48] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-11 02:56:49] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 02:56:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:57:15] [INFO ] Implicit Places using invariants and state equation in 26585 ms returned []
Implicit Place search using SMT with State Equation took 27155 ms to find 0 implicit places.
[2023-03-11 02:57:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-11 02:57:15] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 02:57:16] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27597 ms. Remains : 421/421 places, 436/436 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-09 finished in 125484 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(G((p0||X(G(p1)))))))'
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 46 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:57:16] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-11 02:57:17] [INFO ] Implicit Places using invariants in 816 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:57:17] [INFO ] Invariants computation overflowed in 149 ms
[2023-03-11 02:57:42] [INFO ] Implicit Places using invariants and state equation in 25168 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25986 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 92 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:57:42] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-11 02:57:43] [INFO ] Implicit Places using invariants in 856 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:57:43] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-11 02:58:11] [INFO ] Implicit Places using invariants and state equation in 28329 ms returned []
Implicit Place search using SMT with State Equation took 29187 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55313 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s579 1), p0:(AND (GEQ s17 1) (GEQ s35 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 3 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 55514 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(G(p0))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 47 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:58:11] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-11 02:58:12] [INFO ] Implicit Places using invariants in 822 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:58:12] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-11 02:58:35] [INFO ] Implicit Places using invariants and state equation in 23357 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24181 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 94 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:58:36] [INFO ] Invariants computation overflowed in 148 ms
[2023-03-11 02:58:36] [INFO ] Implicit Places using invariants in 828 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 02:58:37] [INFO ] Invariants computation overflowed in 200 ms
[2023-03-11 02:59:01] [INFO ] Implicit Places using invariants and state equation in 24338 ms returned []
Implicit Place search using SMT with State Equation took 25167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49490 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s481 1) (GEQ s548 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 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 49641 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(X(F(p0))))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 48 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:59:01] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-11 02:59:02] [INFO ] Implicit Places using invariants in 780 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:59:02] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-11 02:59:03] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:59:03] [INFO ] Invariants computation overflowed in 134 ms
[2023-03-11 02:59:04] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3270 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 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}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s659 1) (LT s666 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 450 ms.
Product exploration explored 100000 steps with 20000 reset in 407 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 329 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187213 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187213 steps, saw 93622 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 02:59:09] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-11 02:59:11] [INFO ] After 2122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:13] [INFO ] After 1731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:13] [INFO ] After 1935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-11 02:59:13] [INFO ] After 2171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1702 ms.
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 239 rules applied. Total rules applied 240 place count 1057 transition count 760
Reduce places removed 236 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 238 rules applied. Total rules applied 478 place count 821 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 819 transition count 758
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 480 place count 819 transition count 717
Deduced a syphon composed of 41 places in 10 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 562 place count 778 transition count 717
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 4 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 3 with 368 rules applied. Total rules applied 930 place count 594 transition count 533
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1006 place count 556 transition count 533
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1083 place count 556 transition count 456
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1160 place count 479 transition count 456
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1241 place count 479 transition count 456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1242 place count 478 transition count 455
Applied a total of 1242 rules in 115 ms. Remains 478 /1060 variables (removed 582) and now considering 455/998 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 478/1060 places, 455/998 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318769 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318769 steps, saw 159482 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 02:59:18] [INFO ] Computed 100 place invariants in 89 ms
[2023-03-11 02:59:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 02:59:18] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 73 ms returned sat
[2023-03-11 02:59:19] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 02:59:19] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 70 ms returned sat
[2023-03-11 02:59:19] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:59:20] [INFO ] After 515ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 1 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2023-03-11 02:59:20] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 0 ms to minimize.
[2023-03-11 02:59:21] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 1 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2023-03-11 02:59:22] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
[2023-03-11 02:59:23] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 1 ms to minimize.
[2023-03-11 02:59:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2987 ms
[2023-03-11 02:59:23] [INFO ] After 3539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-11 02:59:23] [INFO ] After 4183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 824 ms.
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 12 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-11 02:59:24] [INFO ] Invariant cache hit.
[2023-03-11 02:59:26] [INFO ] Implicit Places using invariants in 2539 ms returned [14, 19, 44, 50, 70, 75, 96, 101, 121, 127, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 284, 289, 310, 316, 337, 342, 363, 369, 390, 392, 396, 416, 422, 444, 449, 453, 470, 476]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2541 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 438/478 places, 455/455 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 437 transition count 454
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 22 place count 437 transition count 434
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 42 place count 417 transition count 434
Applied a total of 42 rules in 29 ms. Remains 417 /438 variables (removed 21) and now considering 434/455 (removed 21) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-11 02:59:26] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 02:59:27] [INFO ] Implicit Places using invariants in 585 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-11 02:59:27] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 02:59:27] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:59:54] [INFO ] Implicit Places using invariants and state equation in 26973 ms returned []
Implicit Place search using SMT with State Equation took 27561 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/478 places, 434/455 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30143 ms. Remains : 417/478 places, 434/455 transitions.
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327652 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327652 steps, saw 163853 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 417 cols
[2023-03-11 02:59:57] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 02:59:57] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:58] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 02:59:58] [INFO ] After 592ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:59] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2023-03-11 02:59:59] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-11 02:59:59] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2023-03-11 02:59:59] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2023-03-11 02:59:59] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2023-03-11 03:00:00] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-11 03:00:00] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2023-03-11 03:00:00] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 0 ms to minimize.
[2023-03-11 03:00:00] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2023-03-11 03:00:00] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 0 ms to minimize.
[2023-03-11 03:00:00] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 1 ms to minimize.
[2023-03-11 03:00:01] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2023-03-11 03:00:01] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-11 03:00:01] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 0 ms to minimize.
[2023-03-11 03:00:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2518 ms
[2023-03-11 03:00:01] [INFO ] After 3230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-11 03:00:01] [INFO ] After 3897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 482 ms.
Support contains 2 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-11 03:00:02] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 03:00:02] [INFO ] Implicit Places using invariants in 582 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-11 03:00:02] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 03:00:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:00:26] [INFO ] Implicit Places using invariants and state equation in 23898 ms returned []
Implicit Place search using SMT with State Equation took 24482 ms to find 0 implicit places.
[2023-03-11 03:00:26] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-11 03:00:26] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 03:00:27] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24921 ms. Remains : 417/417 places, 434/434 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 417 transition count 397
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 380 transition count 397
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 94 place count 360 transition count 377
Iterating global reduction 0 with 20 rules applied. Total rules applied 114 place count 360 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 359 transition count 376
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 359 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 120 place count 357 transition count 374
Applied a total of 120 rules in 32 ms. Remains 357 /417 variables (removed 60) and now considering 374/434 (removed 60) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 357 cols
[2023-03-11 03:00:27] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-11 03:00:27] [INFO ] After 482ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:00:28] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:00:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 03:00:28] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:00:28] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:00:28] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2023-03-11 03:00:28] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-11 03:00:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 409 ms
[2023-03-11 03:00:28] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 03:00:28] [INFO ] After 931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 47 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 03:00:29] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-11 03:00:29] [INFO ] Implicit Places using invariants in 815 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 03:00:30] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-11 03:00:54] [INFO ] Implicit Places using invariants and state equation in 25039 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25857 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 96 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 03:00:55] [INFO ] Invariants computation overflowed in 149 ms
[2023-03-11 03:00:55] [INFO ] Implicit Places using invariants in 829 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 03:00:56] [INFO ] Invariants computation overflowed in 217 ms
[2023-03-11 03:01:23] [INFO ] Implicit Places using invariants and state equation in 27574 ms returned []
Implicit Place search using SMT with State Equation took 28405 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54406 ms. Remains : 1057/1060 places, 997/998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 186998 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186998 steps, saw 93512 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 03:01:26] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-11 03:01:28] [INFO ] After 1881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:01:30] [INFO ] After 1600ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:01:31] [INFO ] Deduced a trap composed of 113 places in 355 ms of which 1 ms to minimize.
[2023-03-11 03:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-11 03:01:31] [INFO ] After 2173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-11 03:01:31] [INFO ] After 2423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1398 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 480 place count 816 transition count 714
Deduced a syphon composed of 42 places in 10 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1239 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 476 transition count 454
Applied a total of 1240 rules in 120 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310322 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310322 steps, saw 155249 distinct states, run finished after 3004 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-11 03:01:35] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 03:01:36] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:01:36] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:01:36] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:01:37] [INFO ] After 710ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:01:37] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2023-03-11 03:01:37] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 1 ms to minimize.
[2023-03-11 03:01:38] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 0 ms to minimize.
[2023-03-11 03:01:38] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2023-03-11 03:01:38] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2023-03-11 03:01:38] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 0 ms to minimize.
[2023-03-11 03:01:38] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 0 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 1 ms to minimize.
[2023-03-11 03:01:39] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 0 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-11 03:01:40] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 0 ms to minimize.
[2023-03-11 03:01:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3374 ms
[2023-03-11 03:01:41] [INFO ] After 4125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-11 03:01:41] [INFO ] After 4711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 785 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-11 03:01:41] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 03:01:42] [INFO ] Implicit Places using invariants in 877 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-11 03:01:42] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-11 03:01:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:02:13] [INFO ] Performed 401/476 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-11 03:02:15] [INFO ] Implicit Places using invariants and state equation in 32605 ms returned [282, 390, 442, 447, 468, 474]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 33484 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 452
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 468 transition count 452
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 468 transition count 452
Applied a total of 6 rules in 34 ms. Remains 468 /470 variables (removed 2) and now considering 452/454 (removed 2) transitions.
// Phase 1: matrix 452 rows 468 cols
[2023-03-11 03:02:15] [INFO ] Computed 93 place invariants in 47 ms
[2023-03-11 03:02:18] [INFO ] Implicit Places using invariants in 2735 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 286, 307, 313, 334, 339, 360, 366, 387, 392, 412, 418, 446]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 2736 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 436/476 places, 452/454 transitions.
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 436 transition count 435
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 34 place count 419 transition count 435
Applied a total of 34 rules in 30 ms. Remains 419 /436 variables (removed 17) and now considering 435/452 (removed 17) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:02:18] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-11 03:02:18] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:02:18] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 03:02:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:02:45] [INFO ] Implicit Places using invariants and state equation in 26724 ms returned []
Implicit Place search using SMT with State Equation took 27352 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 63648 ms. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327606 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 327606 steps, saw 163830 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:02:48] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 03:02:49] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:02:49] [INFO ] After 374ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:02:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:02:50] [INFO ] After 542ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-11 03:02:50] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2023-03-11 03:02:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1339 ms
[2023-03-11 03:02:51] [INFO ] After 2001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 03:02:51] [INFO ] After 2504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 305 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:02:51] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 03:02:52] [INFO ] Implicit Places using invariants in 572 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:02:52] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-11 03:02:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:03:22] [INFO ] Performed 409/419 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:03:23] [INFO ] Implicit Places using invariants and state equation in 31334 ms returned []
Implicit Place search using SMT with State Equation took 31907 ms to find 0 implicit places.
[2023-03-11 03:03:23] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:03:23] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 03:03:24] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32296 ms. Remains : 419/419 places, 435/435 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 379 ms.
Product exploration explored 100000 steps with 20000 reset in 388 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1056 transition count 996
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 237 place count 1056 transition count 1035
Deduced a syphon composed of 279 places in 14 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 280 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 284 place count 1052 transition count 1031
Deduced a syphon composed of 275 places in 13 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 288 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 457 places in 8 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 470 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 471 place count 1051 transition count 1070
Deduced a syphon composed of 456 places in 9 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 472 place count 1051 transition count 1070
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -250
Deduced a syphon composed of 496 places in 8 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 512 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 553 place count 1010 transition count 1238
Deduced a syphon composed of 455 places in 8 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 594 place count 1010 transition count 1238
Deduced a syphon composed of 455 places in 8 ms
Applied a total of 594 rules in 262 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2023-03-11 03:03:26] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2023-03-11 03:03:26] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-11 03:03:27] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1606 ms. Remains : 1010/1057 places, 1238/997 transitions.
Built C files in :
/tmp/ltsmin14632112808381756890
[2023-03-11 03:03:27] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14632112808381756890
Running compilation step : cd /tmp/ltsmin14632112808381756890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2779 ms.
Running link step : cd /tmp/ltsmin14632112808381756890;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14632112808381756890;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11647092720966956891.hoa' '--buchi-type=spotba'
LTSmin run took 565 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 269542 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))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1059 transition count 758
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 924 place count 597 transition count 535
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1000 place count 559 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1001 place count 558 transition count 534
Applied a total of 1001 rules in 88 ms. Remains 558 /1060 variables (removed 502) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2023-03-11 03:03:31] [INFO ] Computed 101 place invariants in 58 ms
[2023-03-11 03:03:31] [INFO ] Implicit Places using invariants in 717 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 720 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1060 places, 534/998 transitions.
Graph (complete) has 1743 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 552 transition count 530
Applied a total of 7 rules in 24 ms. Remains 552 /556 variables (removed 4) and now considering 530/534 (removed 4) transitions.
// Phase 1: matrix 530 rows 552 cols
[2023-03-11 03:03:31] [INFO ] Computed 99 place invariants in 64 ms
[2023-03-11 03:03:32] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-11 03:03:32] [INFO ] Invariant cache hit.
[2023-03-11 03:03:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:04:02] [INFO ] Performed 320/552 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:04:24] [INFO ] Implicit Places using invariants and state equation in 51749 ms returned []
Implicit Place search using SMT with State Equation took 52555 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/1060 places, 530/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53388 ms. Remains : 552/1060 places, 530/998 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s73 1)], 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][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 53452 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))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1059 transition count 757
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 819 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 819 transition count 717
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 779 transition count 717
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 4 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 597 transition count 535
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1000 place count 559 transition count 535
Applied a total of 1000 rules in 83 ms. Remains 559 /1060 variables (removed 501) and now considering 535/998 (removed 463) transitions.
// Phase 1: matrix 535 rows 559 cols
[2023-03-11 03:04:24] [INFO ] Computed 101 place invariants in 65 ms
[2023-03-11 03:04:24] [INFO ] Implicit Places using invariants in 496 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 498 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1060 places, 535/998 transitions.
Graph (complete) has 1753 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 553 transition count 531
Applied a total of 7 rules in 24 ms. Remains 553 /557 variables (removed 4) and now considering 531/535 (removed 4) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 03:04:24] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-11 03:04:25] [INFO ] Implicit Places using invariants in 483 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-11 03:04:25] [INFO ] Invariants computation overflowed in 16 ms
[2023-03-11 03:04:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 03:04:49] [INFO ] Implicit Places using invariants and state equation in 24164 ms returned []
Implicit Place search using SMT with State Equation took 24658 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1060 places, 531/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25265 ms. Remains : 553/1060 places, 531/998 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s142 1)], 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][true]]
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Product exploration explored 100000 steps with 50000 reset in 438 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 1749 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/553 stabilizing places and 2/531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-14 finished in 26269 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)))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 47 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 03:04:50] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-11 03:04:51] [INFO ] Implicit Places using invariants in 765 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-11 03:04:51] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-11 03:05:16] [INFO ] Implicit Places using invariants and state equation in 24947 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25721 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 96 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 03:05:16] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-11 03:05:17] [INFO ] Implicit Places using invariants in 827 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-11 03:05:17] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-11 03:05:18] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27910 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-15 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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s445 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-15 finished in 28028 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 U p1))))'
Found a Lengthening insensitive property : DoubleExponent-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 474 place count 822 transition count 721
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 552 place count 783 transition count 721
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 3 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 992 place count 563 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 993 place count 562 transition count 537
Applied a total of 993 rules in 102 ms. Remains 562 /1060 variables (removed 498) and now considering 537/998 (removed 461) transitions.
// Phase 1: matrix 537 rows 562 cols
[2023-03-11 03:05:19] [INFO ] Computed 101 place invariants in 65 ms
[2023-03-11 03:05:19] [INFO ] Implicit Places using invariants in 710 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 713 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 560/1060 places, 537/998 transitions.
Graph (complete) has 1745 edges and 560 vertex of which 559 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 556 transition count 533
Applied a total of 7 rules in 27 ms. Remains 556 /560 variables (removed 4) and now considering 533/537 (removed 4) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-11 03:05:19] [INFO ] Computed 99 place invariants in 62 ms
[2023-03-11 03:05:20] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-11 03:05:20] [INFO ] Invariant cache hit.
[2023-03-11 03:05:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:05:42] [INFO ] Implicit Places using invariants and state equation in 22296 ms returned []
Implicit Place search using SMT with State Equation took 23005 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 556/1060 places, 533/998 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 23848 ms. Remains : 556/1060 places, 533/998 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s482 1) (LT s308 1)), p0:(GEQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13935 reset in 161 ms.
Product exploration explored 100000 steps with 13858 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 315 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1406 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 807 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 183608 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183608 steps, saw 91841 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:05:46] [INFO ] Invariant cache hit.
[2023-03-11 03:05:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 03:05:47] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 60 ms returned sat
[2023-03-11 03:05:47] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:05:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 03:05:48] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 66 ms returned sat
[2023-03-11 03:05:48] [INFO ] After 925ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 03:05:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:05:49] [INFO ] After 314ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 03:05:49] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-11 03:05:49] [INFO ] After 1618ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 739 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 555 transition count 453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 476 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 238 place count 476 transition count 453
Applied a total of 238 rules in 41 ms. Remains 476 /556 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 476/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 778 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 210539 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210539 steps, saw 105326 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-11 03:05:53] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 03:05:54] [INFO ] After 892ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:05:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:05:55] [INFO ] After 863ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:05:55] [INFO ] After 1881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:05:56] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:05:56] [INFO ] After 677ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:05:57] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-11 03:05:57] [INFO ] After 1775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 557 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2023-03-11 03:05:57] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 03:05:58] [INFO ] Implicit Places using invariants in 728 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2023-03-11 03:05:58] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-11 03:05:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:06:28] [INFO ] Implicit Places using invariants and state equation in 30281 ms returned [225, 366, 387, 389, 393, 414, 442, 447, 468, 474]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 31011 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 466/476 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 463 transition count 450
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 463 transition count 450
Applied a total of 9 rules in 35 ms. Remains 463 /466 variables (removed 3) and now considering 450/453 (removed 3) transitions.
// Phase 1: matrix 450 rows 463 cols
[2023-03-11 03:06:28] [INFO ] Computed 89 place invariants in 52 ms
[2023-03-11 03:06:31] [INFO ] Implicit Places using invariants in 2503 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 413, 441]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 2505 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 435/476 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 435 transition count 435
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 30 place count 420 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 420 transition count 435
Applied a total of 31 rules in 42 ms. Remains 420 /435 variables (removed 15) and now considering 435/450 (removed 15) transitions.
// Phase 1: matrix 435 rows 420 cols
[2023-03-11 03:06:31] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 03:06:31] [INFO ] Implicit Places using invariants in 573 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-11 03:06:31] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-11 03:06:32] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:06:45] [INFO ] Implicit Places using invariants and state equation in 13515 ms returned []
Implicit Place search using SMT with State Equation took 14089 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 420/476 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 47694 ms. Remains : 420/476 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1415 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 213825 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213825 steps, saw 106934 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 435 rows 420 cols
[2023-03-11 03:06:48] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-11 03:06:49] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:06:50] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:06:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:06:50] [INFO ] After 355ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:06:50] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-11 03:06:50] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 490 ms.
Support contains 3 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 420/420 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 420 cols
[2023-03-11 03:06:51] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 03:06:51] [INFO ] Implicit Places using invariants in 538 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-11 03:06:51] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-11 03:06:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:07:22] [INFO ] Performed 372/420 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:07:24] [INFO ] Implicit Places using invariants and state equation in 32570 ms returned []
Implicit Place search using SMT with State Equation took 33110 ms to find 0 implicit places.
[2023-03-11 03:07:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-11 03:07:24] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-11 03:07:24] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33556 ms. Remains : 420/420 places, 435/435 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 556 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 9 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-11 03:07:25] [INFO ] Computed 99 place invariants in 63 ms
[2023-03-11 03:07:26] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-03-11 03:07:26] [INFO ] Invariant cache hit.
[2023-03-11 03:07:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:07:56] [INFO ] Performed 281/556 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:07:59] [INFO ] Implicit Places using invariants and state equation in 33843 ms returned []
Implicit Place search using SMT with State Equation took 34500 ms to find 0 implicit places.
[2023-03-11 03:07:59] [INFO ] Invariant cache hit.
[2023-03-11 03:08:00] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35076 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280483 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280483 steps, saw 140293 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:08:03] [INFO ] Invariant cache hit.
[2023-03-11 03:08:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 03:08:03] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 62 ms returned sat
[2023-03-11 03:08:04] [INFO ] After 899ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:08:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:08:06] [INFO ] After 1134ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:08:06] [INFO ] After 2209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:08:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 03:08:06] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 60 ms returned sat
[2023-03-11 03:08:07] [INFO ] After 892ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:08:07] [INFO ] After 147ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:08:07] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-11 03:08:07] [INFO ] After 1304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 52 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 475/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 318763 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 318763 steps, saw 159473 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-11 03:08:10] [INFO ] Computed 99 place invariants in 45 ms
[2023-03-11 03:08:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 03:08:10] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 51 ms returned sat
[2023-03-11 03:08:11] [INFO ] After 338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:08:11] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:08:11] [INFO ] After 226ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:08:11] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:08:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 03:08:11] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 50 ms returned sat
[2023-03-11 03:08:11] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:08:11] [INFO ] After 218ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:08:12] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 03:08:12] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 96 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-11 03:08:12] [INFO ] Invariant cache hit.
[2023-03-11 03:08:15] [INFO ] Implicit Places using invariants in 2873 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 2877 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 28 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:08:15] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 03:08:15] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:08:15] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-11 03:08:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:08:46] [INFO ] Performed 364/419 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:08:51] [INFO ] Implicit Places using invariants and state equation in 35431 ms returned []
Implicit Place search using SMT with State Equation took 36010 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38928 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 326617 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326617 steps, saw 163337 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:08:54] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 03:08:55] [INFO ] After 745ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:08:55] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:08:55] [INFO ] After 184ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:08:55] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:08:55] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:08:57] [INFO ] After 1089ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:08:57] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 03:08:57] [INFO ] After 1943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 78 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:08:57] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-11 03:08:57] [INFO ] Implicit Places using invariants in 586 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:08:57] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-11 03:08:58] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-11 03:09:28] [INFO ] Performed 404/419 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:09:29] [INFO ] Implicit Places using invariants and state equation in 31525 ms returned []
Implicit Place search using SMT with State Equation took 32112 ms to find 0 implicit places.
[2023-03-11 03:09:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-11 03:09:29] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-11 03:09:29] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32527 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 36 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-11 03:09:29] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-11 03:09:30] [INFO ] After 367ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:09:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 03:09:30] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-11 03:09:30] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2023-03-11 03:09:30] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2023-03-11 03:09:30] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 0 ms to minimize.
[2023-03-11 03:09:30] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2023-03-11 03:09:31] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:09:31] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
[2023-03-11 03:09:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 974 ms
[2023-03-11 03:09:31] [INFO ] After 1010ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:09:31] [INFO ] After 1453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:09:31] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:09:31] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:09:31] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2023-03-11 03:09:32] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2023-03-11 03:09:32] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 0 ms to minimize.
[2023-03-11 03:09:32] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 0 ms to minimize.
[2023-03-11 03:09:32] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
[2023-03-11 03:09:32] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2023-03-11 03:09:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 950 ms
[2023-03-11 03:09:32] [INFO ] After 986ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 03:09:32] [INFO ] After 1443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13842 reset in 147 ms.
Product exploration explored 100000 steps with 13976 reset in 163 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 533
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 556 transition count 537
Deduced a syphon composed of 3 places in 2 ms
Applied a total of 3 rules in 24 ms. Remains 556 /556 variables (removed 0) and now considering 537/533 (removed -4) transitions.
[2023-03-11 03:09:33] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 537 rows 556 cols
[2023-03-11 03:09:33] [INFO ] Computed 99 place invariants in 62 ms
[2023-03-11 03:09:34] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/556 places, 537/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 587 ms. Remains : 556/556 places, 537/533 transitions.
Built C files in :
/tmp/ltsmin8164192981003106220
[2023-03-11 03:09:34] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8164192981003106220
Running compilation step : cd /tmp/ltsmin8164192981003106220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1426 ms.
Running link step : cd /tmp/ltsmin8164192981003106220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8164192981003106220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3036703029483296248.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 13 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-11 03:09:49] [INFO ] Computed 99 place invariants in 61 ms
[2023-03-11 03:09:49] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-11 03:09:49] [INFO ] Invariant cache hit.
[2023-03-11 03:09:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:10:06] [INFO ] Implicit Places using invariants and state equation in 16063 ms returned []
Implicit Place search using SMT with State Equation took 16733 ms to find 0 implicit places.
[2023-03-11 03:10:06] [INFO ] Invariant cache hit.
[2023-03-11 03:10:06] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17283 ms. Remains : 556/556 places, 533/533 transitions.
Built C files in :
/tmp/ltsmin11477851643915082625
[2023-03-11 03:10:06] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11477851643915082625
Running compilation step : cd /tmp/ltsmin11477851643915082625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1473 ms.
Running link step : cd /tmp/ltsmin11477851643915082625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11477851643915082625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9889209844417760980.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 03:10:21] [INFO ] Flatten gal took : 18 ms
[2023-03-11 03:10:21] [INFO ] Flatten gal took : 23 ms
[2023-03-11 03:10:21] [INFO ] Time to serialize gal into /tmp/LTL16075575428985365389.gal : 6 ms
[2023-03-11 03:10:21] [INFO ] Time to serialize properties into /tmp/LTL8866720409559660082.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16075575428985365389.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10665531975409585993.hoa' '-atoms' '/tmp/LTL8866720409559660082.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8866720409559660082.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10665531975409585993.hoa
Detected timeout of ITS tools.
[2023-03-11 03:10:36] [INFO ] Flatten gal took : 18 ms
[2023-03-11 03:10:36] [INFO ] Flatten gal took : 18 ms
[2023-03-11 03:10:36] [INFO ] Time to serialize gal into /tmp/LTL7545876991581667524.gal : 4 ms
[2023-03-11 03:10:36] [INFO ] Time to serialize properties into /tmp/LTL12816884681387826574.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7545876991581667524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12816884681387826574.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p509>=1)")U("((p877>=1)||(p579<1))")))))
Formula 0 simplified : XF(!"(p509>=1)" R !"((p877>=1)||(p579<1))")
Detected timeout of ITS tools.
[2023-03-11 03:10:51] [INFO ] Flatten gal took : 18 ms
[2023-03-11 03:10:51] [INFO ] Applying decomposition
[2023-03-11 03:10:51] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16554216157910899537.txt' '-o' '/tmp/graph16554216157910899537.bin' '-w' '/tmp/graph16554216157910899537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16554216157910899537.bin' '-l' '-1' '-v' '-w' '/tmp/graph16554216157910899537.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:10:51] [INFO ] Decomposing Gal with order
[2023-03-11 03:10:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:10:52] [INFO ] Removed a total of 386 redundant transitions.
[2023-03-11 03:10:52] [INFO ] Flatten gal took : 41 ms
[2023-03-11 03:10:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 11 ms.
[2023-03-11 03:10:52] [INFO ] Time to serialize gal into /tmp/LTL9286094106801825490.gal : 9 ms
[2023-03-11 03:10:52] [INFO ] Time to serialize properties into /tmp/LTL7033756909047126419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9286094106801825490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7033756909047126419.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i4.i0.u103.p509>=1)")U("((i8.u172.p877>=1)||(i4.i1.u115.p579<1))")))))
Formula 0 simplified : XF(!"(i4.i0.u103.p509>=1)" R !"((i8.u172.p877>=1)||(i4.i1.u115.p579<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7503336878244379969
[2023-03-11 03:11:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7503336878244379969
Running compilation step : cd /tmp/ltsmin7503336878244379969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1420 ms.
Running link step : cd /tmp/ltsmin7503336878244379969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7503336878244379969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 363623 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(G(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(G((p0&&(p1||F(p2))))))'
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(p0) U p1)||!p0) U X(p2))))'
Found a Shortening insensitive property : DoubleExponent-PT-020-LTLFireability-08
Stuttering acceptance computed with spot in 359 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 474 place count 822 transition count 721
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 552 place count 783 transition count 721
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 4 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 916 place count 601 transition count 539
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 990 place count 564 transition count 539
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 991 place count 564 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 992 place count 563 transition count 538
Applied a total of 992 rules in 109 ms. Remains 563 /1060 variables (removed 497) and now considering 538/998 (removed 460) transitions.
// Phase 1: matrix 538 rows 563 cols
[2023-03-11 03:11:23] [INFO ] Computed 101 place invariants in 65 ms
[2023-03-11 03:11:23] [INFO ] Implicit Places using invariants in 724 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 725 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 561/1060 places, 538/998 transitions.
Graph (complete) has 1745 edges and 561 vertex of which 560 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 557 transition count 534
Applied a total of 7 rules in 24 ms. Remains 557 /561 variables (removed 4) and now considering 534/538 (removed 4) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:11:23] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 03:11:24] [INFO ] Implicit Places using invariants in 594 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:11:24] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 03:11:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:11:51] [INFO ] Implicit Places using invariants and state equation in 27130 ms returned []
Implicit Place search using SMT with State Equation took 27725 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 557/1060 places, 534/998 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 28584 ms. Remains : 557/1060 places, 534/998 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s116 1) (GEQ s123 1)), p1:(GEQ s453 1), p2:(GEQ s352 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33974 reset in 465 ms.
Product exploration explored 100000 steps with 34001 reset in 385 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1695 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 99126 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99126 steps, saw 49569 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:11:58] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 03:11:59] [INFO ] After 948ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2023-03-11 03:11:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:12:00] [INFO ] After 870ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :2 sat :2 real:15
[2023-03-11 03:12:01] [INFO ] After 1492ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-11 03:12:01] [INFO ] After 2834ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-11 03:12:05] [INFO ] After 3507ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-11 03:12:10] [INFO ] After 5519ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :6 sat :13
[2023-03-11 03:12:10] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2023-03-11 03:12:11] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2023-03-11 03:12:11] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2023-03-11 03:12:11] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 0 ms to minimize.
[2023-03-11 03:12:11] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 0 ms to minimize.
[2023-03-11 03:12:11] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 0 ms to minimize.
[2023-03-11 03:12:11] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 0 ms to minimize.
[2023-03-11 03:12:12] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 1 ms to minimize.
[2023-03-11 03:12:12] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:12:12] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2023-03-11 03:12:13] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2023-03-11 03:12:13] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 0 ms to minimize.
[2023-03-11 03:12:13] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:12:14] [INFO ] Deduced a trap composed of 43 places in 134 ms of which 1 ms to minimize.
[2023-03-11 03:12:14] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 0 ms to minimize.
[2023-03-11 03:12:15] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 1 ms to minimize.
[2023-03-11 03:12:15] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 1 ms to minimize.
[2023-03-11 03:12:15] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2023-03-11 03:12:15] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2023-03-11 03:12:16] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2023-03-11 03:12:16] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2023-03-11 03:12:16] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 0 ms to minimize.
[2023-03-11 03:12:16] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 0 ms to minimize.
[2023-03-11 03:12:17] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2023-03-11 03:12:17] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 1 ms to minimize.
[2023-03-11 03:12:17] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 1 ms to minimize.
[2023-03-11 03:12:17] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 1 ms to minimize.
[2023-03-11 03:12:17] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7260 ms
[2023-03-11 03:12:21] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 0 ms to minimize.
[2023-03-11 03:12:21] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 0 ms to minimize.
[2023-03-11 03:12:22] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 0 ms to minimize.
[2023-03-11 03:12:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2023-03-11 03:12:22] [INFO ] After 17738ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :13
Attempting to minimize the solution found.
Minimization took 2680 ms.
[2023-03-11 03:12:25] [INFO ] After 24361ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :13
Fused 19 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 20000 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 40 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 213386 steps, run timeout after 6001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 213386 steps, saw 106755 distinct states, run finished after 6001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 03:12:54] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-11 03:12:55] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 03:12:57] [INFO ] After 2294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 03:12:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 03:13:01] [INFO ] After 4184ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-11 03:13:02] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-03-11 03:13:02] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2023-03-11 03:13:02] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 0 ms to minimize.
[2023-03-11 03:13:03] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2023-03-11 03:13:03] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2023-03-11 03:13:03] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2023-03-11 03:13:03] [INFO ] Deduced a trap composed of 84 places in 203 ms of which 1 ms to minimize.
[2023-03-11 03:13:04] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 0 ms to minimize.
[2023-03-11 03:13:04] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 0 ms to minimize.
[2023-03-11 03:13:04] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 0 ms to minimize.
[2023-03-11 03:13:04] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 1 ms to minimize.
[2023-03-11 03:13:05] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 0 ms to minimize.
[2023-03-11 03:13:05] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 0 ms to minimize.
[2023-03-11 03:13:05] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 0 ms to minimize.
[2023-03-11 03:13:06] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 1 ms to minimize.
[2023-03-11 03:13:06] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2023-03-11 03:13:06] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 1 ms to minimize.
[2023-03-11 03:13:06] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 0 ms to minimize.
[2023-03-11 03:13:07] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 1 ms to minimize.
[2023-03-11 03:13:07] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5120 ms
[2023-03-11 03:13:08] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2023-03-11 03:13:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 1 ms to minimize.
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 1 ms to minimize.
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 0 ms to minimize.
[2023-03-11 03:13:09] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2023-03-11 03:13:10] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 0 ms to minimize.
[2023-03-11 03:13:10] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 0 ms to minimize.
[2023-03-11 03:13:10] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 0 ms to minimize.
[2023-03-11 03:13:10] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 0 ms to minimize.
[2023-03-11 03:13:11] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 0 ms to minimize.
[2023-03-11 03:13:11] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 0 ms to minimize.
[2023-03-11 03:13:11] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2023-03-11 03:13:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2393 ms
[2023-03-11 03:13:12] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2023-03-11 03:13:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-11 03:13:15] [INFO ] After 18195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 2786 ms.
[2023-03-11 03:13:18] [INFO ] After 23593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 16003 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 14 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 03:13:34] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-11 03:13:35] [INFO ] Implicit Places using invariants in 712 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 03:13:35] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-11 03:13:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 03:13:59] [INFO ] Implicit Places using invariants and state equation in 24411 ms returned [42, 48, 214, 310, 336, 362, 368, 389, 392, 396, 416, 444, 449, 453, 470, 476]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 25125 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 462/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 462 transition count 449
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 449
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 456 transition count 449
Applied a total of 16 rules in 31 ms. Remains 456 /462 variables (removed 6) and now considering 449/455 (removed 6) transitions.
// Phase 1: matrix 449 rows 456 cols
[2023-03-11 03:14:00] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-11 03:14:00] [INFO ] Implicit Places using invariants in 684 ms returned []
// Phase 1: matrix 449 rows 456 cols
[2023-03-11 03:14:00] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-11 03:14:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 03:14:31] [INFO ] Performed 415/456 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:14:33] [INFO ] Implicit Places using invariants and state equation in 33175 ms returned []
Implicit Place search using SMT with State Equation took 33860 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 456/478 places, 449/455 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59027 ms. Remains : 456/478 places, 449/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2094 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 8 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:14:36] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-11 03:14:37] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:14:37] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-11 03:14:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:15:07] [INFO ] Performed 209/557 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:15:37] [INFO ] Performed 410/557 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-11 03:16:04] [INFO ] Implicit Places using invariants and state equation in 87186 ms returned []
Implicit Place search using SMT with State Equation took 87719 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:16:04] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-11 03:16:04] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88103 ms. Remains : 557/557 places, 534/534 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 2537 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 419 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 807 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 798 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 125038 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125038 steps, saw 62538 distinct states, run finished after 3006 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:16:12] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-11 03:16:12] [INFO ] After 346ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-11 03:16:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:16:13] [INFO ] After 101ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1 real:8
[2023-03-11 03:16:13] [INFO ] After 168ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 03:16:13] [INFO ] After 782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:8
[2023-03-11 03:16:18] [INFO ] After 5143ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 03:16:29] [INFO ] After 11089ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-11 03:16:32] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 0 ms to minimize.
[2023-03-11 03:16:32] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 0 ms to minimize.
[2023-03-11 03:16:32] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2023-03-11 03:16:32] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 1 ms to minimize.
[2023-03-11 03:16:32] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 0 ms to minimize.
[2023-03-11 03:16:33] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:16:33] [INFO ] Deduced a trap composed of 57 places in 145 ms of which 0 ms to minimize.
[2023-03-11 03:16:33] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 1 ms to minimize.
[2023-03-11 03:16:34] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 0 ms to minimize.
[2023-03-11 03:16:34] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 0 ms to minimize.
[2023-03-11 03:16:34] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 0 ms to minimize.
[2023-03-11 03:16:35] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 0 ms to minimize.
[2023-03-11 03:16:35] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 0 ms to minimize.
[2023-03-11 03:16:35] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 1 ms to minimize.
[2023-03-11 03:16:36] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 0 ms to minimize.
[2023-03-11 03:16:36] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 1 ms to minimize.
[2023-03-11 03:16:36] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2023-03-11 03:16:36] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:16:36] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 1 ms to minimize.
[2023-03-11 03:16:36] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2023-03-11 03:16:37] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2023-03-11 03:16:37] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-11 03:16:37] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2023-03-11 03:16:37] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-11 03:16:37] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 1 ms to minimize.
[2023-03-11 03:16:37] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-03-11 03:16:38] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:16:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:16:38] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 12088 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 37 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1228 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 116318 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116318 steps, saw 58211 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 03:16:55] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-11 03:16:55] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:16:56] [INFO ] After 1389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 03:16:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 03:16:58] [INFO ] After 1795ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 03:16:58] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 0 ms to minimize.
[2023-03-11 03:16:58] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2023-03-11 03:16:59] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2023-03-11 03:16:59] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 0 ms to minimize.
[2023-03-11 03:16:59] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-11 03:16:59] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2023-03-11 03:16:59] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:17:00] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2023-03-11 03:17:00] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 0 ms to minimize.
[2023-03-11 03:17:00] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2023-03-11 03:17:00] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 0 ms to minimize.
[2023-03-11 03:17:00] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 1 ms to minimize.
[2023-03-11 03:17:01] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 0 ms to minimize.
[2023-03-11 03:17:01] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 1 ms to minimize.
[2023-03-11 03:17:01] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2023-03-11 03:17:01] [INFO ] Deduced a trap composed of 20 places in 244 ms of which 1 ms to minimize.
[2023-03-11 03:17:02] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-11 03:17:02] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2023-03-11 03:17:02] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 0 ms to minimize.
[2023-03-11 03:17:03] [INFO ] Deduced a trap composed of 105 places in 334 ms of which 1 ms to minimize.
[2023-03-11 03:17:03] [INFO ] Deduced a trap composed of 86 places in 339 ms of which 1 ms to minimize.
[2023-03-11 03:17:04] [INFO ] Deduced a trap composed of 80 places in 420 ms of which 0 ms to minimize.
[2023-03-11 03:17:04] [INFO ] Deduced a trap composed of 11 places in 432 ms of which 1 ms to minimize.
[2023-03-11 03:17:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6113 ms
[2023-03-11 03:17:06] [INFO ] After 10060ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 979 ms.
[2023-03-11 03:17:07] [INFO ] After 12649ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8001 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 03:17:15] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-11 03:17:16] [INFO ] Implicit Places using invariants in 682 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-11 03:17:16] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-11 03:17:16] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 03:17:47] [INFO ] Performed 381/478 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:17:51] [INFO ] Implicit Places using invariants and state equation in 34837 ms returned [444, 449, 470, 476]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 35521 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 474/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 474 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 472 transition count 453
Applied a total of 4 rules in 30 ms. Remains 472 /474 variables (removed 2) and now considering 453/455 (removed 2) transitions.
// Phase 1: matrix 453 rows 472 cols
[2023-03-11 03:17:51] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 03:17:52] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 453 rows 472 cols
[2023-03-11 03:17:52] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-11 03:17:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-11 03:17:57] [INFO ] Implicit Places using invariants and state equation in 5465 ms returned []
Implicit Place search using SMT with State Equation took 6183 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 472/478 places, 453/455 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41744 ms. Remains : 472/478 places, 453/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 2991 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 449 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 429 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 451 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 34221 reset in 594 ms.
Product exploration explored 100000 steps with 34137 reset in 479 ms.
Built C files in :
/tmp/ltsmin6013022504602756128
[2023-03-11 03:18:03] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6013022504602756128
Running compilation step : cd /tmp/ltsmin6013022504602756128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1395 ms.
Running link step : cd /tmp/ltsmin6013022504602756128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6013022504602756128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13055750278516187457.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 8 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:18:18] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-11 03:18:18] [INFO ] Implicit Places using invariants in 452 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:18:18] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-11 03:18:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-11 03:18:49] [INFO ] Performed 286/557 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-11 03:19:16] [INFO ] Implicit Places using invariants and state equation in 57367 ms returned []
Implicit Place search using SMT with State Equation took 57824 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-11 03:19:16] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-11 03:19:16] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58202 ms. Remains : 557/557 places, 534/534 transitions.
Built C files in :
/tmp/ltsmin15927604382743432625
[2023-03-11 03:19:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15927604382743432625
Running compilation step : cd /tmp/ltsmin15927604382743432625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1316 ms.
Running link step : cd /tmp/ltsmin15927604382743432625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15927604382743432625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1980373673932962542.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-11 03:19:31] [INFO ] Flatten gal took : 17 ms
[2023-03-11 03:19:31] [INFO ] Flatten gal took : 17 ms
[2023-03-11 03:19:31] [INFO ] Time to serialize gal into /tmp/LTL728249837673258152.gal : 4 ms
[2023-03-11 03:19:31] [INFO ] Time to serialize properties into /tmp/LTL9360667928466093582.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL728249837673258152.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16859959550112127033.hoa' '-atoms' '/tmp/LTL9360667928466093582.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9360667928466093582.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16859959550112127033.hoa
Detected timeout of ITS tools.
[2023-03-11 03:19:46] [INFO ] Flatten gal took : 16 ms
[2023-03-11 03:19:46] [INFO ] Flatten gal took : 16 ms
[2023-03-11 03:19:46] [INFO ] Time to serialize gal into /tmp/LTL9337877843141897143.gal : 3 ms
[2023-03-11 03:19:46] [INFO ] Time to serialize properties into /tmp/LTL8827994759280357560.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9337877843141897143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8827994759280357560.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((p254>=1)&&(p266>=1))"))U("(p827>=1)"))||(!("((p254>=1)&&(p266>=1))")))U(X("(p648>=1)"))))))
Formula 0 simplified : G((!"((p254>=1)&&(p266>=1))" | (F"((p254>=1)&&(p266>=1))" U "(p827>=1)")) U X"(p648>=1)")
Detected timeout of ITS tools.
[2023-03-11 03:20:01] [INFO ] Flatten gal took : 17 ms
[2023-03-11 03:20:01] [INFO ] Applying decomposition
[2023-03-11 03:20:01] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12342866213982264869.txt' '-o' '/tmp/graph12342866213982264869.bin' '-w' '/tmp/graph12342866213982264869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12342866213982264869.bin' '-l' '-1' '-v' '-w' '/tmp/graph12342866213982264869.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:20:01] [INFO ] Decomposing Gal with order
[2023-03-11 03:20:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:20:01] [INFO ] Removed a total of 386 redundant transitions.
[2023-03-11 03:20:01] [INFO ] Flatten gal took : 36 ms
[2023-03-11 03:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 11 ms.
[2023-03-11 03:20:02] [INFO ] Time to serialize gal into /tmp/LTL9981649414059396674.gal : 8 ms
[2023-03-11 03:20:02] [INFO ] Time to serialize properties into /tmp/LTL3982185288217480525.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9981649414059396674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3982185288217480525.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(!((((F("((i3.i0.u48.p254>=1)&&(i3.i0.u48.p266>=1))"))U("(i8.i1.u165.p827>=1)"))||(!("((i3.i0.u48.p254>=1)&&(i3.i0.u48.p266>=1))")...189
Formula 0 simplified : G((!"((i3.i0.u48.p254>=1)&&(i3.i0.u48.p266>=1))" | (F"((i3.i0.u48.p254>=1)&&(i3.i0.u48.p266>=1))" U "(i8.i1.u165.p827>=1)")) U X"(i6...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13424929120327094965
[2023-03-11 03:20:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13424929120327094965
Running compilation step : cd /tmp/ltsmin13424929120327094965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1514 ms.
Running link step : cd /tmp/ltsmin13424929120327094965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13424929120327094965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(!(((<>((LTLAPp0==true)) U (LTLAPp1==true))||!(LTLAPp0==true)) U X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 549699 ms.
[2023-03-11 03:20:32] [INFO ] Flatten gal took : 28 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15015084142902722844
[2023-03-11 03:20:32] [INFO ] Computing symmetric may disable matrix : 998 transitions.
[2023-03-11 03:20:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 03:20:32] [INFO ] Computing symmetric may enable matrix : 998 transitions.
[2023-03-11 03:20:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 03:20:32] [INFO ] Applying decomposition
[2023-03-11 03:20:32] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2418899646102833480.txt' '-o' '/tmp/graph2418899646102833480.bin' '-w' '/tmp/graph2418899646102833480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2418899646102833480.bin' '-l' '-1' '-v' '-w' '/tmp/graph2418899646102833480.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:20:32] [INFO ] Decomposing Gal with order
[2023-03-11 03:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:20:32] [INFO ] Computing Do-Not-Accords matrix : 998 transitions.
[2023-03-11 03:20:32] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 03:20:32] [INFO ] Built C files in 222ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15015084142902722844
Running compilation step : cd /tmp/ltsmin15015084142902722844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 03:20:32] [INFO ] Removed a total of 278 redundant transitions.
[2023-03-11 03:20:32] [INFO ] Flatten gal took : 66 ms
[2023-03-11 03:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 15 ms.
[2023-03-11 03:20:32] [INFO ] Time to serialize gal into /tmp/LTLFireability8589698441135707561.gal : 19 ms
[2023-03-11 03:20:32] [INFO ] Time to serialize properties into /tmp/LTLFireability12752037192705787105.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8589698441135707561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12752037192705787105.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((X(G(("(i5.i2.i1.u217.p509>=1)")U("((i12.i2.i2.u387.p877>=1)||(i5.i1.i1.u231.p579<1))")))))
Formula 0 simplified : XF(!"(i5.i2.i1.u217.p509>=1)" R !"((i12.i2.i2.u387.p877>=1)||(i5.i1.i1.u231.p579<1))")
Compilation finished in 4658 ms.
Running link step : cd /tmp/ltsmin15015084142902722844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin15015084142902722844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12522468 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16017340 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, 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 r133-smll-167819411100484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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