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.r233-tall-167856418500204.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is JoinFreeModules-PT-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418500204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 JoinFreeModules-PT-0500-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679468731924

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:05:33] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2023-03-22 07:05:33] [INFO ] Transformed 2501 places.
[2023-03-22 07:05:33] [INFO ] Transformed 4001 transitions.
[2023-03-22 07:05:33] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0500-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 316 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:05:34] [INFO ] Computed 500 place invariants in 37 ms
[2023-03-22 07:05:36] [INFO ] Dead Transitions using invariants and state equation in 2280 ms found 0 transitions.
[2023-03-22 07:05:36] [INFO ] Invariant cache hit.
[2023-03-22 07:05:37] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-22 07:05:37] [INFO ] Invariant cache hit.
[2023-03-22 07:05:38] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:05:39] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
[2023-03-22 07:05:39] [INFO ] Invariant cache hit.
[2023-03-22 07:05:41] [INFO ] Dead Transitions using invariants and state equation in 1948 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6935 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 36 out of 2500 places after structural reductions.
[2023-03-22 07:05:41] [INFO ] Flatten gal took : 232 ms
[2023-03-22 07:05:41] [INFO ] Flatten gal took : 124 ms
[2023-03-22 07:05:41] [INFO ] Input system was already deterministic with 4001 transitions.
Support contains 34 out of 2500 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10031 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Probabilistic random walk after 45174 steps, saw 45105 distinct states, run finished after 3049 ms. (steps per millisecond=14 ) properties seen :3
Running SMT prover for 29 properties.
[2023-03-22 07:05:46] [INFO ] Invariant cache hit.
[2023-03-22 07:05:47] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2023-03-22 07:05:54] [INFO ] After 8130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-22 07:05:55] [INFO ] [Nat]Absence check using 500 positive place invariants in 99 ms returned sat
[2023-03-22 07:06:19] [INFO ] After 22402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-22 07:06:19] [INFO ] State equation strengthened by 500 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.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 07:06:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:06:19] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:29
Fused 29 Parikh solutions to 10 different solutions.
Parikh walk visited 15 properties in 18012 ms.
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 80 are kept as prefixes of interest. Removing 2420 places using SCC suffix rule.7 ms
Discarding 2420 places :
Also discarding 3872 output transitions
Drop transitions removed 3872 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 30 ms. Remains 80 /2500 variables (removed 2420) and now considering 128/4001 (removed 3873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-22 07:06:37] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 07:06:37] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 80/2500 places, 128/4001 transitions.
Incomplete random walk after 10198 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=784 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 07:06:37] [INFO ] Invariant cache hit.
[2023-03-22 07:06:37] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 07:06:37] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 07:06:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 07:06:37] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 07:06:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 07:06:37] [INFO ] After 15ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 07:06:37] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 07:06:37] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
Parikh walk visited 2 properties in 43 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&X(F(p1))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 247 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:06:38] [INFO ] Computed 500 place invariants in 12 ms
[2023-03-22 07:06:40] [INFO ] Dead Transitions using invariants and state equation in 1933 ms found 0 transitions.
[2023-03-22 07:06:40] [INFO ] Invariant cache hit.
[2023-03-22 07:06:41] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-22 07:06:41] [INFO ] Invariant cache hit.
[2023-03-22 07:06:42] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:06:43] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
[2023-03-22 07:06:43] [INFO ] Invariant cache hit.
[2023-03-22 07:06:45] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6664 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s690 3), p1:(OR (GEQ s690 3) (GEQ s1441 2))], nbAcceptance=1, 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]]
Product exploration timeout after 72310 steps with 60 reset in 10001 ms.
Product exploration timeout after 72560 steps with 86 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10276 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:07:29] [INFO ] Invariant cache hit.
[2023-03-22 07:07:29] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p1)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0500-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0500-LTLFireability-01 finished in 51803 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)&&G(F(p1))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 245 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:07:30] [INFO ] Invariant cache hit.
[2023-03-22 07:07:32] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
[2023-03-22 07:07:32] [INFO ] Invariant cache hit.
[2023-03-22 07:07:32] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-22 07:07:32] [INFO ] Invariant cache hit.
[2023-03-22 07:07:34] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:07:34] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2023-03-22 07:07:34] [INFO ] Redundant transitions in 252 ms returned []
[2023-03-22 07:07:34] [INFO ] Invariant cache hit.
[2023-03-22 07:07:36] [INFO ] Dead Transitions using invariants and state equation in 1891 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6441 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1345 3), p1:(GEQ s2058 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-02 finished in 6642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)||(p1&&F(p2)))) U X(G(p1)))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:07:36] [INFO ] Invariant cache hit.
[2023-03-22 07:07:38] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
[2023-03-22 07:07:38] [INFO ] Invariant cache hit.
[2023-03-22 07:07:39] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-22 07:07:39] [INFO ] Invariant cache hit.
[2023-03-22 07:07:40] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:07:40] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
[2023-03-22 07:07:40] [INFO ] Invariant cache hit.
[2023-03-22 07:07:42] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6154 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p2), (AND p1 (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s1425 3), p0:(GEQ s483 4), p2:(GEQ s1435 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-03 finished in 6518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 51 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:07:43] [INFO ] Invariant cache hit.
[2023-03-22 07:07:45] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
[2023-03-22 07:07:45] [INFO ] Invariant cache hit.
[2023-03-22 07:07:45] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-22 07:07:45] [INFO ] Invariant cache hit.
[2023-03-22 07:07:47] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:07:47] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
[2023-03-22 07:07:47] [INFO ] Invariant cache hit.
[2023-03-22 07:07:49] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6051 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LT s1879 5), p0:(LT s1567 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1024 steps with 0 reset in 125 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-04 finished in 6312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(p1)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 188 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:07:49] [INFO ] Invariant cache hit.
[2023-03-22 07:07:51] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
[2023-03-22 07:07:51] [INFO ] Invariant cache hit.
[2023-03-22 07:07:52] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-22 07:07:52] [INFO ] Invariant cache hit.
[2023-03-22 07:07:53] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:07:53] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2023-03-22 07:07:54] [INFO ] Redundant transitions in 344 ms returned []
[2023-03-22 07:07:54] [INFO ] Invariant cache hit.
[2023-03-22 07:07:56] [INFO ] Dead Transitions using invariants and state equation in 2015 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6619 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s1522 1), p0:(GEQ s483 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 60450 steps with 13 reset in 10001 ms.
Stack based approach found an accepted trace after 28990 steps with 4 reset with depth 5250 and stack size 5249 in 5572 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-05 finished in 22303 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(X(X(F((G(F(p1))||(F(p1)&&p2))))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:08:11] [INFO ] Invariant cache hit.
[2023-03-22 07:08:13] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
[2023-03-22 07:08:13] [INFO ] Invariant cache hit.
[2023-03-22 07:08:14] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-22 07:08:14] [INFO ] Invariant cache hit.
[2023-03-22 07:08:15] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:08:15] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2023-03-22 07:08:15] [INFO ] Invariant cache hit.
[2023-03-22 07:08:17] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5916 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s958 4), p2:(AND (LT s2362 2) (LT s137 2)), p1:(LT s137 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-06 finished in 6309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 165 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:08:18] [INFO ] Invariant cache hit.
[2023-03-22 07:08:20] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
[2023-03-22 07:08:20] [INFO ] Invariant cache hit.
[2023-03-22 07:08:20] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-22 07:08:20] [INFO ] Invariant cache hit.
[2023-03-22 07:08:22] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:08:22] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2335 ms to find 0 implicit places.
[2023-03-22 07:08:22] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-22 07:08:22] [INFO ] Invariant cache hit.
[2023-03-22 07:08:24] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6378 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1457 1), p0:(GEQ s2069 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 39180 steps with 0 reset in 10001 ms.
Product exploration timeout after 38210 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10091 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Probabilistic random walk after 61247 steps, saw 61153 distinct states, run finished after 3018 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:09:11] [INFO ] Invariant cache hit.
[2023-03-22 07:09:12] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2023-03-22 07:09:13] [INFO ] After 2250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:09:14] [INFO ] [Nat]Absence check using 500 positive place invariants in 92 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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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 07:09:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:09:38] [INFO ] After 25034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.4 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 11 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 07:09:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 07:09:38] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 752 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=752 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 359 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 163 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:09:39] [INFO ] Computed 500 place invariants in 40 ms
[2023-03-22 07:09:41] [INFO ] Dead Transitions using invariants and state equation in 2102 ms found 0 transitions.
[2023-03-22 07:09:41] [INFO ] Invariant cache hit.
[2023-03-22 07:09:42] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 07:09:42] [INFO ] Invariant cache hit.
[2023-03-22 07:09:43] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:09:43] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2023-03-22 07:09:43] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-22 07:09:43] [INFO ] Invariant cache hit.
[2023-03-22 07:09:45] [INFO ] Dead Transitions using invariants and state equation in 1776 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6241 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10029 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Probabilistic random walk after 69283 steps, saw 69174 distinct states, run finished after 3019 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 07:10:13] [INFO ] Invariant cache hit.
[2023-03-22 07:10:13] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2023-03-22 07:10:15] [INFO ] After 2326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 07:10:16] [INFO ] [Nat]Absence check using 500 positive place invariants in 92 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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 07:10:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:10:40] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 10 are kept as prefixes of interest. Removing 2490 places using SCC suffix rule.2 ms
Discarding 2490 places :
Also discarding 3984 output transitions
Drop transitions removed 3984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 10 ms. Remains 10 /2500 variables (removed 2490) and now considering 16/4001 (removed 3985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-22 07:10:40] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 07:10:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 10/2500 places, 16/4001 transitions.
Finished random walk after 1379 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=689 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
Product exploration timeout after 39660 steps with 0 reset in 10003 ms.
Product exploration timeout after 37850 steps with 0 reset in 10002 ms.
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 179 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-22 07:11:01] [INFO ] Computed 500 place invariants in 15 ms
[2023-03-22 07:11:03] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
[2023-03-22 07:11:03] [INFO ] Invariant cache hit.
[2023-03-22 07:11:03] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-22 07:11:03] [INFO ] Invariant cache hit.
[2023-03-22 07:11:05] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:05] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2023-03-22 07:11:05] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-22 07:11:05] [INFO ] Invariant cache hit.
[2023-03-22 07:11:07] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6318 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLFireability-07 finished in 169661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((F(p1)||G(p0)))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:11:07] [INFO ] Invariant cache hit.
[2023-03-22 07:11:09] [INFO ] Dead Transitions using invariants and state equation in 1946 ms found 0 transitions.
[2023-03-22 07:11:09] [INFO ] Invariant cache hit.
[2023-03-22 07:11:10] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-22 07:11:10] [INFO ] Invariant cache hit.
[2023-03-22 07:11:11] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:11] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-22 07:11:11] [INFO ] Invariant cache hit.
[2023-03-22 07:11:13] [INFO ] Dead Transitions using invariants and state equation in 1881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5949 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GEQ s932 1), p0:(GEQ s805 5)], 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 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-08 finished in 6199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1)||(p1&&F(p2)))&&(p3 U (G(p3)||(p3&&G(p4)))))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:11:14] [INFO ] Invariant cache hit.
[2023-03-22 07:11:16] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
[2023-03-22 07:11:16] [INFO ] Invariant cache hit.
[2023-03-22 07:11:16] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-22 07:11:16] [INFO ] Invariant cache hit.
[2023-03-22 07:11:18] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:18] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2023-03-22 07:11:18] [INFO ] Invariant cache hit.
[2023-03-22 07:11:20] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6021 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p0), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p4)), (NOT p2), (NOT p4)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=1 dest: 5}, { cond=(AND p1 p4 p3), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=4 dest: 4}, { cond=(AND p4 p3), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 4}, { cond=(AND p4 p3), acceptance={} source=6 dest: 6}, { cond=(AND p4 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p4), acceptance={} source=8 dest: 2}, { cond=p4, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LT s1175 3), p3:(LT s2488 3), p0:(LT s188 4), p4:(LT s1619 5), p2:(LT s2499 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4881 steps with 0 reset in 806 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-09 finished in 7274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 177 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:11:21] [INFO ] Invariant cache hit.
[2023-03-22 07:11:23] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
[2023-03-22 07:11:23] [INFO ] Invariant cache hit.
[2023-03-22 07:11:23] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-22 07:11:23] [INFO ] Invariant cache hit.
[2023-03-22 07:11:25] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:25] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2023-03-22 07:11:25] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-22 07:11:25] [INFO ] Invariant cache hit.
[2023-03-22 07:11:27] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5950 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1954 5)], 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 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-10 finished in 6014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 143 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:11:27] [INFO ] Invariant cache hit.
[2023-03-22 07:11:29] [INFO ] Dead Transitions using invariants and state equation in 1755 ms found 0 transitions.
[2023-03-22 07:11:29] [INFO ] Invariant cache hit.
[2023-03-22 07:11:29] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-22 07:11:29] [INFO ] Invariant cache hit.
[2023-03-22 07:11:31] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:31] [INFO ] Implicit Places using invariants and state equation in 1781 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-22 07:11:31] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-22 07:11:31] [INFO ] Invariant cache hit.
[2023-03-22 07:11:33] [INFO ] Dead Transitions using invariants and state equation in 1858 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6093 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s2070 5) (GEQ s668 3)), p0:(GEQ s1094 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-12 finished in 6197 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((X(p1)||p0)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:11:33] [INFO ] Invariant cache hit.
[2023-03-22 07:11:35] [INFO ] Dead Transitions using invariants and state equation in 1887 ms found 0 transitions.
[2023-03-22 07:11:35] [INFO ] Invariant cache hit.
[2023-03-22 07:11:35] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-22 07:11:35] [INFO ] Invariant cache hit.
[2023-03-22 07:11:37] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:37] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2023-03-22 07:11:37] [INFO ] Invariant cache hit.
[2023-03-22 07:11:39] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5980 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-13 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 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s538 3) (GEQ s1515 3)), p1:(GEQ s2041 2)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-13 finished in 6107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 145 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:11:39] [INFO ] Invariant cache hit.
[2023-03-22 07:11:41] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
[2023-03-22 07:11:41] [INFO ] Invariant cache hit.
[2023-03-22 07:11:42] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-22 07:11:42] [INFO ] Invariant cache hit.
[2023-03-22 07:11:43] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:11:43] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-03-22 07:11:43] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-22 07:11:43] [INFO ] Invariant cache hit.
[2023-03-22 07:11:45] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6041 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s888 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 39690 steps with 0 reset in 10001 ms.
Product exploration timeout after 37960 steps with 0 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10033 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Finished Best-First random walk after 4005 steps, including 0 resets, run visited all 1 properties in 95 ms. (steps per millisecond=42 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 149 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:12:29] [INFO ] Invariant cache hit.
[2023-03-22 07:12:31] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
[2023-03-22 07:12:31] [INFO ] Invariant cache hit.
[2023-03-22 07:12:31] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-22 07:12:31] [INFO ] Invariant cache hit.
[2023-03-22 07:12:33] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:12:33] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2023-03-22 07:12:33] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-22 07:12:33] [INFO ] Invariant cache hit.
[2023-03-22 07:12:35] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6061 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Finished Best-First random walk after 4005 steps, including 0 resets, run visited all 1 properties in 92 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 39300 steps with 0 reset in 10002 ms.
Product exploration timeout after 38100 steps with 0 reset in 10003 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 129 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:13:19] [INFO ] Invariant cache hit.
[2023-03-22 07:13:21] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
[2023-03-22 07:13:21] [INFO ] Invariant cache hit.
[2023-03-22 07:13:22] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-22 07:13:22] [INFO ] Invariant cache hit.
[2023-03-22 07:13:23] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:13:23] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2023-03-22 07:13:23] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-22 07:13:23] [INFO ] Invariant cache hit.
[2023-03-22 07:13:25] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6140 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Treatment of property JoinFreeModules-PT-0500-LTLFireability-14 finished in 106286 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||G(p1)))||F(p2)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2023-03-22 07:13:25] [INFO ] Invariant cache hit.
[2023-03-22 07:13:27] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
[2023-03-22 07:13:27] [INFO ] Invariant cache hit.
[2023-03-22 07:13:28] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-22 07:13:28] [INFO ] Invariant cache hit.
[2023-03-22 07:13:29] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-22 07:13:29] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2150 ms to find 0 implicit places.
[2023-03-22 07:13:30] [INFO ] Invariant cache hit.
[2023-03-22 07:13:31] [INFO ] Dead Transitions using invariants and state equation in 1859 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5920 ms. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s285 5) (GEQ s1065 5)), p0:(LT s285 5), p1:(LT s320 3)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7609 ms.
Product exploration explored 100000 steps with 50000 reset in 8012 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0500-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0500-LTLFireability-15 finished in 45082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
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)))'
[2023-03-22 07:14:11] [INFO ] Flatten gal took : 115 ms
[2023-03-22 07:14:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 07:14:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 4001 transitions and 11500 arcs took 27 ms.
Total runtime 517998 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1427/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1427/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : JoinFreeModules-PT-0500-LTLFireability-07
Could not compute solution for formula : JoinFreeModules-PT-0500-LTLFireability-14

BK_STOP 1679469257332

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5644fbf063f4]
1: pnml2lts-mc(+0xa2496) [0x5644fbf06496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f8fb88c5140]
3: pnml2lts-mc(+0x405be5) [0x5644fc269be5]
4: pnml2lts-mc(+0x16b3f9) [0x5644fbfcf3f9]
5: pnml2lts-mc(+0x164ac4) [0x5644fbfc8ac4]
6: pnml2lts-mc(+0x272e0a) [0x5644fc0d6e0a]
7: pnml2lts-mc(+0xb61f0) [0x5644fbf1a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f8fb87184d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f8fb871867a]
10: pnml2lts-mc(+0xa1581) [0x5644fbf05581]
11: pnml2lts-mc(+0xa1910) [0x5644fbf05910]
12: pnml2lts-mc(+0xa32a2) [0x5644fbf072a2]
13: pnml2lts-mc(+0xa50f4) [0x5644fbf090f4]
14: pnml2lts-mc(+0xa516b) [0x5644fbf0916b]
15: pnml2lts-mc(+0x3f34b3) [0x5644fc2574b3]
16: pnml2lts-mc(+0x7c63d) [0x5644fbee063d]
17: pnml2lts-mc(+0x67d86) [0x5644fbecbd86]
18: pnml2lts-mc(+0x60a8a) [0x5644fbec4a8a]
19: pnml2lts-mc(+0x5eb15) [0x5644fbec2b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f8fb8700d0a]
21: pnml2lts-mc(+0x6075e) [0x5644fbec475e]
ltl formula name JoinFreeModules-PT-0500-LTLFireability-14
ltl formula formula --ltl=/tmp/1427/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 4001 transitions and 11500 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.730 real 0.160 user 0.250 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1427/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1427/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1427/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1427/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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