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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 87M
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 86M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678994160364

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS2020-PT-pb105
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-16 19:16:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 19:16:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:16:04] [INFO ] Load time of PNML (sax parser for PT used): 2351 ms
[2023-03-16 19:16:04] [INFO ] Transformed 1982 places.
[2023-03-16 19:16:04] [INFO ] Transformed 153412 transitions.
[2023-03-16 19:16:04] [INFO ] Found NUPN structural information;
[2023-03-16 19:16:05] [INFO ] Parsed PT model containing 1982 places and 153412 transitions and 610156 arcs in 2974 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
FORMULA RERS2020-PT-pb105-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RERS2020-PT-pb105-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 1982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Ensure Unique test removed 10 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1971 transition count 149639
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 1968 transition count 149588
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 1968 transition count 149588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 1968 transition count 149585
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1967 transition count 149583
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1967 transition count 149583
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 1967 transition count 149582
Applied a total of 23 rules in 1881 ms. Remains 1967 /1982 variables (removed 15) and now considering 149582/149639 (removed 57) transitions.
[2023-03-16 19:16:08] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-16 19:16:08] [INFO ] Computed 10 place invariants in 606 ms
[2023-03-16 19:16:19] [INFO ] Implicit Places using invariants in 11085 ms returned []
Implicit Place search using SMT only with invariants took 11124 ms to find 0 implicit places.
[2023-03-16 19:16:19] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:16:19] [INFO ] Invariant cache hit.
[2023-03-16 19:16:49] [INFO ] Performed 82777/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:17:13] [INFO ] Dead Transitions using invariants and state equation in 54487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1967/1982 places, 149582/149639 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67512 ms. Remains : 1967/1982 places, 149582/149639 transitions.
Support contains 66 out of 1967 places after structural reductions.
[2023-03-16 19:17:18] [INFO ] Flatten gal took : 3738 ms
[2023-03-16 19:17:21] [INFO ] Flatten gal took : 3508 ms
[2023-03-16 19:17:28] [INFO ] Input system was already deterministic with 149582 transitions.
Support contains 63 out of 1967 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1380 ms. (steps per millisecond=7 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 7733 steps, run timeout after 6008 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 7733 steps, saw 5768 distinct states, run finished after 6010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 28 properties.
[2023-03-16 19:17:37] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:17:37] [INFO ] Invariant cache hit.
[2023-03-16 19:17:38] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-16 19:17:38] [INFO ] After 1417ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-16 19:17:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-16 19:18:03] [INFO ] After 23219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-16 19:18:05] [INFO ] State equation strengthened by 5248 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-16 19:18:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:18:05] [INFO ] After 26375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:28
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 1967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1620 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 31 ms
Free SCC test removed 70 places
Drop transitions removed 3832 transitions
Ensure Unique test removed 402 transitions
Reduce isomorphic transitions removed 4234 transitions.
Graph (complete) has 126302 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.128 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 1896 transition count 145342
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 1891 transition count 145342
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 1891 transition count 145339
Deduced a syphon composed of 3 places in 106 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 1888 transition count 145339
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 1881 transition count 145332
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 1881 transition count 145332
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 42 place count 1881 transition count 145323
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 48 place count 1875 transition count 145311
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 1875 transition count 145311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 60 place count 1875 transition count 145305
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 1872 transition count 145299
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 1872 transition count 145299
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 1872 transition count 145296
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 81 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 121 place count 1846 transition count 145270
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 128 place count 1846 transition count 145263
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 27 places in 70 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 182 place count 1819 transition count 145358
Drop transitions removed 4 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 205 place count 1819 transition count 145335
Free-agglomeration rule applied 24 times with reduction of 5 identical transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 229 place count 1819 transition count 145306
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 589 transitions
Reduce isomorphic transitions removed 597 transitions.
Iterating post reduction 7 with 621 rules applied. Total rules applied 850 place count 1795 transition count 144709
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 853 place count 1795 transition count 144706
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 909 place count 1792 transition count 144653
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 912 place count 1792 transition count 144650
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 918 place count 1789 transition count 144647
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 919 place count 1789 transition count 144646
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 920 place count 1788 transition count 144646
Free-agglomeration rule (complex) applied 109 times with reduction of 2118 identical transitions.
Iterating global reduction 11 with 109 rules applied. Total rules applied 1029 place count 1788 transition count 167912
Reduce places removed 109 places and 0 transitions.
Drop transitions removed 131 transitions
Ensure Unique test removed 4937 transitions
Reduce isomorphic transitions removed 5068 transitions.
Iterating post reduction 11 with 5177 rules applied. Total rules applied 6206 place count 1679 transition count 162844
Applied a total of 6206 rules in 12478 ms. Remains 1679 /1967 variables (removed 288) and now considering 162844/149582 (removed -13262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12488 ms. Remains : 1679/1967 places, 162844/149582 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1561 ms. (steps per millisecond=6 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 7813 steps, run timeout after 6002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 7813 steps, saw 6413 distinct states, run finished after 6004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 28 properties.
[2023-03-16 19:18:26] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
// Phase 1: matrix 120142 rows 1679 cols
[2023-03-16 19:18:26] [INFO ] Computed 10 place invariants in 584 ms
[2023-03-16 19:18:27] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-16 19:18:28] [INFO ] After 1128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-16 19:18:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-16 19:18:53] [INFO ] After 23460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-03-16 19:18:54] [INFO ] State equation strengthened by 5992 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-16 19:18:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:18:54] [INFO ] After 26457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:28
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 1679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1679/1679 places, 162844/162844 transitions.
Applied a total of 0 rules in 906 ms. Remains 1679 /1679 variables (removed 0) and now considering 162844/162844 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 906 ms. Remains : 1679/1679 places, 162844/162844 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1679/1679 places, 162844/162844 transitions.
Applied a total of 0 rules in 901 ms. Remains 1679 /1679 variables (removed 0) and now considering 162844/162844 (removed 0) transitions.
[2023-03-16 19:18:56] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
[2023-03-16 19:18:56] [INFO ] Invariant cache hit.
[2023-03-16 19:19:05] [INFO ] Implicit Places using invariants in 8919 ms returned []
Implicit Place search using SMT only with invariants took 8925 ms to find 0 implicit places.
[2023-03-16 19:19:05] [INFO ] Flow matrix only has 120142 transitions (discarded 42702 similar events)
[2023-03-16 19:19:05] [INFO ] Invariant cache hit.
[2023-03-16 19:19:35] [INFO ] Performed 81532/162844 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:20:04] [INFO ] Dead Transitions using invariants and state equation in 59351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69200 ms. Remains : 1679/1679 places, 162844/162844 transitions.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.443 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)) U G((F(p1)||G(p2)))))'
Support contains 6 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1663 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 6 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.126 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 62 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 59 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5237 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-16 19:20:10] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:20:11] [INFO ] Computed 10 place invariants in 448 ms
[2023-03-16 19:20:19] [INFO ] Implicit Places using invariants in 8832 ms returned []
Implicit Place search using SMT only with invariants took 8833 ms to find 0 implicit places.
[2023-03-16 19:20:19] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:20:19] [INFO ] Invariant cache hit.
[2023-03-16 19:20:49] [INFO ] Performed 82033/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:21:13] [INFO ] Dead Transitions using invariants and state equation in 54539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68631 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s152 1)), p2:(AND (EQ s138 1) (EQ s979 1)), p0:(AND (EQ s206 1) (EQ s848 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 86860 steps with 0 reset in 10001 ms.
Product exploration explored 100000 steps with 0 reset in 9735 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 437 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1649 ms. (steps per millisecond=6 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:21:38] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:21:38] [INFO ] Invariant cache hit.
[2023-03-16 19:21:38] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-16 19:22:03] [INFO ] After 24697ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 19:22:04] [INFO ] State equation strengthened by 5200 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-16 19:22:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:22:04] [INFO ] After 26334ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 71 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 114 times with reduction of 3318 identical transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 4602 place count 1783 transition count 171911
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 6921 transitions
Reduce isomorphic transitions removed 7059 transitions.
Iterating post reduction 7 with 7173 rules applied. Total rules applied 11775 place count 1669 transition count 164852
Applied a total of 11775 rules in 9159 ms. Remains 1669 /1828 variables (removed 159) and now considering 164852/149003 (removed -15849) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9164 ms. Remains : 1669/1828 places, 164852/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1644 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3924 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3924 steps, saw 3264 distinct states, run finished after 3005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:22:18] [INFO ] Flow matrix only has 121935 transitions (discarded 42917 similar events)
// Phase 1: matrix 121935 rows 1669 cols
[2023-03-16 19:22:19] [INFO ] Computed 10 place invariants in 582 ms
[2023-03-16 19:22:19] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-16 19:22:44] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:22:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-16 19:23:09] [INFO ] After 24751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:23:11] [INFO ] State equation strengthened by 6046 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 19:23:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:23:11] [INFO ] After 26738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 164852/164852 transitions.
Applied a total of 0 rules in 1093 ms. Remains 1669 /1669 variables (removed 0) and now considering 164852/164852 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 1669/1669 places, 164852/164852 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 164852/164852 transitions.
Applied a total of 0 rules in 977 ms. Remains 1669 /1669 variables (removed 0) and now considering 164852/164852 (removed 0) transitions.
[2023-03-16 19:23:13] [INFO ] Flow matrix only has 121935 transitions (discarded 42917 similar events)
[2023-03-16 19:23:13] [INFO ] Invariant cache hit.
[2023-03-16 19:23:22] [INFO ] Implicit Places using invariants in 9673 ms returned []
Implicit Place search using SMT only with invariants took 9675 ms to find 0 implicit places.
[2023-03-16 19:23:22] [INFO ] Flow matrix only has 121935 transitions (discarded 42917 similar events)
[2023-03-16 19:23:22] [INFO ] Invariant cache hit.
[2023-03-16 19:23:53] [INFO ] Performed 82039/164852 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:24:21] [INFO ] Dead Transitions using invariants and state equation in 58784 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69452 ms. Remains : 1669/1669 places, 164852/164852 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 427 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-16 19:24:22] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:24:23] [INFO ] Computed 10 place invariants in 435 ms
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 787 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-16 19:24:39] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:24:39] [INFO ] Invariant cache hit.
[2023-03-16 19:24:48] [INFO ] Implicit Places using invariants in 8961 ms returned []
Implicit Place search using SMT only with invariants took 8963 ms to find 0 implicit places.
[2023-03-16 19:24:48] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:24:48] [INFO ] Invariant cache hit.
[2023-03-16 19:25:18] [INFO ] Performed 85664/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:25:42] [INFO ] Dead Transitions using invariants and state equation in 53973 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63727 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 502 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1489 ms. (steps per millisecond=6 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:25:46] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:25:46] [INFO ] Invariant cache hit.
[2023-03-16 19:25:46] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-16 19:26:11] [INFO ] After 24707ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 19:26:12] [INFO ] State equation strengthened by 5200 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-16 19:26:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:26:12] [INFO ] After 25870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 61 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 114 times with reduction of 3318 identical transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 4602 place count 1783 transition count 171911
Reduce places removed 114 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 6921 transitions
Reduce isomorphic transitions removed 7059 transitions.
Iterating post reduction 7 with 7173 rules applied. Total rules applied 11775 place count 1669 transition count 164852
Applied a total of 11775 rules in 8528 ms. Remains 1669 /1828 variables (removed 159) and now considering 164852/149003 (removed -15849) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8534 ms. Remains : 1669/1828 places, 164852/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1630 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3595 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3595 steps, saw 2978 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:26:25] [INFO ] Flow matrix only has 121935 transitions (discarded 42917 similar events)
// Phase 1: matrix 121935 rows 1669 cols
[2023-03-16 19:26:26] [INFO ] Computed 10 place invariants in 641 ms
[2023-03-16 19:26:26] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-16 19:26:51] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:26:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-16 19:27:16] [INFO ] After 24748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:27:17] [INFO ] State equation strengthened by 6046 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-16 19:27:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:27:17] [INFO ] After 26094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 164852/164852 transitions.
Applied a total of 0 rules in 814 ms. Remains 1669 /1669 variables (removed 0) and now considering 164852/164852 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 1669/1669 places, 164852/164852 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1669/1669 places, 164852/164852 transitions.
Applied a total of 0 rules in 898 ms. Remains 1669 /1669 variables (removed 0) and now considering 164852/164852 (removed 0) transitions.
[2023-03-16 19:27:19] [INFO ] Flow matrix only has 121935 transitions (discarded 42917 similar events)
[2023-03-16 19:27:19] [INFO ] Invariant cache hit.
[2023-03-16 19:27:28] [INFO ] Implicit Places using invariants in 9299 ms returned []
Implicit Place search using SMT only with invariants took 9305 ms to find 0 implicit places.
[2023-03-16 19:27:28] [INFO ] Flow matrix only has 121935 transitions (discarded 42917 similar events)
[2023-03-16 19:27:28] [INFO ] Invariant cache hit.
[2023-03-16 19:27:59] [INFO ] Performed 83334/164852 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:28:26] [INFO ] Dead Transitions using invariants and state equation in 58060 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68282 ms. Remains : 1669/1669 places, 164852/164852 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 449 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-16 19:28:27] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:28:28] [INFO ] Computed 10 place invariants in 439 ms
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 82400 steps with 0 reset in 10001 ms.
Product exploration timeout after 66180 steps with 1 reset in 10002 ms.
Built C files in :
/tmp/ltsmin3978443662470992819
[2023-03-16 19:29:04] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2023-03-16 19:29:05] [INFO ] Built C files in 1118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3978443662470992819
Running compilation step : cd /tmp/ltsmin3978443662470992819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3978443662470992819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3978443662470992819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 750 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-16 19:29:09] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:29:09] [INFO ] Invariant cache hit.
[2023-03-16 19:29:18] [INFO ] Implicit Places using invariants in 9297 ms returned []
Implicit Place search using SMT only with invariants took 9314 ms to find 0 implicit places.
[2023-03-16 19:29:18] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:29:18] [INFO ] Invariant cache hit.
[2023-03-16 19:29:48] [INFO ] Performed 83672/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:30:13] [INFO ] Dead Transitions using invariants and state equation in 54786 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64855 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Built C files in :
/tmp/ltsmin7937480404541387763
[2023-03-16 19:30:13] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2023-03-16 19:30:14] [INFO ] Built C files in 888ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7937480404541387763
Running compilation step : cd /tmp/ltsmin7937480404541387763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7937480404541387763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7937480404541387763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 19:30:24] [INFO ] Flatten gal took : 3566 ms
[2023-03-16 19:30:27] [INFO ] Flatten gal took : 3298 ms
[2023-03-16 19:30:27] [INFO ] Time to serialize gal into /tmp/LTL13981710209556006950.gal : 509 ms
[2023-03-16 19:30:27] [INFO ] Time to serialize properties into /tmp/LTL14548255957983195823.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13981710209556006950.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5374786236481917085.hoa' '-atoms' '/tmp/LTL14548255957983195823.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2023-03-16 19:30:49] [INFO ] Flatten gal took : 3467 ms
[2023-03-16 19:30:52] [INFO ] Flatten gal took : 3373 ms
[2023-03-16 19:30:53] [INFO ] Time to serialize gal into /tmp/LTL8801531286613782530.gal : 515 ms
[2023-03-16 19:30:53] [INFO ] Time to serialize properties into /tmp/LTL5911587377827972803.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8801531286613782530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5911587377827972803.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-16 19:31:12] [INFO ] Flatten gal took : 3564 ms
[2023-03-16 19:31:12] [INFO ] Applying decomposition
[2023-03-16 19:31:15] [INFO ] Flatten gal took : 3419 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2822909857477711803.txt' '-o' '/tmp/graph2822909857477711803.bin' '-w' '/tmp/graph2822909857477711803.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2822909857477711803.bin' '-l' '-1' '-v' '-w' '/tmp/graph2822909857477711803.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:31:25] [INFO ] Decomposing Gal with order
[2023-03-16 19:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:31:38] [INFO ] Removed a total of 313131 redundant transitions.
[2023-03-16 19:31:39] [INFO ] Flatten gal took : 9610 ms
[2023-03-16 19:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 5422 labels/synchronizations in 9343 ms.
[2023-03-16 19:31:54] [INFO ] Time to serialize gal into /tmp/LTL3481776400162729741.gal : 331 ms
[2023-03-16 19:31:54] [INFO ] Time to serialize properties into /tmp/LTL10951281701263355387.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3481776400162729741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10951281701263355387.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12522115711041320841
[2023-03-16 19:32:10] [INFO ] Built C files in 1162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12522115711041320841
Running compilation step : cd /tmp/ltsmin12522115711041320841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12522115711041320841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12522115711041320841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLFireability-00 finished in 728763 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)&&F((G(F(!p1))||(!p2&&F(!p1))))))'
Support contains 6 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1666 edges and 1967 vertex of which 112 / 1967 are part of one of the 42 SCC in 5 ms
Free SCC test removed 70 places
Ensure Unique test removed 482 transitions
Reduce isomorphic transitions removed 482 transitions.
Graph (complete) has 143667 edges and 1897 vertex of which 1896 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.90 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1895 transition count 149096
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1893 transition count 149096
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1893 transition count 149093
Deduced a syphon composed of 3 places in 65 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1890 transition count 149093
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1884 transition count 149081
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1884 transition count 149081
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 1884 transition count 149073
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 38 place count 1878 transition count 149061
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 1878 transition count 149061
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 50 place count 1878 transition count 149055
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 53 place count 1875 transition count 149049
Iterating global reduction 4 with 3 rules applied. Total rules applied 56 place count 1875 transition count 149049
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 1875 transition count 149046
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 68 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 93 place count 1858 transition count 149029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 1858 transition count 149028
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 65 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 150 place count 1830 transition count 149124
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 169 place count 1830 transition count 149105
Applied a total of 169 rules in 6353 ms. Remains 1830 /1967 variables (removed 137) and now considering 149105/149582 (removed 477) transitions.
[2023-03-16 19:32:20] [INFO ] Flow matrix only has 104789 transitions (discarded 44316 similar events)
// Phase 1: matrix 104789 rows 1830 cols
[2023-03-16 19:32:20] [INFO ] Computed 10 place invariants in 529 ms
[2023-03-16 19:32:29] [INFO ] Implicit Places using invariants in 9273 ms returned []
Implicit Place search using SMT only with invariants took 9275 ms to find 0 implicit places.
[2023-03-16 19:32:29] [INFO ] Flow matrix only has 104789 transitions (discarded 44316 similar events)
[2023-03-16 19:32:29] [INFO ] Invariant cache hit.
[2023-03-16 19:32:59] [INFO ] Performed 82831/149105 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:33:23] [INFO ] Dead Transitions using invariants and state equation in 53953 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1830/1967 places, 149105/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69589 ms. Remains : 1830/1967 places, 149105/149582 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s317 1) (EQ s950 1)), p2:(AND (EQ s549 1) (EQ s1200 1)), p1:(AND (EQ s85 1) (EQ s1020 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 19 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-01 finished in 70041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))&&(p0||X(p2)))))'
Support contains 6 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 285 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-16 19:33:24] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-16 19:33:24] [INFO ] Computed 10 place invariants in 389 ms
[2023-03-16 19:33:33] [INFO ] Implicit Places using invariants in 8885 ms returned []
Implicit Place search using SMT only with invariants took 8889 ms to find 0 implicit places.
[2023-03-16 19:33:33] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:33:33] [INFO ] Invariant cache hit.
[2023-03-16 19:34:03] [INFO ] Performed 83993/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:34:26] [INFO ] Dead Transitions using invariants and state equation in 53728 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62911 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p0 (NOT p1))), true, (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s549 1) (EQ s788 1)), p1:(AND (NOT (AND (EQ s778 1) (EQ s1439 1))) (NOT (AND (EQ s549 1) (EQ s788 1)))), p2:(AND (EQ s286 1) (EQ s1321 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-02 finished in 63392 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)) U p1))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1670 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 6 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.89 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 104 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 79 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 80 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 6885 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-16 19:34:34] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:34:34] [INFO ] Computed 10 place invariants in 435 ms
[2023-03-16 19:34:43] [INFO ] Implicit Places using invariants in 8884 ms returned []
Implicit Place search using SMT only with invariants took 8886 ms to find 0 implicit places.
[2023-03-16 19:34:43] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:34:43] [INFO ] Invariant cache hit.
[2023-03-16 19:35:13] [INFO ] Performed 80093/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:35:38] [INFO ] Dead Transitions using invariants and state equation in 55166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70948 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s422 1) (EQ s1173 1)), p0:(AND (EQ s900 1) (EQ s1818 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 6 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-04 finished in 71370 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)) U X(p2)))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 234 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-16 19:35:39] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-16 19:35:39] [INFO ] Computed 10 place invariants in 443 ms
[2023-03-16 19:35:48] [INFO ] Implicit Places using invariants in 9823 ms returned []
Implicit Place search using SMT only with invariants took 9825 ms to find 0 implicit places.
[2023-03-16 19:35:48] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:35:49] [INFO ] Invariant cache hit.
[2023-03-16 19:36:19] [INFO ] Performed 78285/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:36:44] [INFO ] Dead Transitions using invariants and state equation in 55584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65647 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 253 ms :[p1, (OR (NOT p2) p1), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (EQ s305 1) (EQ s396 1) (EQ s14 1) (EQ s1305 1)), p2:(AND (EQ s1079 1) (EQ s1695 1)), p0:(AND (EQ s1164 1) (EQ s1914 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 4328 ms.
Stuttering criterion allowed to conclude after 173 steps with 0 reset in 25 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-05 finished in 70551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 286 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-16 19:36:49] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:36:49] [INFO ] Invariant cache hit.
[2023-03-16 19:36:58] [INFO ] Implicit Places using invariants in 8811 ms returned []
Implicit Place search using SMT only with invariants took 8814 ms to find 0 implicit places.
[2023-03-16 19:36:58] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:36:58] [INFO ] Invariant cache hit.
[2023-03-16 19:37:28] [INFO ] Performed 81204/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:37:53] [INFO ] Dead Transitions using invariants and state equation in 55487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64592 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s461 1) (EQ s1614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-06 finished in 65000 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)))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 256 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-16 19:37:54] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:37:54] [INFO ] Invariant cache hit.
[2023-03-16 19:38:04] [INFO ] Implicit Places using invariants in 9378 ms returned []
Implicit Place search using SMT only with invariants took 9380 ms to find 0 implicit places.
[2023-03-16 19:38:04] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:38:04] [INFO ] Invariant cache hit.
[2023-03-16 19:38:34] [INFO ] Performed 83446/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:38:58] [INFO ] Dead Transitions using invariants and state equation in 54204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63869 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1139 0) (EQ s1687 0))], 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][false, false]]
Product exploration timeout after 41760 steps with 20880 reset in 10002 ms.
Product exploration timeout after 42370 steps with 21185 reset in 10003 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.334 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLFireability-07 finished in 84899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X((!p2 U (p3||G(!p2))))))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 233 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-16 19:39:19] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:39:19] [INFO ] Invariant cache hit.
[2023-03-16 19:39:27] [INFO ] Implicit Places using invariants in 8393 ms returned []
Implicit Place search using SMT only with invariants took 8403 ms to find 0 implicit places.
[2023-03-16 19:39:27] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:39:27] [INFO ] Invariant cache hit.
[2023-03-16 19:39:58] [INFO ] Performed 78983/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:40:25] [INFO ] Dead Transitions using invariants and state equation in 57634 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66274 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s174 1) (EQ s925 1)), p0:(AND (EQ s33 1) (EQ s581 1)), p3:(AND (NOT (AND (EQ s985 1) (EQ s1911 1))) (NOT (AND (EQ s809 1) (EQ s914 1)))), p2:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 51390 steps with 25695 reset in 10001 ms.
Product exploration timeout after 51010 steps with 25505 reset in 10001 ms.
Computed a total of 188 stabilizing places and 32921 stable transitions
Graph (complete) has 144489 edges and 1967 vertex of which 1966 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.285 ms
Computed a total of 188 stabilizing places and 32921 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p1) p0 (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p3) p2)))
Knowledge based reduction with 16 factoid took 288 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RERS2020-PT-pb105-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RERS2020-PT-pb105-LTLFireability-08 finished in 87576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(F(G(!p0)) U G(p1)))))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1671 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 7 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.96 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 58 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 58 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 111 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 6101 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-16 19:40:53] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:40:53] [INFO ] Computed 10 place invariants in 366 ms
[2023-03-16 19:41:02] [INFO ] Implicit Places using invariants in 9080 ms returned []
Implicit Place search using SMT only with invariants took 9081 ms to find 0 implicit places.
[2023-03-16 19:41:02] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:41:02] [INFO ] Invariant cache hit.
[2023-03-16 19:41:32] [INFO ] Performed 80430/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:41:57] [INFO ] Dead Transitions using invariants and state equation in 55362 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70558 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s186 1) (EQ s346 1)), p1:(AND (EQ s1021 1) (EQ s1538 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 15 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-09 finished in 70885 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(p1)&&X(p2)&&p0)))'
Support contains 8 out of 1967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Applied a total of 0 rules in 273 ms. Remains 1967 /1967 variables (removed 0) and now considering 149582/149582 (removed 0) transitions.
[2023-03-16 19:41:58] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
// Phase 1: matrix 105319 rows 1967 cols
[2023-03-16 19:41:58] [INFO ] Computed 10 place invariants in 387 ms
[2023-03-16 19:42:07] [INFO ] Implicit Places using invariants in 9192 ms returned []
Implicit Place search using SMT only with invariants took 9192 ms to find 0 implicit places.
[2023-03-16 19:42:07] [INFO ] Flow matrix only has 105319 transitions (discarded 44263 similar events)
[2023-03-16 19:42:07] [INFO ] Invariant cache hit.
[2023-03-16 19:42:37] [INFO ] Performed 81253/149582 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:43:02] [INFO ] Dead Transitions using invariants and state equation in 55586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65056 ms. Remains : 1967/1967 places, 149582/149582 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-10 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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}]], initial=1, aps=[p1:(AND (EQ s549 1) (EQ s631 1)), p0:(AND (EQ s518 1) (EQ s833 1) (OR (EQ s751 0) (EQ s1626 0)) (OR (EQ s929 0) (EQ s1769 0))), p2:(AND (EQ s518 1) (EQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-10 finished in 65516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 4 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.86 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 60 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 59 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 59 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 4990 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-16 19:43:08] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:43:08] [INFO ] Computed 10 place invariants in 407 ms
[2023-03-16 19:43:17] [INFO ] Implicit Places using invariants in 8970 ms returned []
Implicit Place search using SMT only with invariants took 8971 ms to find 0 implicit places.
[2023-03-16 19:43:17] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:43:17] [INFO ] Invariant cache hit.
[2023-03-16 19:43:47] [INFO ] Performed 80977/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:44:12] [INFO ] Dead Transitions using invariants and state equation in 54900 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68870 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s568 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 11 ms.
FORMULA RERS2020-PT-pb105-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RERS2020-PT-pb105-LTLFireability-12 finished in 69185 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&&F(G(p1)))))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1669 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 5 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.87 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 63 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 62 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 62 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5296 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-16 19:44:17] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:44:17] [INFO ] Invariant cache hit.
[2023-03-16 19:44:26] [INFO ] Implicit Places using invariants in 8513 ms returned []
Implicit Place search using SMT only with invariants took 8514 ms to find 0 implicit places.
[2023-03-16 19:44:26] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:44:26] [INFO ] Invariant cache hit.
[2023-03-16 19:44:56] [INFO ] Performed 82736/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:45:20] [INFO ] Dead Transitions using invariants and state equation in 53907 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67724 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s1305 0)), p1:(OR (EQ s223 0) (EQ s914 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 71750 steps with 0 reset in 10001 ms.
Product exploration timeout after 79420 steps with 0 reset in 10001 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 325 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1248 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 4337 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4337 steps, saw 3282 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:45:46] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:45:46] [INFO ] Invariant cache hit.
[2023-03-16 19:45:47] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:45:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-16 19:46:12] [INFO ] After 24653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 19:46:13] [INFO ] State equation strengthened by 5200 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 19:46:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:46:13] [INFO ] After 25890ms 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 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 63 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8491 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8496 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1390 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 3429 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3429 steps, saw 2856 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:46:26] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-16 19:46:27] [INFO ] Computed 10 place invariants in 636 ms
[2023-03-16 19:46:27] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:46:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-16 19:46:52] [INFO ] After 24701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 19:46:53] [INFO ] State equation strengthened by 6068 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 19:46:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 19:46:53] [INFO ] After 26011ms 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 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 820 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 820 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 843 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-16 19:46:55] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 19:46:55] [INFO ] Invariant cache hit.
[2023-03-16 19:47:04] [INFO ] Implicit Places using invariants in 9134 ms returned []
Implicit Place search using SMT only with invariants took 9138 ms to find 0 implicit places.
[2023-03-16 19:47:04] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 19:47:04] [INFO ] Invariant cache hit.
[2023-03-16 19:47:34] [INFO ] Performed 81779/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:48:03] [INFO ] Dead Transitions using invariants and state equation in 59490 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69495 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 690 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-16 19:48:05] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:48:05] [INFO ] Computed 10 place invariants in 524 ms
[2023-03-16 19:48:14] [INFO ] Implicit Places using invariants in 9279 ms returned []
Implicit Place search using SMT only with invariants took 9280 ms to find 0 implicit places.
[2023-03-16 19:48:14] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:48:14] [INFO ] Invariant cache hit.
[2023-03-16 19:48:44] [INFO ] Performed 78925/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:49:10] [INFO ] Dead Transitions using invariants and state equation in 56475 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66449 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 899 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1186 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 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 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 3902 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3902 steps, saw 2967 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:49:17] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:49:17] [INFO ] Invariant cache hit.
[2023-03-16 19:49:17] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:49:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-16 19:49:42] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 68 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8368 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8373 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1283 ms. (steps per millisecond=7 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 4106 steps, run timeout after 3005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4106 steps, saw 3419 distinct states, run finished after 3006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-16 19:49:56] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-16 19:49:56] [INFO ] Computed 10 place invariants in 608 ms
[2023-03-16 19:49:57] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 19:49:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-16 19:50:22] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 838 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 839 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-16 19:50:23] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 19:50:23] [INFO ] Invariant cache hit.
[2023-03-16 19:50:33] [INFO ] Implicit Places using invariants in 9478 ms returned []
Implicit Place search using SMT only with invariants took 9480 ms to find 0 implicit places.
[2023-03-16 19:50:33] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 19:50:33] [INFO ] Invariant cache hit.
[2023-03-16 19:51:03] [INFO ] Performed 85024/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:51:30] [INFO ] Dead Transitions using invariants and state equation in 57620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67954 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 318 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration timeout after 95540 steps with 1 reset in 10001 ms.
Product exploration timeout after 97970 steps with 0 reset in 10001 ms.
Built C files in :
/tmp/ltsmin6742408734681524528
[2023-03-16 19:51:51] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2023-03-16 19:51:52] [INFO ] Built C files in 949ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6742408734681524528
Running compilation step : cd /tmp/ltsmin6742408734681524528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6742408734681524528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6742408734681524528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 689 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-16 19:51:56] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:51:56] [INFO ] Computed 10 place invariants in 391 ms
[2023-03-16 19:52:05] [INFO ] Implicit Places using invariants in 8708 ms returned []
Implicit Place search using SMT only with invariants took 8712 ms to find 0 implicit places.
[2023-03-16 19:52:05] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:52:05] [INFO ] Invariant cache hit.
[2023-03-16 19:52:35] [INFO ] Performed 81593/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:52:59] [INFO ] Dead Transitions using invariants and state equation in 54724 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64131 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Built C files in :
/tmp/ltsmin3887724053188050732
[2023-03-16 19:52:59] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2023-03-16 19:53:00] [INFO ] Built C files in 874ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3887724053188050732
Running compilation step : cd /tmp/ltsmin3887724053188050732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3887724053188050732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3887724053188050732;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 19:53:10] [INFO ] Flatten gal took : 3543 ms
[2023-03-16 19:53:13] [INFO ] Flatten gal took : 3240 ms
[2023-03-16 19:53:13] [INFO ] Time to serialize gal into /tmp/LTL9039159432356741989.gal : 485 ms
[2023-03-16 19:53:13] [INFO ] Time to serialize properties into /tmp/LTL7740355960773705520.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9039159432356741989.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15259342475642979151.hoa' '-atoms' '/tmp/LTL7740355960773705520.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Detected timeout of ITS tools.
[2023-03-16 19:53:35] [INFO ] Flatten gal took : 3579 ms
[2023-03-16 19:53:39] [INFO ] Flatten gal took : 3520 ms
[2023-03-16 19:53:39] [INFO ] Time to serialize gal into /tmp/LTL17768510232362902484.gal : 498 ms
[2023-03-16 19:53:39] [INFO ] Time to serialize properties into /tmp/LTL2102795266784254079.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17768510232362902484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2102795266784254079.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-16 19:53:58] [INFO ] Flatten gal took : 3470 ms
[2023-03-16 19:53:58] [INFO ] Applying decomposition
[2023-03-16 19:54:02] [INFO ] Flatten gal took : 3562 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8966944863431442468.txt' '-o' '/tmp/graph8966944863431442468.bin' '-w' '/tmp/graph8966944863431442468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8966944863431442468.bin' '-l' '-1' '-v' '-w' '/tmp/graph8966944863431442468.weights' '-q' '0' '-e' '0.001'
[2023-03-16 19:54:10] [INFO ] Decomposing Gal with order
[2023-03-16 19:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 19:54:22] [INFO ] Removed a total of 313781 redundant transitions.
[2023-03-16 19:54:23] [INFO ] Flatten gal took : 8843 ms
[2023-03-16 19:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6121 labels/synchronizations in 7432 ms.
[2023-03-16 19:54:36] [INFO ] Time to serialize gal into /tmp/LTL8837856360894975282.gal : 241 ms
[2023-03-16 19:54:36] [INFO ] Time to serialize properties into /tmp/LTL12460969597394403515.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8837856360894975282.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12460969597394403515.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4821982579939444125
[2023-03-16 19:54:52] [INFO ] Built C files in 895ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4821982579939444125
Running compilation step : cd /tmp/ltsmin4821982579939444125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4821982579939444125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4821982579939444125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLFireability-13 finished in 643275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 1967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1967/1967 places, 149582/149582 transitions.
Graph (trivial) has 1671 edges and 1967 vertex of which 115 / 1967 are part of one of the 43 SCC in 4 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Graph (complete) has 143614 edges and 1895 vertex of which 1894 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.89 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 1893 transition count 148992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 1891 transition count 148992
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1891 transition count 148989
Deduced a syphon composed of 3 places in 60 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1888 transition count 148989
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 1882 transition count 148977
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1882 transition count 148977
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 30 place count 1882 transition count 148971
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 1876 transition count 148959
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 1876 transition count 148959
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 1876 transition count 148953
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 51 place count 1873 transition count 148947
Iterating global reduction 4 with 3 rules applied. Total rules applied 54 place count 1873 transition count 148947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 1873 transition count 148944
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 60 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 91 place count 1856 transition count 148927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 1856 transition count 148926
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 61 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 148 place count 1828 transition count 149022
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 167 place count 1828 transition count 149003
Applied a total of 167 rules in 5500 ms. Remains 1828 /1967 variables (removed 139) and now considering 149003/149582 (removed 579) transitions.
[2023-03-16 19:55:01] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:55:01] [INFO ] Invariant cache hit.
[2023-03-16 19:55:10] [INFO ] Implicit Places using invariants in 8790 ms returned []
Implicit Place search using SMT only with invariants took 8791 ms to find 0 implicit places.
[2023-03-16 19:55:10] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:55:10] [INFO ] Invariant cache hit.
[2023-03-16 19:55:40] [INFO ] Performed 82345/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:56:02] [INFO ] Dead Transitions using invariants and state equation in 52292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1828/1967 places, 149003/149582 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66588 ms. Remains : 1828/1967 places, 149003/149582 transitions.
Stuttering acceptance computed with spot in 537 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RERS2020-PT-pb105-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s283 0) (EQ s482 0) (EQ s23 0) (EQ s1333 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 80660 steps with 1 reset in 10001 ms.
Product exploration timeout after 87750 steps with 0 reset in 10048 ms.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4940 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4940 steps, saw 3677 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:56:28] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:56:28] [INFO ] Invariant cache hit.
[2023-03-16 19:56:28] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:56:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-16 19:56:53] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 67 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8204 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8210 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1603 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4664 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4664 steps, saw 3870 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:57:07] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-16 19:57:07] [INFO ] Computed 10 place invariants in 591 ms
[2023-03-16 19:57:07] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:57:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-16 19:57:32] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 861 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 829 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-16 19:57:34] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 19:57:34] [INFO ] Invariant cache hit.
[2023-03-16 19:57:43] [INFO ] Implicit Places using invariants in 9177 ms returned []
Implicit Place search using SMT only with invariants took 9192 ms to find 0 implicit places.
[2023-03-16 19:57:43] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 19:57:43] [INFO ] Invariant cache hit.
[2023-03-16 19:58:14] [INFO ] Performed 81949/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:58:43] [INFO ] Dead Transitions using invariants and state equation in 59433 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69495 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 665 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-16 19:58:44] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 19:58:44] [INFO ] Computed 10 place invariants in 418 ms
[2023-03-16 19:58:53] [INFO ] Implicit Places using invariants in 8962 ms returned []
Implicit Place search using SMT only with invariants took 8966 ms to find 0 implicit places.
[2023-03-16 19:58:53] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:58:53] [INFO ] Invariant cache hit.
[2023-03-16 19:59:23] [INFO ] Performed 83156/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 19:59:47] [INFO ] Dead Transitions using invariants and state equation in 54471 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64107 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4285 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4285 steps, saw 3256 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:59:53] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 19:59:53] [INFO ] Invariant cache hit.
[2023-03-16 19:59:54] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:59:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-16 20:00:19] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Drop transitions removed 3751 transitions
Reduce isomorphic transitions removed 3751 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3754 rules applied. Total rules applied 3754 place count 1828 transition count 145249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 3757 place count 1825 transition count 145249
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 60 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 3777 place count 1815 transition count 145239
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3782 place count 1815 transition count 145234
Free-agglomeration rule applied 25 times with reduction of 6 identical transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 3807 place count 1815 transition count 145203
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 578 transitions
Reduce isomorphic transitions removed 586 transitions.
Iterating post reduction 3 with 611 rules applied. Total rules applied 4418 place count 1790 transition count 144617
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4421 place count 1790 transition count 144614
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 4477 place count 1787 transition count 144561
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4480 place count 1787 transition count 144558
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 4486 place count 1784 transition count 144555
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 4487 place count 1784 transition count 144554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4488 place count 1783 transition count 144554
Free-agglomeration rule (complex) applied 116 times with reduction of 3658 identical transitions.
Iterating global reduction 7 with 116 rules applied. Total rules applied 4604 place count 1783 transition count 172995
Reduce places removed 116 places and 0 transitions.
Drop transitions removed 138 transitions
Ensure Unique test removed 7636 transitions
Reduce isomorphic transitions removed 7774 transitions.
Iterating post reduction 7 with 7890 rules applied. Total rules applied 12494 place count 1667 transition count 165221
Applied a total of 12494 rules in 8248 ms. Remains 1667 /1828 variables (removed 161) and now considering 165221/149003 (removed -16218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8252 ms. Remains : 1667/1828 places, 165221/149003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1307 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4470 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4470 steps, saw 3708 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 20:00:32] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
// Phase 1: matrix 122274 rows 1667 cols
[2023-03-16 20:00:32] [INFO ] Computed 10 place invariants in 651 ms
[2023-03-16 20:00:32] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 20:00:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-16 20:00:57] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1667 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 872 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 872 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1667/1667 places, 165221/165221 transitions.
Applied a total of 0 rules in 842 ms. Remains 1667 /1667 variables (removed 0) and now considering 165221/165221 (removed 0) transitions.
[2023-03-16 20:00:59] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 20:00:59] [INFO ] Invariant cache hit.
[2023-03-16 20:01:08] [INFO ] Implicit Places using invariants in 9318 ms returned []
Implicit Place search using SMT only with invariants took 9319 ms to find 0 implicit places.
[2023-03-16 20:01:09] [INFO ] Flow matrix only has 122274 transitions (discarded 42947 similar events)
[2023-03-16 20:01:09] [INFO ] Invariant cache hit.
[2023-03-16 20:01:39] [INFO ] Performed 81317/165221 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:02:07] [INFO ] Dead Transitions using invariants and state equation in 58542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68721 ms. Remains : 1667/1667 places, 165221/165221 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 98790 steps with 1 reset in 10001 ms.
Product exploration explored 100000 steps with 0 reset in 9640 ms.
Built C files in :
/tmp/ltsmin9191801051228131037
[2023-03-16 20:02:27] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2023-03-16 20:02:28] [INFO ] Built C files in 858ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9191801051228131037
Running compilation step : cd /tmp/ltsmin9191801051228131037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9191801051228131037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9191801051228131037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1828 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1828/1828 places, 149003/149003 transitions.
Applied a total of 0 rules in 697 ms. Remains 1828 /1828 variables (removed 0) and now considering 149003/149003 (removed 0) transitions.
[2023-03-16 20:02:32] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-16 20:02:32] [INFO ] Computed 10 place invariants in 473 ms
[2023-03-16 20:02:41] [INFO ] Implicit Places using invariants in 9102 ms returned []
Implicit Place search using SMT only with invariants took 9105 ms to find 0 implicit places.
[2023-03-16 20:02:41] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
[2023-03-16 20:02:41] [INFO ] Invariant cache hit.
[2023-03-16 20:03:11] [INFO ] Performed 84635/149003 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 20:03:34] [INFO ] Dead Transitions using invariants and state equation in 53455 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63266 ms. Remains : 1828/1828 places, 149003/149003 transitions.
Built C files in :
/tmp/ltsmin18179159673812596142
[2023-03-16 20:03:35] [INFO ] Too many transitions (149003) to apply POR reductions. Disabling POR matrices.
[2023-03-16 20:03:35] [INFO ] Built C files in 885ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18179159673812596142
Running compilation step : cd /tmp/ltsmin18179159673812596142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18179159673812596142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18179159673812596142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-16 20:03:45] [INFO ] Flatten gal took : 3815 ms
[2023-03-16 20:03:48] [INFO ] Flatten gal took : 3499 ms
[2023-03-16 20:03:49] [INFO ] Time to serialize gal into /tmp/LTL18152470541536811525.gal : 518 ms
[2023-03-16 20:03:49] [INFO ] Time to serialize properties into /tmp/LTL12194797962056680069.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18152470541536811525.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7452650983801045110.hoa' '-atoms' '/tmp/LTL12194797962056680069.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Detected timeout of ITS tools.
[2023-03-16 20:04:10] [INFO ] Flatten gal took : 3574 ms
[2023-03-16 20:04:14] [INFO ] Flatten gal took : 3567 ms
[2023-03-16 20:04:14] [INFO ] Time to serialize gal into /tmp/LTL5674744549371467705.gal : 525 ms
[2023-03-16 20:04:14] [INFO ] Time to serialize properties into /tmp/LTL12926170404964468814.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5674744549371467705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12926170404964468814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2023-03-16 20:04:33] [INFO ] Flatten gal took : 3404 ms
[2023-03-16 20:04:33] [INFO ] Applying decomposition
[2023-03-16 20:04:37] [INFO ] Flatten gal took : 3481 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7251603807219018046.txt' '-o' '/tmp/graph7251603807219018046.bin' '-w' '/tmp/graph7251603807219018046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7251603807219018046.bin' '-l' '-1' '-v' '-w' '/tmp/graph7251603807219018046.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:04:45] [INFO ] Decomposing Gal with order
[2023-03-16 20:04:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:04:56] [INFO ] Removed a total of 311298 redundant transitions.
[2023-03-16 20:04:57] [INFO ] Flatten gal took : 7966 ms
[2023-03-16 20:05:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6003 labels/synchronizations in 7268 ms.
[2023-03-16 20:05:09] [INFO ] Time to serialize gal into /tmp/LTL13950282522462334505.gal : 194 ms
[2023-03-16 20:05:09] [INFO ] Time to serialize properties into /tmp/LTL7798568525633107209.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13950282522462334505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7798568525633107209.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13430238928770495265
[2023-03-16 20:05:25] [INFO ] Built C files in 933ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13430238928770495265
Running compilation step : cd /tmp/ltsmin13430238928770495265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13430238928770495265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13430238928770495265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property RERS2020-PT-pb105-LTLFireability-15 finished in 632687 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)) U G((F(p1)||G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F(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' '!(G(F(p0)))'
[2023-03-16 20:05:32] [INFO ] Flatten gal took : 3483 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3752819029991706908
[2023-03-16 20:05:34] [INFO ] Too many transitions (149582) to apply POR reductions. Disabling POR matrices.
[2023-03-16 20:05:36] [INFO ] Built C files in 1642ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3752819029991706908
Running compilation step : cd /tmp/ltsmin3752819029991706908;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-16 20:05:37] [INFO ] Applying decomposition
[2023-03-16 20:05:41] [INFO ] Flatten gal took : 3663 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16659263607775716395.txt' '-o' '/tmp/graph16659263607775716395.bin' '-w' '/tmp/graph16659263607775716395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16659263607775716395.bin' '-l' '-1' '-v' '-w' '/tmp/graph16659263607775716395.weights' '-q' '0' '-e' '0.001'
[2023-03-16 20:05:49] [INFO ] Decomposing Gal with order
[2023-03-16 20:05:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 20:06:09] [INFO ] Removed a total of 322770 redundant transitions.
[2023-03-16 20:06:11] [INFO ] Flatten gal took : 16848 ms

BK_STOP 1678997210967

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb105, 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 r325-tall-167889196900252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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