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.r231-tall-167856416700883.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S24C12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416700883
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 9.6K Feb 26 03:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 03:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M 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 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679507628120

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 17:53:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:53:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:53:50] [INFO ] Load time of PNML (sax parser for PT used): 578 ms
[2023-03-22 17:53:50] [INFO ] Transformed 20612 places.
[2023-03-22 17:53:50] [INFO ] Transformed 29875 transitions.
[2023-03-22 17:53:50] [INFO ] Parsed PT model containing 20612 places and 29875 transitions and 109334 arcs in 753 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 20612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20612/20612 places, 29875/29875 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 20560 transition count 29875
Applied a total of 52 rules in 843 ms. Remains 20560 /20612 variables (removed 52) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 17:53:51] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-22 17:53:54] [INFO ] Computed 1301 place invariants in 2871 ms
[2023-03-22 17:53:56] [INFO ] Implicit Places using invariants in 4829 ms returned []
Implicit Place search using SMT only with invariants took 4899 ms to find 0 implicit places.
[2023-03-22 17:53:56] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:53:56] [INFO ] Invariant cache hit.
[2023-03-22 17:53:58] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 20560/20612 places, 29875/29875 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7631 ms. Remains : 20560/20612 places, 29875/29875 transitions.
Support contains 40 out of 20560 places after structural reductions.
[2023-03-22 17:53:59] [INFO ] Flatten gal took : 1133 ms
[2023-03-22 17:54:00] [INFO ] Flatten gal took : 852 ms
[2023-03-22 17:54:02] [INFO ] Input system was already deterministic with 29875 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 808 ms. (steps per millisecond=12 ) properties (out of 25) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-22 17:54:03] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:54:03] [INFO ] Invariant cache hit.
[2023-03-22 17:54:11] [INFO ] [Real]Absence check using 47 positive place invariants in 256 ms returned sat
[2023-03-22 17:54:12] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 820 ms returned sat
[2023-03-22 17:54:28] [INFO ] After 15831ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:19
[2023-03-22 17:54:29] [INFO ] State equation strengthened by 9202 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-22 17:54:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:54:29] [INFO ] After 25176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7177 transitions
Trivial Post-agglo rules discarded 7177 transitions
Performed 7177 trivial Post agglomeration. Transition count delta: 7177
Iterating post reduction 0 with 7177 rules applied. Total rules applied 7177 place count 20560 transition count 22698
Reduce places removed 7177 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 7188 rules applied. Total rules applied 14365 place count 13383 transition count 22687
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 14376 place count 13372 transition count 22687
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14376 place count 13372 transition count 22088
Deduced a syphon composed of 599 places in 30 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15574 place count 12773 transition count 22088
Discarding 6577 places :
Symmetric choice reduction at 3 with 6577 rule applications. Total rules 22151 place count 6196 transition count 15511
Iterating global reduction 3 with 6577 rules applied. Total rules applied 28728 place count 6196 transition count 15511
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 28728 place count 6196 transition count 15499
Deduced a syphon composed of 12 places in 11 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 28752 place count 6184 transition count 15499
Discarding 527 places :
Symmetric choice reduction at 3 with 527 rule applications. Total rules 29279 place count 5657 transition count 9175
Iterating global reduction 3 with 527 rules applied. Total rules applied 29806 place count 5657 transition count 9175
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29856 place count 5632 transition count 9150
Free-agglomeration rule (complex) applied 355 times.
Iterating global reduction 3 with 355 rules applied. Total rules applied 30211 place count 5632 transition count 14119
Reduce places removed 355 places and 0 transitions.
Iterating post reduction 3 with 355 rules applied. Total rules applied 30566 place count 5277 transition count 14119
Partial Free-agglomeration rule applied 300 times.
Drop transitions removed 300 transitions
Iterating global reduction 4 with 300 rules applied. Total rules applied 30866 place count 5277 transition count 14119
Applied a total of 30866 rules in 6367 ms. Remains 5277 /20560 variables (removed 15283) and now considering 14119/29875 (removed 15756) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6370 ms. Remains : 5277/20560 places, 14119/29875 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 857 ms. (steps per millisecond=11 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-22 17:54:36] [INFO ] Flow matrix only has 13233 transitions (discarded 886 similar events)
// Phase 1: matrix 13233 rows 5277 cols
[2023-03-22 17:54:36] [INFO ] Computed 1301 place invariants in 413 ms
[2023-03-22 17:54:38] [INFO ] After 1712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-22 17:54:40] [INFO ] [Nat]Absence check using 49 positive place invariants in 97 ms returned sat
[2023-03-22 17:54:40] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 357 ms returned sat
[2023-03-22 17:54:57] [INFO ] After 15683ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :14
[2023-03-22 17:54:57] [INFO ] State equation strengthened by 8729 read => feed constraints.
[2023-03-22 17:55:03] [INFO ] After 6078ms SMT Verify possible using 8729 Read/Feed constraints in natural domain returned unsat :5 sat :12
[2023-03-22 17:55:03] [INFO ] After 6080ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :12
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 17:55:03] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :12
Fused 18 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 22 out of 5277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5277/5277 places, 14119/14119 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 5277 transition count 14114
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 5272 transition count 14114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 5272 transition count 14113
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 5271 transition count 14113
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 5271 transition count 14110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 5268 transition count 14110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 21 place count 5265 transition count 14107
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 5265 transition count 14107
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 5265 transition count 14107
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 5259 transition count 14101
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 5259 transition count 14101
Applied a total of 42 rules in 3481 ms. Remains 5259 /5277 variables (removed 18) and now considering 14101/14119 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3483 ms. Remains : 5259/5277 places, 14101/14119 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 876 ms. (steps per millisecond=11 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 35040 steps, run timeout after 6001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 35040 steps, saw 16046 distinct states, run finished after 6004 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-22 17:55:16] [INFO ] Flow matrix only has 13215 transitions (discarded 886 similar events)
// Phase 1: matrix 13215 rows 5259 cols
[2023-03-22 17:55:16] [INFO ] Computed 1301 place invariants in 462 ms
[2023-03-22 17:55:18] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 17:55:18] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 365 ms returned sat
[2023-03-22 17:55:26] [INFO ] After 8246ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-22 17:55:26] [INFO ] State equation strengthened by 8729 read => feed constraints.
[2023-03-22 17:55:28] [INFO ] After 1709ms SMT Verify possible using 8729 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:55:28] [INFO ] After 11851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:55:29] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-22 17:55:30] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 344 ms returned sat
[2023-03-22 17:55:49] [INFO ] After 17906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 17:55:53] [INFO ] After 4559ms SMT Verify possible using 8729 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 17:55:53] [INFO ] After 4561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 17:55:53] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 205 ms.
Support contains 20 out of 5259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5259/5259 places, 14101/14101 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 2 rules applied. Total rules applied 2 place count 5259 transition count 14099
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5257 transition count 14099
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 5257 transition count 14098
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 5256 transition count 14098
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 5255 transition count 14097
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 5255 transition count 14097
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 5255 transition count 14097
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 5254 transition count 14096
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 5254 transition count 14096
Applied a total of 11 rules in 3235 ms. Remains 5254 /5259 variables (removed 5) and now considering 14096/14101 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3235 ms. Remains : 5254/5259 places, 14096/14101 transitions.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17936 stabilizing places and 24674 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(X(p1)))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 683 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 17:55:58] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-22 17:56:00] [INFO ] Computed 1301 place invariants in 2591 ms
[2023-03-22 17:56:02] [INFO ] Implicit Places using invariants in 4207 ms returned []
Implicit Place search using SMT only with invariants took 4229 ms to find 0 implicit places.
[2023-03-22 17:56:02] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:56:02] [INFO ] Invariant cache hit.
[2023-03-22 17:56:04] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6728 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LEQ 1 s15967) (LEQ s588 s20249)), p1:(LEQ 1 s5835)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 12 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-00 finished in 7220 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)||G((p1||X(!p1))))))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7198 transitions
Trivial Post-agglo rules discarded 7198 transitions
Performed 7198 trivial Post agglomeration. Transition count delta: 7198
Iterating post reduction 0 with 7198 rules applied. Total rules applied 7198 place count 20560 transition count 22677
Reduce places removed 7198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14397 place count 13362 transition count 22676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 599 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22077
Deduced a syphon composed of 599 places in 23 ms
Reduce places removed 599 places and 0 transitions.
Iterating global reduction 3 with 1198 rules applied. Total rules applied 15596 place count 12762 transition count 22077
Discarding 6598 places :
Symmetric choice reduction at 3 with 6598 rule applications. Total rules 22194 place count 6164 transition count 15479
Iterating global reduction 3 with 6598 rules applied. Total rules applied 28792 place count 6164 transition count 15479
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 28792 place count 6164 transition count 15457
Deduced a syphon composed of 22 places in 15 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 28836 place count 6142 transition count 15457
Discarding 548 places :
Symmetric choice reduction at 3 with 548 rule applications. Total rules 29384 place count 5594 transition count 8881
Iterating global reduction 3 with 548 rules applied. Total rules applied 29932 place count 5594 transition count 8881
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29982 place count 5569 transition count 8856
Applied a total of 29982 rules in 4235 ms. Remains 5569 /20560 variables (removed 14991) and now considering 8856/29875 (removed 21019) transitions.
[2023-03-22 17:56:08] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
// Phase 1: matrix 8256 rows 5569 cols
[2023-03-22 17:56:09] [INFO ] Computed 1301 place invariants in 230 ms
[2023-03-22 17:56:13] [INFO ] Implicit Places using invariants in 4865 ms returned []
[2023-03-22 17:56:13] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2023-03-22 17:56:13] [INFO ] Invariant cache hit.
[2023-03-22 17:56:18] [INFO ] Implicit Places using invariants and state equation in 4624 ms returned []
Implicit Place search using SMT with State Equation took 9491 ms to find 0 implicit places.
[2023-03-22 17:56:19] [INFO ] Redundant transitions in 1375 ms returned []
[2023-03-22 17:56:19] [INFO ] Flow matrix only has 8256 transitions (discarded 600 similar events)
[2023-03-22 17:56:19] [INFO ] Invariant cache hit.
[2023-03-22 17:56:25] [INFO ] Dead Transitions using invariants and state equation in 5495 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5569/20560 places, 8856/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20609 ms. Remains : 5569/20560 places, 8856/29875 transitions.
Stuttering acceptance computed with spot in 83 ms :[false, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s2475 s561), p1:(GT s4933 s1107)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1150 reset in 1658 ms.
Product exploration explored 100000 steps with 1152 reset in 1531 ms.
Computed a total of 2970 stabilizing places and 3680 stable transitions
Computed a total of 2970 stabilizing places and 3680 stable transitions
Detected a total of 2970/5569 stabilizing places and 3680/8856 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 9 factoid took 329 ms. Reduced automaton from 2 states, 8 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-02 finished in 24304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 627 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 17:56:29] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-22 17:56:32] [INFO ] Computed 1301 place invariants in 2536 ms
[2023-03-22 17:56:33] [INFO ] Implicit Places using invariants in 4145 ms returned []
Implicit Place search using SMT only with invariants took 4156 ms to find 0 implicit places.
[2023-03-22 17:56:33] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:56:33] [INFO ] Invariant cache hit.
[2023-03-22 17:56:35] [INFO ] Dead Transitions using invariants and state equation in 1576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6368 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(GT s9936 s18835)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-05 finished in 6548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X((p1 U (!p2||G(p1)))))))))'
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 628 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 17:56:36] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:56:36] [INFO ] Invariant cache hit.
[2023-03-22 17:56:37] [INFO ] Implicit Places using invariants in 1577 ms returned []
Implicit Place search using SMT only with invariants took 1580 ms to find 0 implicit places.
[2023-03-22 17:56:37] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:56:37] [INFO ] Invariant cache hit.
[2023-03-22 17:56:39] [INFO ] Dead Transitions using invariants and state equation in 1663 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3877 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s2460), p0:(GT s2204 s12692), p2:(OR (LEQ 1 s2460) (LEQ s2204 s12692))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 811 reset in 1902 ms.
Product exploration explored 100000 steps with 813 reset in 1877 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1026 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 9432 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9432 steps, saw 4664 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 17:56:49] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:56:49] [INFO ] Invariant cache hit.
[2023-03-22 17:56:53] [INFO ] [Real]Absence check using 47 positive place invariants in 246 ms returned sat
[2023-03-22 17:56:54] [INFO ] [Real]Absence check using 47 positive and 1254 generalized place invariants in 823 ms returned sat
[2023-03-22 17:57:14] [INFO ] After 25013ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-22 17:57:18] [INFO ] [Nat]Absence check using 47 positive place invariants in 235 ms returned sat
[2023-03-22 17:57:18] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 783 ms returned sat
[2023-03-22 17:57:39] [INFO ] After 18730ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-22 17:57:39] [INFO ] State equation strengthened by 9202 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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:251)
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-22 17:57:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:57:39] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:6
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14399 place count 13361 transition count 22675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 18 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22199 place count 6161 transition count 15476
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28798 place count 6161 transition count 15476
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28798 place count 6161 transition count 15453
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28844 place count 6138 transition count 15453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 29393 place count 5589 transition count 8865
Iterating global reduction 3 with 549 rules applied. Total rules applied 29942 place count 5589 transition count 8865
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29992 place count 5564 transition count 8840
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 30329 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 30666 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 30691 place count 5227 transition count 14542
Applied a total of 30691 rules in 5628 ms. Remains 5227 /20560 variables (removed 15333) and now considering 14542/29875 (removed 15333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5629 ms. Remains : 5227/20560 places, 14542/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 885 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 19134 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19134 steps, saw 9049 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 17:57:49] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-22 17:57:49] [INFO ] Computed 1301 place invariants in 376 ms
[2023-03-22 17:57:50] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 17:57:51] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 352 ms returned sat
[2023-03-22 17:58:00] [INFO ] After 10718ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:58:01] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-22 17:58:01] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 324 ms returned sat
[2023-03-22 17:58:12] [INFO ] After 10556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:58:12] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-22 17:58:25] [INFO ] After 12791ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 17:58:25] [INFO ] After 12792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 17:58:25] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 900 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 900 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 892 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-22 17:58:27] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 17:58:27] [INFO ] Invariant cache hit.
[2023-03-22 17:58:32] [INFO ] Implicit Places using invariants in 4912 ms returned []
Implicit Place search using SMT only with invariants took 4914 ms to find 0 implicit places.
[2023-03-22 17:58:32] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 17:58:32] [INFO ] Invariant cache hit.
[2023-03-22 17:58:40] [INFO ] Dead Transitions using invariants and state equation in 8452 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14263 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 970 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 632 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 17:58:42] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-22 17:58:45] [INFO ] Computed 1301 place invariants in 2512 ms
[2023-03-22 17:58:46] [INFO ] Implicit Places using invariants in 4124 ms returned []
Implicit Place search using SMT only with invariants took 4133 ms to find 0 implicit places.
[2023-03-22 17:58:46] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:58:46] [INFO ] Invariant cache hit.
[2023-03-22 17:58:48] [INFO ] Dead Transitions using invariants and state equation in 1597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6373 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 570 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 9514 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9514 steps, saw 4707 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 17:58:53] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 17:58:53] [INFO ] Invariant cache hit.
[2023-03-22 17:58:56] [INFO ] After 3468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:59:00] [INFO ] [Nat]Absence check using 47 positive place invariants in 229 ms returned sat
[2023-03-22 17:59:01] [INFO ] [Nat]Absence check using 47 positive and 1254 generalized place invariants in 782 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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-22 17:59:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:59:21] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14399 place count 13361 transition count 22675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 19 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22199 place count 6161 transition count 15476
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28798 place count 6161 transition count 15476
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28798 place count 6161 transition count 15453
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28844 place count 6138 transition count 15453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 29393 place count 5589 transition count 8865
Iterating global reduction 3 with 549 rules applied. Total rules applied 29942 place count 5589 transition count 8865
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29992 place count 5564 transition count 8840
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 30329 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 30666 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 30691 place count 5227 transition count 14542
Applied a total of 30691 rules in 5461 ms. Remains 5227 /20560 variables (removed 15333) and now considering 14542/29875 (removed 15333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5461 ms. Remains : 5227/20560 places, 14542/29875 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 830 ms. (steps per millisecond=12 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 19915 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19915 steps, saw 9402 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 17:59:31] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-22 17:59:32] [INFO ] Computed 1301 place invariants in 377 ms
[2023-03-22 17:59:33] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 17:59:33] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 332 ms returned sat
[2023-03-22 17:59:40] [INFO ] After 7332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-22 17:59:40] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-22 17:59:43] [INFO ] After 2260ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:59:43] [INFO ] After 10934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:59:44] [INFO ] [Nat]Absence check using 49 positive place invariants in 71 ms returned sat
[2023-03-22 17:59:44] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 336 ms returned sat
[2023-03-22 17:59:55] [INFO ] After 10452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 18:00:08] [INFO ] After 13080ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 18:00:08] [INFO ] After 13081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 18:00:08] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 880 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 881 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 887 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-22 18:00:10] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 18:00:10] [INFO ] Invariant cache hit.
[2023-03-22 18:00:14] [INFO ] Implicit Places using invariants in 4803 ms returned []
Implicit Place search using SMT only with invariants took 4805 ms to find 0 implicit places.
[2023-03-22 18:00:14] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 18:00:14] [INFO ] Invariant cache hit.
[2023-03-22 18:00:23] [INFO ] Dead Transitions using invariants and state equation in 8303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14003 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3625 edges and 5227 vertex of which 25 / 5227 are part of one of the 1 SCC in 5 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55758 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
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 243 rules applied. Total rules applied 245 place count 4795 transition count 12813
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 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 1 with 722 rules applied. Total rules applied 967 place count 4553 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 4313 transition count 11895
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 4074 transition count 11499
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 4 with 556 rules applied. Total rules applied 2836 place count 3875 transition count 11142
Ensure Unique test removed 36 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 5 with 514 rules applied. Total rules applied 3350 place count 3679 transition count 10824
Ensure Unique test removed 2 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 6 with 444 rules applied. Total rules applied 3794 place count 3519 transition count 10540
Ensure Unique test removed 32 places
Reduce places removed 158 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 7 with 408 rules applied. Total rules applied 4202 place count 3361 transition count 10290
Ensure Unique test removed 2 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 8 with 346 rules applied. Total rules applied 4548 place count 3235 transition count 10070
Ensure Unique test removed 28 places
Reduce places removed 124 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 9 with 314 rules applied. Total rules applied 4862 place count 3111 transition count 9880
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 261 rules applied. Total rules applied 5123 place count 3015 transition count 9715
Ensure Unique test removed 23 places
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 234 rules applied. Total rules applied 5357 place count 2921 transition count 9575
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5546 place count 2850 transition count 9457
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5711 place count 2781 transition count 9361
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5839 place count 2732 transition count 9282
Ensure Unique test removed 15 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 109 rules applied. Total rules applied 5948 place count 2685 transition count 9220
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6028 place count 2653 transition count 9172
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6092 place count 2623 transition count 9138
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6134 place count 2605 transition count 9114
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6164 place count 2589 transition count 9100
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 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 20 with 16 rules applied. Total rules applied 6180 place count 2581 transition count 9092
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6190 place count 2575 transition count 9088
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6196 place count 2571 transition count 9086
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6196 place count 2571 transition count 8486
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 7995 place count 1372 transition count 8486
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8594 place count 773 transition count 7887
Iterating global reduction 23 with 599 rules applied. Total rules applied 9193 place count 773 transition count 7887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9193 place count 773 transition count 7886
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9195 place count 772 transition count 7886
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 9733 place count 234 transition count 1430
Iterating global reduction 23 with 538 rules applied. Total rules applied 10271 place count 234 transition count 1430
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 10809 place count 234 transition count 892
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 24 with 77 rules applied. Total rules applied 10886 place count 195 transition count 854
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 10899 place count 195 transition count 841
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 10901 place count 195 transition count 839
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 25 with 26 rules applied. Total rules applied 10927 place count 195 transition count 813
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 25 with 26 rules applied. Total rules applied 10953 place count 169 transition count 813
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10975 place count 147 transition count 549
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 11007 place count 137 transition count 549
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 11029 place count 137 transition count 527
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11039 place count 127 transition count 407
Iterating global reduction 27 with 10 rules applied. Total rules applied 11049 place count 127 transition count 407
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11059 place count 117 transition count 397
Iterating global reduction 27 with 10 rules applied. Total rules applied 11069 place count 117 transition count 397
Applied a total of 11069 rules in 10062 ms. Remains 117 /5227 variables (removed 5110) and now considering 397/14542 (removed 14145) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 397 rows 117 cols
[2023-03-22 18:00:33] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-22 18:00:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 18:00:33] [INFO ] [Real]Absence check using 4 positive and 40 generalized place invariants in 12 ms returned sat
[2023-03-22 18:00:33] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-22 18:00:33] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 18:00:33] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-22 18:00:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 18:00:33] [INFO ] [Nat]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-22 18:00:33] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 18:00:33] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 18:00:33] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 718 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 812 reset in 1763 ms.
Product exploration explored 100000 steps with 812 reset in 1825 ms.
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 619 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 18:00:39] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
// Phase 1: matrix 29275 rows 20560 cols
[2023-03-22 18:00:41] [INFO ] Computed 1301 place invariants in 2593 ms
[2023-03-22 18:00:43] [INFO ] Implicit Places using invariants in 4208 ms returned []
Implicit Place search using SMT only with invariants took 4214 ms to find 0 implicit places.
[2023-03-22 18:00:43] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:00:43] [INFO ] Invariant cache hit.
[2023-03-22 18:00:45] [INFO ] Dead Transitions using invariants and state equation in 1812 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6650 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 finished in 251221 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)))'
Support contains 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 623 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 18:00:47] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:00:47] [INFO ] Invariant cache hit.
[2023-03-22 18:00:49] [INFO ] Implicit Places using invariants in 1832 ms returned []
Implicit Place search using SMT only with invariants took 1840 ms to find 0 implicit places.
[2023-03-22 18:00:49] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:00:49] [INFO ] Invariant cache hit.
[2023-03-22 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4048 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s14986 s4189), p0:(GT s16941 s12258)], 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 timeout after 64670 steps with 32335 reset in 10001 ms.
Product exploration timeout after 64740 steps with 32370 reset in 10001 ms.
Computed a total of 17936 stabilizing places and 24674 stable transitions
Computed a total of 17936 stabilizing places and 24674 stable transitions
Detected a total of 17936/20560 stabilizing places and 24674/29875 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 9 factoid took 126 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-07 finished in 24665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((!p0&&X(p1))) U X(p2))))'
Support contains 6 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 645 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 18:01:11] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:01:11] [INFO ] Invariant cache hit.
[2023-03-22 18:01:13] [INFO ] Implicit Places using invariants in 1858 ms returned []
Implicit Place search using SMT only with invariants took 1859 ms to find 0 implicit places.
[2023-03-22 18:01:13] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:01:13] [INFO ] Invariant cache hit.
[2023-03-22 18:01:15] [INFO ] Dead Transitions using invariants and state equation in 1671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4179 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) p0), (OR (NOT p1) (NOT p2) p0), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(LEQ s11166 s18217), p1:(LEQ s160 s7809), p2:(GT s1740 s7308)], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-09 finished in 4529 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 4 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Applied a total of 0 rules in 609 ms. Remains 20560 /20560 variables (removed 0) and now considering 29875/29875 (removed 0) transitions.
[2023-03-22 18:01:16] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:01:16] [INFO ] Invariant cache hit.
[2023-03-22 18:01:18] [INFO ] Implicit Places using invariants in 1608 ms returned []
Implicit Place search using SMT only with invariants took 1609 ms to find 0 implicit places.
[2023-03-22 18:01:18] [INFO ] Flow matrix only has 29275 transitions (discarded 600 similar events)
[2023-03-22 18:01:18] [INFO ] Invariant cache hit.
[2023-03-22 18:01:19] [INFO ] Dead Transitions using invariants and state equation in 1619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3839 ms. Remains : 20560/20560 places, 29875/29875 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12 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:(OR (LEQ 1 s6630) (LEQ 3 s10908) (AND (GT s3530 s577) (GT 3 s10908)))], 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 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-12 finished in 4052 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 2 out of 20560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Iterating post reduction 1 with 7199 rules applied. Total rules applied 14398 place count 13361 transition count 22676
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 600 Pre rules applied. Total rules applied 14398 place count 13361 transition count 22076
Deduced a syphon composed of 600 places in 23 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 2 with 1200 rules applied. Total rules applied 15598 place count 12761 transition count 22076
Discarding 6599 places :
Symmetric choice reduction at 2 with 6599 rule applications. Total rules 22197 place count 6162 transition count 15477
Iterating global reduction 2 with 6599 rules applied. Total rules applied 28796 place count 6162 transition count 15477
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 28796 place count 6162 transition count 15454
Deduced a syphon composed of 23 places in 12 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 28842 place count 6139 transition count 15454
Discarding 549 places :
Symmetric choice reduction at 2 with 549 rule applications. Total rules 29391 place count 5590 transition count 8866
Iterating global reduction 2 with 549 rules applied. Total rules applied 29940 place count 5590 transition count 8866
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 29990 place count 5565 transition count 8841
Applied a total of 29990 rules in 3664 ms. Remains 5565 /20560 variables (removed 14995) and now considering 8841/29875 (removed 21034) transitions.
[2023-03-22 18:01:23] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
// Phase 1: matrix 8241 rows 5565 cols
[2023-03-22 18:01:23] [INFO ] Computed 1301 place invariants in 244 ms
[2023-03-22 18:01:28] [INFO ] Implicit Places using invariants in 4770 ms returned []
[2023-03-22 18:01:28] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2023-03-22 18:01:28] [INFO ] Invariant cache hit.
[2023-03-22 18:01:34] [INFO ] Implicit Places using invariants and state equation in 6055 ms returned []
Implicit Place search using SMT with State Equation took 10832 ms to find 0 implicit places.
[2023-03-22 18:01:35] [INFO ] Redundant transitions in 1150 ms returned []
[2023-03-22 18:01:35] [INFO ] Flow matrix only has 8241 transitions (discarded 600 similar events)
[2023-03-22 18:01:35] [INFO ] Invariant cache hit.
[2023-03-22 18:01:41] [INFO ] Dead Transitions using invariants and state equation in 6104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5565/20560 places, 8841/29875 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21765 ms. Remains : 5565/20560 places, 8841/29875 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4854 s344)], 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 84 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-14 finished in 21852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&X((p1 U (!p2||G(p1)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Support contains 3 out of 20560 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 20560/20560 places, 29875/29875 transitions.
Drop transitions removed 7199 transitions
Trivial Post-agglo rules discarded 7199 transitions
Performed 7199 trivial Post agglomeration. Transition count delta: 7199
Iterating post reduction 0 with 7199 rules applied. Total rules applied 7199 place count 20560 transition count 22676
Reduce places removed 7199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7200 rules applied. Total rules applied 14399 place count 13361 transition count 22675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14400 place count 13360 transition count 22675
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 600 Pre rules applied. Total rules applied 14400 place count 13360 transition count 22075
Deduced a syphon composed of 600 places in 21 ms
Reduce places removed 600 places and 0 transitions.
Iterating global reduction 3 with 1200 rules applied. Total rules applied 15600 place count 12760 transition count 22075
Discarding 6599 places :
Symmetric choice reduction at 3 with 6599 rule applications. Total rules 22199 place count 6161 transition count 15476
Iterating global reduction 3 with 6599 rules applied. Total rules applied 28798 place count 6161 transition count 15476
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 28798 place count 6161 transition count 15453
Deduced a syphon composed of 23 places in 13 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 28844 place count 6138 transition count 15453
Discarding 549 places :
Symmetric choice reduction at 3 with 549 rule applications. Total rules 29393 place count 5589 transition count 8865
Iterating global reduction 3 with 549 rules applied. Total rules applied 29942 place count 5589 transition count 8865
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 29992 place count 5564 transition count 8840
Applied a total of 29992 rules in 3593 ms. Remains 5564 /20560 variables (removed 14996) and now considering 8840/29875 (removed 21035) transitions.
[2023-03-22 18:01:45] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
// Phase 1: matrix 8240 rows 5564 cols
[2023-03-22 18:01:45] [INFO ] Computed 1301 place invariants in 277 ms
[2023-03-22 18:01:50] [INFO ] Implicit Places using invariants in 4765 ms returned []
[2023-03-22 18:01:50] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:01:50] [INFO ] Invariant cache hit.
[2023-03-22 18:01:54] [INFO ] Implicit Places using invariants and state equation in 4198 ms returned []
Implicit Place search using SMT with State Equation took 8964 ms to find 0 implicit places.
[2023-03-22 18:01:54] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:01:54] [INFO ] Invariant cache hit.
[2023-03-22 18:02:00] [INFO ] Dead Transitions using invariants and state equation in 5699 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5564/20560 places, 8840/29875 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18257 ms. Remains : 5564/20560 places, 8840/29875 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s911), p0:(GT s792 s2881), p2:(OR (LEQ 1 s911) (LEQ s792 s2881))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1154 reset in 1492 ms.
Product exploration explored 100000 steps with 1154 reset in 1486 ms.
Computed a total of 2965 stabilizing places and 3664 stable transitions
Computed a total of 2965 stabilizing places and 3664 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 633 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 22582 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22582 steps, saw 10815 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-22 18:02:07] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:02:07] [INFO ] Invariant cache hit.
[2023-03-22 18:02:09] [INFO ] [Real]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-22 18:02:09] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 392 ms returned sat
[2023-03-22 18:02:16] [INFO ] After 6648ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:7
[2023-03-22 18:02:16] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2023-03-22 18:02:17] [INFO ] After 939ms SMT Verify possible using 3163 Read/Feed constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-22 18:02:17] [INFO ] After 9344ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-22 18:02:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-22 18:02:18] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 368 ms returned sat
[2023-03-22 18:02:27] [INFO ] After 8412ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2023-03-22 18:02:35] [INFO ] After 8388ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-22 18:02:42] [INFO ] Deduced a trap composed of 911 places in 6227 ms of which 13 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:251)
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-22 18:02:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 18:02:42] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:8
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5227 transition count 14542
Applied a total of 699 rules in 2493 ms. Remains 5227 /5564 variables (removed 337) and now considering 14542/8840 (removed -5702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2494 ms. Remains : 5227/5564 places, 14542/8840 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 861 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 19370 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 19370 steps, saw 9166 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 18:02:49] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-22 18:02:50] [INFO ] Computed 1301 place invariants in 414 ms
[2023-03-22 18:02:50] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-22 18:02:51] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 331 ms returned sat
[2023-03-22 18:03:02] [INFO ] After 12545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 18:03:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 65 ms returned sat
[2023-03-22 18:03:03] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 318 ms returned sat
[2023-03-22 18:03:15] [INFO ] After 10845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 18:03:15] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-22 18:03:27] [INFO ] After 12481ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-22 18:03:27] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 893 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 894 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 894 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-22 18:03:29] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 18:03:29] [INFO ] Invariant cache hit.
[2023-03-22 18:03:34] [INFO ] Implicit Places using invariants in 5488 ms returned []
Implicit Place search using SMT only with invariants took 5491 ms to find 0 implicit places.
[2023-03-22 18:03:34] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 18:03:34] [INFO ] Invariant cache hit.
[2023-03-22 18:03:43] [INFO ] Dead Transitions using invariants and state equation in 8609 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15001 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3625 edges and 5227 vertex of which 25 / 5227 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55758 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
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 243 rules applied. Total rules applied 245 place count 4795 transition count 12813
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 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 1 with 722 rules applied. Total rules applied 967 place count 4553 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 4313 transition count 11895
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 4074 transition count 11499
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 4 with 556 rules applied. Total rules applied 2836 place count 3875 transition count 11142
Ensure Unique test removed 36 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 5 with 514 rules applied. Total rules applied 3350 place count 3679 transition count 10824
Ensure Unique test removed 2 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 6 with 444 rules applied. Total rules applied 3794 place count 3519 transition count 10540
Ensure Unique test removed 32 places
Reduce places removed 158 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 7 with 408 rules applied. Total rules applied 4202 place count 3361 transition count 10290
Ensure Unique test removed 2 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 8 with 346 rules applied. Total rules applied 4548 place count 3235 transition count 10070
Ensure Unique test removed 28 places
Reduce places removed 124 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 9 with 314 rules applied. Total rules applied 4862 place count 3111 transition count 9880
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 261 rules applied. Total rules applied 5123 place count 3015 transition count 9715
Ensure Unique test removed 23 places
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 234 rules applied. Total rules applied 5357 place count 2921 transition count 9575
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5546 place count 2850 transition count 9457
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5711 place count 2781 transition count 9361
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5839 place count 2732 transition count 9282
Ensure Unique test removed 15 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 109 rules applied. Total rules applied 5948 place count 2685 transition count 9220
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6028 place count 2653 transition count 9172
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6092 place count 2623 transition count 9138
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6134 place count 2605 transition count 9114
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6164 place count 2589 transition count 9100
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 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 20 with 16 rules applied. Total rules applied 6180 place count 2581 transition count 9092
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6190 place count 2575 transition count 9088
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6196 place count 2571 transition count 9086
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6196 place count 2571 transition count 8486
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 7995 place count 1372 transition count 8486
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8594 place count 773 transition count 7887
Iterating global reduction 23 with 599 rules applied. Total rules applied 9193 place count 773 transition count 7887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9193 place count 773 transition count 7886
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9195 place count 772 transition count 7886
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 9733 place count 234 transition count 1430
Iterating global reduction 23 with 538 rules applied. Total rules applied 10271 place count 234 transition count 1430
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 10809 place count 234 transition count 892
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 24 with 77 rules applied. Total rules applied 10886 place count 195 transition count 854
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 10899 place count 195 transition count 841
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 10901 place count 195 transition count 839
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 25 with 26 rules applied. Total rules applied 10927 place count 195 transition count 813
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 25 with 26 rules applied. Total rules applied 10953 place count 169 transition count 813
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10975 place count 147 transition count 549
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 11007 place count 137 transition count 549
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 11029 place count 137 transition count 527
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11039 place count 127 transition count 407
Iterating global reduction 27 with 10 rules applied. Total rules applied 11049 place count 127 transition count 407
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11059 place count 117 transition count 397
Iterating global reduction 27 with 10 rules applied. Total rules applied 11069 place count 117 transition count 397
Applied a total of 11069 rules in 12201 ms. Remains 117 /5227 variables (removed 5110) and now considering 397/14542 (removed 14145) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 397 rows 117 cols
[2023-03-22 18:03:55] [INFO ] Computed 44 place invariants in 7 ms
[2023-03-22 18:03:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:55] [INFO ] [Real]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-22 18:03:55] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-22 18:03:56] [INFO ] After 130ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 18:03:56] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-22 18:03:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 18:03:56] [INFO ] [Nat]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-22 18:03:56] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 18:03:56] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-22 18:03:56] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 999 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Applied a total of 0 rules in 427 ms. Remains 5564 /5564 variables (removed 0) and now considering 8840/8840 (removed 0) transitions.
[2023-03-22 18:03:58] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
// Phase 1: matrix 8240 rows 5564 cols
[2023-03-22 18:03:58] [INFO ] Computed 1301 place invariants in 240 ms
[2023-03-22 18:04:02] [INFO ] Implicit Places using invariants in 4664 ms returned []
[2023-03-22 18:04:02] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:04:02] [INFO ] Invariant cache hit.
[2023-03-22 18:04:07] [INFO ] Implicit Places using invariants and state equation in 4537 ms returned []
Implicit Place search using SMT with State Equation took 9204 ms to find 0 implicit places.
[2023-03-22 18:04:07] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:04:07] [INFO ] Invariant cache hit.
[2023-03-22 18:04:13] [INFO ] Dead Transitions using invariants and state equation in 5937 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15574 ms. Remains : 5564/5564 places, 8840/8840 transitions.
Computed a total of 2965 stabilizing places and 3664 stable transitions
Computed a total of 2965 stabilizing places and 3664 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 499 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 115 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 22435 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 22435 steps, saw 10748 distinct states, run finished after 3001 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 18:04:17] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:04:17] [INFO ] Invariant cache hit.
[2023-03-22 18:04:18] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 18:04:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-22 18:04:19] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 389 ms returned sat
[2023-03-22 18:04:27] [INFO ] After 6796ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-22 18:04:27] [INFO ] State equation strengthened by 3163 read => feed constraints.
[2023-03-22 18:04:34] [INFO ] After 6942ms SMT Verify possible using 3163 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-22 18:04:41] [INFO ] Deduced a trap composed of 1131 places in 6567 ms of which 7 ms to minimize.
[2023-03-22 18:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7157 ms
[2023-03-22 18:04:50] [INFO ] Deduced a trap composed of 2 places in 6668 ms of which 5 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-22 18:04:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 18:04:50] [INFO ] After 31721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 0 with 337 rules applied. Total rules applied 337 place count 5564 transition count 14542
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 0 with 337 rules applied. Total rules applied 674 place count 5227 transition count 14542
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 699 place count 5227 transition count 14542
Applied a total of 699 rules in 2683 ms. Remains 5227 /5564 variables (removed 337) and now considering 14542/8840 (removed -5702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2683 ms. Remains : 5227/5564 places, 14542/8840 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 18519 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 18519 steps, saw 8777 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 18:04:57] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
// Phase 1: matrix 13656 rows 5227 cols
[2023-03-22 18:04:58] [INFO ] Computed 1301 place invariants in 416 ms
[2023-03-22 18:04:58] [INFO ] [Real]Absence check using 49 positive place invariants in 72 ms returned sat
[2023-03-22 18:04:59] [INFO ] [Real]Absence check using 49 positive and 1252 generalized place invariants in 371 ms returned sat
[2023-03-22 18:05:07] [INFO ] After 8246ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-22 18:05:07] [INFO ] State equation strengthened by 9202 read => feed constraints.
[2023-03-22 18:05:10] [INFO ] After 2424ms SMT Verify possible using 9202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 18:05:10] [INFO ] After 12066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 18:05:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-22 18:05:11] [INFO ] [Nat]Absence check using 49 positive and 1252 generalized place invariants in 362 ms returned sat
[2023-03-22 18:05:21] [INFO ] After 9675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 18:05:35] [INFO ] After 13804ms SMT Verify possible using 9202 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-22 18:05:35] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 5227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 944 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5227/5227 places, 14542/14542 transitions.
Applied a total of 0 rules in 905 ms. Remains 5227 /5227 variables (removed 0) and now considering 14542/14542 (removed 0) transitions.
[2023-03-22 18:05:37] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 18:05:37] [INFO ] Invariant cache hit.
[2023-03-22 18:05:42] [INFO ] Implicit Places using invariants in 5178 ms returned []
Implicit Place search using SMT only with invariants took 5179 ms to find 0 implicit places.
[2023-03-22 18:05:42] [INFO ] Flow matrix only has 13656 transitions (discarded 886 similar events)
[2023-03-22 18:05:42] [INFO ] Invariant cache hit.
[2023-03-22 18:05:50] [INFO ] Dead Transitions using invariants and state equation in 8219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14307 ms. Remains : 5227/5227 places, 14542/14542 transitions.
Graph (trivial) has 3625 edges and 5227 vertex of which 25 / 5227 are part of one of the 1 SCC in 2 ms
Free SCC test removed 24 places
Drop transitions removed 644 transitions
Ensure Unique test removed 842 transitions
Reduce isomorphic transitions removed 1486 transitions.
Graph (complete) has 55758 edges and 5203 vertex of which 5181 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.7 ms
Discarding 22 places :
Also discarding 0 output transitions
Ensure Unique test removed 385 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t12373.t14833 and 1 places that fell out of Prefix Of Interest.
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 243 rules applied. Total rules applied 245 place count 4795 transition count 12813
Ensure Unique test removed 1 places
Reduce places removed 242 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 241 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 1 with 722 rules applied. Total rules applied 967 place count 4553 transition count 12333
Ensure Unique test removed 1 places
Reduce places removed 240 places and 0 transitions.
Drop transitions removed 40 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 239 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 2 with 678 rules applied. Total rules applied 1645 place count 4313 transition count 11895
Ensure Unique test removed 40 places
Reduce places removed 239 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 3 with 635 rules applied. Total rules applied 2280 place count 4074 transition count 11499
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 36 transitions
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 197 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 4 with 556 rules applied. Total rules applied 2836 place count 3875 transition count 11142
Ensure Unique test removed 36 places
Reduce places removed 196 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 5 with 514 rules applied. Total rules applied 3350 place count 3679 transition count 10824
Ensure Unique test removed 2 places
Reduce places removed 160 places and 0 transitions.
Drop transitions removed 32 transitions
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 158 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 6 with 444 rules applied. Total rules applied 3794 place count 3519 transition count 10540
Ensure Unique test removed 32 places
Reduce places removed 158 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 7 with 408 rules applied. Total rules applied 4202 place count 3361 transition count 10290
Ensure Unique test removed 2 places
Reduce places removed 126 places and 0 transitions.
Drop transitions removed 28 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 124 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 8 with 346 rules applied. Total rules applied 4548 place count 3235 transition count 10070
Ensure Unique test removed 28 places
Reduce places removed 124 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 9 with 314 rules applied. Total rules applied 4862 place count 3111 transition count 9880
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 23 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 10 with 261 rules applied. Total rules applied 5123 place count 3015 transition count 9715
Ensure Unique test removed 23 places
Reduce places removed 94 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 11 with 234 rules applied. Total rules applied 5357 place count 2921 transition count 9575
Ensure Unique test removed 2 places
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 12 with 189 rules applied. Total rules applied 5546 place count 2850 transition count 9457
Ensure Unique test removed 20 places
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 13 with 165 rules applied. Total rules applied 5711 place count 2781 transition count 9361
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 14 with 128 rules applied. Total rules applied 5839 place count 2732 transition count 9282
Ensure Unique test removed 15 places
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 15 with 109 rules applied. Total rules applied 5948 place count 2685 transition count 9220
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 16 with 80 rules applied. Total rules applied 6028 place count 2653 transition count 9172
Ensure Unique test removed 12 places
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 17 with 64 rules applied. Total rules applied 6092 place count 2623 transition count 9138
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 18 with 42 rules applied. Total rules applied 6134 place count 2605 transition count 9114
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 19 with 30 rules applied. Total rules applied 6164 place count 2589 transition count 9100
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 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 20 with 16 rules applied. Total rules applied 6180 place count 2581 transition count 9092
Ensure Unique test removed 4 places
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 21 with 10 rules applied. Total rules applied 6190 place count 2575 transition count 9088
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 6196 place count 2571 transition count 9086
Performed 600 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 600 Pre rules applied. Total rules applied 6196 place count 2571 transition count 8486
Deduced a syphon composed of 600 places in 2 ms
Ensure Unique test removed 599 places
Reduce places removed 1199 places and 0 transitions.
Iterating global reduction 23 with 1799 rules applied. Total rules applied 7995 place count 1372 transition count 8486
Discarding 599 places :
Symmetric choice reduction at 23 with 599 rule applications. Total rules 8594 place count 773 transition count 7887
Iterating global reduction 23 with 599 rules applied. Total rules applied 9193 place count 773 transition count 7887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 1 Pre rules applied. Total rules applied 9193 place count 773 transition count 7886
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 9195 place count 772 transition count 7886
Discarding 538 places :
Symmetric choice reduction at 23 with 538 rule applications. Total rules 9733 place count 234 transition count 1430
Iterating global reduction 23 with 538 rules applied. Total rules applied 10271 place count 234 transition count 1430
Ensure Unique test removed 538 transitions
Reduce isomorphic transitions removed 538 transitions.
Iterating post reduction 23 with 538 rules applied. Total rules applied 10809 place count 234 transition count 892
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 24 with 77 rules applied. Total rules applied 10886 place count 195 transition count 854
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 24 with 13 rules applied. Total rules applied 10899 place count 195 transition count 841
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 10901 place count 195 transition count 839
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 25 with 26 rules applied. Total rules applied 10927 place count 195 transition count 813
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 25 with 26 rules applied. Total rules applied 10953 place count 169 transition count 813
Discarding 22 places :
Symmetric choice reduction at 26 with 22 rule applications. Total rules 10975 place count 147 transition count 549
Ensure Unique test removed 10 places
Iterating global reduction 26 with 32 rules applied. Total rules applied 11007 place count 137 transition count 549
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 26 with 22 rules applied. Total rules applied 11029 place count 137 transition count 527
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11039 place count 127 transition count 407
Iterating global reduction 27 with 10 rules applied. Total rules applied 11049 place count 127 transition count 407
Discarding 10 places :
Symmetric choice reduction at 27 with 10 rule applications. Total rules 11059 place count 117 transition count 397
Iterating global reduction 27 with 10 rules applied. Total rules applied 11069 place count 117 transition count 397
Applied a total of 11069 rules in 10487 ms. Remains 117 /5227 variables (removed 5110) and now considering 397/14542 (removed 14145) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 397 rows 117 cols
[2023-03-22 18:06:00] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-22 18:06:00] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 18:06:01] [INFO ] [Real]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-22 18:06:01] [INFO ] After 83ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-22 18:06:01] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-22 18:06:01] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-22 18:06:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-22 18:06:01] [INFO ] [Nat]Absence check using 4 positive and 40 generalized place invariants in 7 ms returned sat
[2023-03-22 18:06:01] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 18:06:01] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 18:06:01] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (AND p1 p2)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 697 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 1155 reset in 1228 ms.
Product exploration explored 100000 steps with 1154 reset in 1216 ms.
Support contains 3 out of 5564 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5564/5564 places, 8840/8840 transitions.
Applied a total of 0 rules in 443 ms. Remains 5564 /5564 variables (removed 0) and now considering 8840/8840 (removed 0) transitions.
[2023-03-22 18:06:05] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
// Phase 1: matrix 8240 rows 5564 cols
[2023-03-22 18:06:05] [INFO ] Computed 1301 place invariants in 239 ms
[2023-03-22 18:06:10] [INFO ] Implicit Places using invariants in 4711 ms returned []
[2023-03-22 18:06:10] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:06:10] [INFO ] Invariant cache hit.
[2023-03-22 18:06:14] [INFO ] Implicit Places using invariants and state equation in 4534 ms returned []
Implicit Place search using SMT with State Equation took 9246 ms to find 0 implicit places.
[2023-03-22 18:06:14] [INFO ] Flow matrix only has 8240 transitions (discarded 600 similar events)
[2023-03-22 18:06:14] [INFO ] Invariant cache hit.
[2023-03-22 18:06:20] [INFO ] Dead Transitions using invariants and state equation in 5663 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15356 ms. Remains : 5564/5564 places, 8840/8840 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 finished in 279464 ms.
[2023-03-22 18:06:22] [INFO ] Flatten gal took : 763 ms
[2023-03-22 18:06:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 18:06:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20560 places, 29875 transitions and 109282 arcs took 102 ms.
Total runtime 752536 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MultiCrashLeafsetExtension-PT-S24C12
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1679508558118

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
lola: Created skeleton in 11.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 80 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 85 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 90 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 95 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 100 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 105 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 110 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 115 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 120 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 130 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 135 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 140 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 1
lola: LAUNCH task # 1 (type EXCL) for 0 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06
lola: time limit : 3455 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 0/3455 1/32 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 2178 m, 435 m/sec, 2450 t fired, .

Time elapsed: 145 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3455 8/32 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 38675 m, 7299 m/sec, 43786 t fired, .

Time elapsed: 150 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3455 15/32 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 74868 m, 7238 m/sec, 84769 t fired, .

Time elapsed: 155 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3455 22/32 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 111019 m, 7230 m/sec, 125589 t fired, .

Time elapsed: 160 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3455 27/32 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 146893 m, 7174 m/sec, 166257 t fired, .

Time elapsed: 165 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3455 32/32 MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 182954 m, 7212 m/sec, 207158 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MultiCrashLeafsetExtension-PT-S24C12-LTLCardinality-06: LTL unknown AGGR


Time elapsed: 175 secs. Pages in use: 32

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="MultiCrashLeafsetExtension-PT-S24C12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S24C12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856416700883"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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