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.r517-tall-167987243600268.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 EisenbergMcGuire-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M Mar 31 16:48 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 EisenbergMcGuire-PT-09-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680834938743

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=EisenbergMcGuire-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 02:35:40] [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-04-07 02:35:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 02:35:40] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-04-07 02:35:40] [INFO ] Transformed 891 places.
[2023-04-07 02:35:40] [INFO ] Transformed 3888 transitions.
[2023-04-07 02:35:40] [INFO ] Found NUPN structural information;
[2023-04-07 02:35:40] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 823 transition count 3276
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 823 transition count 3276
Applied a total of 136 rules in 141 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2023-04-07 02:35:40] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2023-04-07 02:35:40] [INFO ] Computed 28 invariants in 28 ms
[2023-04-07 02:35:41] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-04-07 02:35:41] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-07 02:35:41] [INFO ] Invariant cache hit.
[2023-04-07 02:35:41] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-07 02:35:44] [INFO ] Implicit Places using invariants and state equation in 3108 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
[2023-04-07 02:35:44] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-07 02:35:44] [INFO ] Invariant cache hit.
[2023-04-07 02:35:45] [INFO ] Dead Transitions using invariants and state equation in 1062 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 823/891 places, 3276/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4906 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 63 out of 823 places after structural reductions.
[2023-04-07 02:35:45] [INFO ] Flatten gal took : 208 ms
[2023-04-07 02:35:46] [INFO ] Flatten gal took : 153 ms
[2023-04-07 02:35:46] [INFO ] Input system was already deterministic with 3276 transitions.
Support contains 59 out of 823 places (down from 63) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 33) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 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 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-04-07 02:35:47] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2023-04-07 02:35:47] [INFO ] Invariant cache hit.
[2023-04-07 02:35:47] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2023-04-07 02:35:47] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 02:35:47] [INFO ] After 717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-04-07 02:35:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 25 ms returned sat
[2023-04-07 02:35:48] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 02:35:50] [INFO ] After 1757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-04-07 02:35:50] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-07 02:35:52] [INFO ] After 2164ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-04-07 02:35:53] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 4 ms to minimize.
[2023-04-07 02:35:53] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 1 ms to minimize.
[2023-04-07 02:35:53] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2023-04-07 02:35:53] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 1 ms to minimize.
[2023-04-07 02:35:54] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 1 ms to minimize.
[2023-04-07 02:35:54] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-07 02:35:54] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2023-04-07 02:35:54] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 1 ms to minimize.
[2023-04-07 02:35:54] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:35:54] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 02:35:55] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-04-07 02:35:55] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-04-07 02:35:55] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-07 02:35:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2653 ms
[2023-04-07 02:35:55] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 0 ms to minimize.
[2023-04-07 02:35:55] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 1 ms to minimize.
[2023-04-07 02:35:56] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2023-04-07 02:35:56] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-04-07 02:35:56] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 0 ms to minimize.
[2023-04-07 02:35:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 925 ms
[2023-04-07 02:35:56] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2023-04-07 02:35:56] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-07 02:35:56] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:35:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2023-04-07 02:35:57] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2023-04-07 02:35:57] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 0 ms to minimize.
[2023-04-07 02:35:57] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2023-04-07 02:35:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 486 ms
[2023-04-07 02:35:57] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 1 ms to minimize.
[2023-04-07 02:35:58] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:35:58] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2023-04-07 02:35:58] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2023-04-07 02:35:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
[2023-04-07 02:35:58] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 0 ms to minimize.
[2023-04-07 02:35:58] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2023-04-07 02:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 388 ms
[2023-04-07 02:35:59] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2023-04-07 02:35:59] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2023-04-07 02:35:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2023-04-07 02:35:59] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2023-04-07 02:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-04-07 02:35:59] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2023-04-07 02:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-04-07 02:36:00] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 4 ms to minimize.
[2023-04-07 02:36:00] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 0 ms to minimize.
[2023-04-07 02:36:00] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2023-04-07 02:36:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2023-04-07 02:36:00] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-07 02:36:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-07 02:36:01] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 0 ms to minimize.
[2023-04-07 02:36:01] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:36:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-04-07 02:36:01] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2023-04-07 02:36:02] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2023-04-07 02:36:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-04-07 02:36:03] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-04-07 02:36:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-04-07 02:36:03] [INFO ] After 13093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 2927 ms.
[2023-04-07 02:36:06] [INFO ] After 18673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 28 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 442 ms.
Support contains 56 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 823 transition count 3268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 815 transition count 3268
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 247 Pre rules applied. Total rules applied 16 place count 815 transition count 3021
Deduced a syphon composed of 247 places in 3 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 2 with 494 rules applied. Total rules applied 510 place count 568 transition count 3021
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 654 place count 496 transition count 2949
Applied a total of 654 rules in 320 ms. Remains 496 /823 variables (removed 327) and now considering 2949/3276 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 496/823 places, 2949/3276 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 112870 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{1=1, 8=1, 9=1, 11=1, 12=1, 17=1, 20=1, 25=1}
Probabilistic random walk after 112870 steps, saw 78112 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :8
Running SMT prover for 20 properties.
[2023-04-07 02:36:10] [INFO ] Flow matrix only has 870 transitions (discarded 2079 similar events)
// Phase 1: matrix 870 rows 496 cols
[2023-04-07 02:36:10] [INFO ] Computed 28 invariants in 7 ms
[2023-04-07 02:36:11] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 02:36:11] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:36:11] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 02:36:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 02:36:11] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2023-04-07 02:36:12] [INFO ] After 856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-07 02:36:12] [INFO ] State equation strengthened by 388 read => feed constraints.
[2023-04-07 02:36:13] [INFO ] After 963ms SMT Verify possible using 388 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-07 02:36:13] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-04-07 02:36:13] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 02:36:14] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 02:36:15] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2023-04-07 02:36:15] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 1 ms to minimize.
[2023-04-07 02:36:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1807 ms
[2023-04-07 02:36:15] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-07 02:36:15] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 02:36:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-04-07 02:36:15] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 882 ms
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2023-04-07 02:36:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2023-04-07 02:36:17] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2023-04-07 02:36:17] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2023-04-07 02:36:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-04-07 02:36:17] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2023-04-07 02:36:17] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 0 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 733 ms
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-04-07 02:36:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 505 ms
[2023-04-07 02:36:19] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-04-07 02:36:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-07 02:36:19] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-04-07 02:36:19] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2023-04-07 02:36:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-07 02:36:19] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2023-04-07 02:36:19] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-04-07 02:36:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2023-04-07 02:36:20] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-04-07 02:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-07 02:36:20] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-04-07 02:36:20] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-04-07 02:36:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2023-04-07 02:36:20] [INFO ] After 8033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1073 ms.
[2023-04-07 02:36:21] [INFO ] After 10374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 236 ms.
Support contains 44 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 2949/2949 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 496 transition count 2945
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 492 transition count 2945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 491 transition count 2936
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 491 transition count 2936
Applied a total of 10 rules in 140 ms. Remains 491 /496 variables (removed 5) and now considering 2936/2949 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 491/496 places, 2936/2949 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 135480 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135480 steps, saw 91449 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 20 properties.
[2023-04-07 02:36:25] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
// Phase 1: matrix 857 rows 491 cols
[2023-04-07 02:36:25] [INFO ] Computed 28 invariants in 8 ms
[2023-04-07 02:36:25] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:36:25] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 02:36:25] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 02:36:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 02:36:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:36:27] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-07 02:36:27] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-04-07 02:36:28] [INFO ] After 1016ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-07 02:36:28] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 0 ms to minimize.
[2023-04-07 02:36:28] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2023-04-07 02:36:28] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 02:36:28] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-07 02:36:29] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-04-07 02:36:29] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-04-07 02:36:29] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:36:29] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:36:29] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 0 ms to minimize.
[2023-04-07 02:36:29] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1903 ms
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2023-04-07 02:36:30] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-04-07 02:36:31] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-07 02:36:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 880 ms
[2023-04-07 02:36:31] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2023-04-07 02:36:31] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-04-07 02:36:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2023-04-07 02:36:31] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-07 02:36:31] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-04-07 02:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-07 02:36:31] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2023-04-07 02:36:32] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2023-04-07 02:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2023-04-07 02:36:32] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-04-07 02:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-07 02:36:32] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:36:32] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2023-04-07 02:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2023-04-07 02:36:32] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2023-04-07 02:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-07 02:36:33] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-04-07 02:36:33] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:36:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2023-04-07 02:36:33] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2023-04-07 02:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 02:36:33] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-04-07 02:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 02:36:33] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2023-04-07 02:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-07 02:36:33] [INFO ] After 6781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 1161 ms.
[2023-04-07 02:36:35] [INFO ] After 9202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 170 ms.
Support contains 44 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2936/2936 transitions.
Applied a total of 0 rules in 103 ms. Remains 491 /491 variables (removed 0) and now considering 2936/2936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 491/491 places, 2936/2936 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 2936/2936 transitions.
Applied a total of 0 rules in 100 ms. Remains 491 /491 variables (removed 0) and now considering 2936/2936 (removed 0) transitions.
[2023-04-07 02:36:35] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
[2023-04-07 02:36:35] [INFO ] Invariant cache hit.
[2023-04-07 02:36:35] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-04-07 02:36:35] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
[2023-04-07 02:36:35] [INFO ] Invariant cache hit.
[2023-04-07 02:36:36] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-04-07 02:36:37] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2428 ms to find 0 implicit places.
[2023-04-07 02:36:38] [INFO ] Redundant transitions in 163 ms returned []
[2023-04-07 02:36:38] [INFO ] Flow matrix only has 857 transitions (discarded 2079 similar events)
[2023-04-07 02:36:38] [INFO ] Invariant cache hit.
[2023-04-07 02:36:38] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3535 ms. Remains : 491/491 places, 2936/2936 transitions.
Graph (trivial) has 2315 edges and 491 vertex of which 79 / 491 are part of one of the 9 SCC in 4 ms
Free SCC test removed 70 places
Drop transitions removed 267 transitions
Ensure Unique test removed 2040 transitions
Reduce isomorphic transitions removed 2307 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 421 transition count 548
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 340 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 165 place count 339 transition count 547
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 165 place count 339 transition count 532
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 200 place count 319 transition count 532
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 454 place count 192 transition count 405
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 494 place count 192 transition count 365
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 500 place count 189 transition count 367
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 504 place count 189 transition count 363
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 534 place count 189 transition count 333
Free-agglomeration rule applied 90 times.
Iterating global reduction 5 with 90 rules applied. Total rules applied 624 place count 189 transition count 243
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 5 with 90 rules applied. Total rules applied 714 place count 99 transition count 243
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 724 place count 99 transition count 243
Applied a total of 724 rules in 56 ms. Remains 99 /491 variables (removed 392) and now considering 243/2936 (removed 2693) transitions.
Running SMT prover for 20 properties.
// Phase 1: matrix 243 rows 99 cols
[2023-04-07 02:36:38] [INFO ] Computed 23 invariants in 3 ms
[2023-04-07 02:36:39] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:36:39] [INFO ] [Real]Absence check using 19 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 02:36:39] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 02:36:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:36:39] [INFO ] [Nat]Absence check using 19 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 02:36:39] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-07 02:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-07 02:36:39] [INFO ] After 178ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-07 02:36:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-04-07 02:36:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-04-07 02:36:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-04-07 02:36:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-04-07 02:36:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 148 ms
[2023-04-07 02:36:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-04-07 02:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-04-07 02:36:40] [INFO ] After 638ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-04-07 02:36:40] [INFO ] After 1117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
FORMULA EisenbergMcGuire-PT-09-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 206 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 02:36:40] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 02:36:40] [INFO ] Computed 28 invariants in 10 ms
[2023-04-07 02:36:41] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-04-07 02:36:41] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:36:41] [INFO ] Invariant cache hit.
[2023-04-07 02:36:41] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:36:46] [INFO ] Implicit Places using invariants and state equation in 5012 ms returned []
Implicit Place search using SMT with State Equation took 5552 ms to find 0 implicit places.
[2023-04-07 02:36:46] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:36:46] [INFO ] Invariant cache hit.
[2023-04-07 02:36:47] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6844 ms. Remains : 819/823 places, 3240/3276 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s91 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 314 steps with 0 reset in 6 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 7140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0) U ((X(!p0)&&(!p1||X(F(p2))))||X(G(!p0))))))'
Support contains 11 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 66 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2023-04-07 02:36:47] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-07 02:36:47] [INFO ] Computed 28 invariants in 13 ms
[2023-04-07 02:36:48] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-04-07 02:36:48] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:36:48] [INFO ] Invariant cache hit.
[2023-04-07 02:36:48] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:36:52] [INFO ] Implicit Places using invariants and state equation in 4590 ms returned []
Implicit Place search using SMT with State Equation took 5062 ms to find 0 implicit places.
[2023-04-07 02:36:52] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:36:52] [INFO ] Invariant cache hit.
[2023-04-07 02:36:53] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6150 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 284 ms :[p0, p0, p0, (AND p0 (NOT p2)), true, (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s51 1)), p0:(OR (AND (EQ s4 1) (EQ s21 1) (EQ s606 1)) (AND (EQ s3 1) (EQ s20 1) (EQ s557 1))), p2:(AND (EQ s2 1) (EQ s16 1) (EQ s61...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 718 ms.
Product exploration explored 100000 steps with 33333 reset in 633 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-02 finished in 7862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p1)&&p0) U ((p2||X(X(X(!p1)))) U p1))))'
Support contains 7 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 821 transition count 3258
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 821 transition count 3258
Applied a total of 4 rules in 44 ms. Remains 821 /823 variables (removed 2) and now considering 3258/3276 (removed 18) transitions.
[2023-04-07 02:36:55] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
// Phase 1: matrix 1179 rows 821 cols
[2023-04-07 02:36:55] [INFO ] Computed 28 invariants in 11 ms
[2023-04-07 02:36:56] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-04-07 02:36:56] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:36:56] [INFO ] Invariant cache hit.
[2023-04-07 02:36:56] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-07 02:37:00] [INFO ] Implicit Places using invariants and state equation in 4795 ms returned []
Implicit Place search using SMT with State Equation took 5282 ms to find 0 implicit places.
[2023-04-07 02:37:00] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:37:00] [INFO ] Invariant cache hit.
[2023-04-07 02:37:01] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 821/823 places, 3258/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6321 ms. Remains : 821/823 places, 3258/3276 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), p1, (NOT p1), p1, p1, true]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s29 1) (EQ s590 1)), p0:(AND (EQ s7 1) (EQ s208 1)), p2:(AND (EQ s0 1) (EQ s207 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16646 reset in 566 ms.
Product exploration explored 100000 steps with 16593 reset in 547 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 122 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, true, p1, (NOT p1), p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253590 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253590 steps, saw 190300 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 02:37:06] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:37:06] [INFO ] Invariant cache hit.
[2023-04-07 02:37:07] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2023-04-07 02:37:07] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 02:37:07] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:37:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2023-04-07 02:37:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 02:37:08] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:08] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-07 02:37:08] [INFO ] After 223ms SMT Verify possible using 372 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:08] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 0 ms to minimize.
[2023-04-07 02:37:08] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 1 ms to minimize.
[2023-04-07 02:37:09] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-04-07 02:37:09] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2023-04-07 02:37:09] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 1 ms to minimize.
[2023-04-07 02:37:09] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 1 ms to minimize.
[2023-04-07 02:37:10] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-07 02:37:10] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 1 ms to minimize.
[2023-04-07 02:37:10] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 0 ms to minimize.
[2023-04-07 02:37:10] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 0 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 0 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2023-04-07 02:37:11] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3394 ms
[2023-04-07 02:37:11] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2023-04-07 02:37:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-04-07 02:37:12] [INFO ] After 3991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-04-07 02:37:12] [INFO ] After 4714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 5 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 3258/3258 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 821 transition count 3249
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 812 transition count 3249
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 812 transition count 2997
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 560 transition count 2997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 523 place count 559 transition count 2988
Iterating global reduction 2 with 1 rules applied. Total rules applied 524 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 668 place count 487 transition count 2916
Applied a total of 668 rules in 207 ms. Remains 487 /821 variables (removed 334) and now considering 2916/3258 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 487/821 places, 2916/3258 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 290110 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 290110 steps, saw 183440 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 02:37:15] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2023-04-07 02:37:15] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 02:37:15] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:37:15] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:37:15] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:37:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:37:15] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 02:37:16] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:16] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:37:16] [INFO ] After 143ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:16] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2023-04-07 02:37:16] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2023-04-07 02:37:17] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2023-04-07 02:37:17] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-04-07 02:37:17] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 1 ms to minimize.
[2023-04-07 02:37:17] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2023-04-07 02:37:17] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2023-04-07 02:37:17] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2049 ms
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-04-07 02:37:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 370 ms
[2023-04-07 02:37:18] [INFO ] After 2665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-04-07 02:37:19] [INFO ] After 3181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 92 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 91 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2023-04-07 02:37:19] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2023-04-07 02:37:19] [INFO ] Invariant cache hit.
[2023-04-07 02:37:19] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-04-07 02:37:19] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2023-04-07 02:37:19] [INFO ] Invariant cache hit.
[2023-04-07 02:37:19] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:37:21] [INFO ] Implicit Places using invariants and state equation in 2307 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
[2023-04-07 02:37:22] [INFO ] Redundant transitions in 143 ms returned []
[2023-04-07 02:37:22] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2023-04-07 02:37:22] [INFO ] Invariant cache hit.
[2023-04-07 02:37:22] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3809 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 80 / 487 are part of one of the 9 SCC in 2 ms
Free SCC test removed 71 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2023 transitions
Reduce isomorphic transitions removed 2298 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 416 transition count 521
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 319 transition count 521
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 319 transition count 503
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 293 transition count 503
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 150 transition count 360
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 150 transition count 290
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 142 transition count 291
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 620 place count 142 transition count 282
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 631 place count 142 transition count 271
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 142 transition count 198
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 69 transition count 198
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 69 transition count 198
Applied a total of 786 rules in 29 ms. Remains 69 /487 variables (removed 418) and now considering 198/2916 (removed 2718) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 69 cols
[2023-04-07 02:37:23] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 02:37:23] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:37:23] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 02:37:23] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:37:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:37:23] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 02:37:23] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 02:37:23] [INFO ] After 15ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:23] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 02:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-07 02:37:23] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-07 02:37:23] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 02:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2023-04-07 02:37:23] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 02:37:23] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 134 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, true, p1, (NOT p1), p1, p1, true]
Stuttering acceptance computed with spot in 272 ms :[true, true, p1, (NOT p1), p1, p1, true]
[2023-04-07 02:37:24] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
// Phase 1: matrix 1179 rows 821 cols
[2023-04-07 02:37:24] [INFO ] Computed 28 invariants in 11 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [true]
Knowledge based reduction with 10 factoid took 161 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, true, p1, (NOT p1), p1, p1, true]
Support contains 5 out of 821 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 821/821 places, 3258/3258 transitions.
Applied a total of 0 rules in 18 ms. Remains 821 /821 variables (removed 0) and now considering 3258/3258 (removed 0) transitions.
[2023-04-07 02:37:25] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:37:25] [INFO ] Invariant cache hit.
[2023-04-07 02:37:25] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-04-07 02:37:25] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:37:25] [INFO ] Invariant cache hit.
[2023-04-07 02:37:25] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-07 02:37:30] [INFO ] Implicit Places using invariants and state equation in 4500 ms returned []
Implicit Place search using SMT with State Equation took 5001 ms to find 0 implicit places.
[2023-04-07 02:37:30] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:37:30] [INFO ] Invariant cache hit.
[2023-04-07 02:37:31] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6056 ms. Remains : 821/821 places, 3258/3258 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[true, true, p1, (NOT p1), p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 271820 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271820 steps, saw 203610 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 02:37:34] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
[2023-04-07 02:37:34] [INFO ] Invariant cache hit.
[2023-04-07 02:37:34] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2023-04-07 02:37:34] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 02:37:35] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:37:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 25 ms returned sat
[2023-04-07 02:37:35] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 02:37:35] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:35] [INFO ] State equation strengthened by 372 read => feed constraints.
[2023-04-07 02:37:35] [INFO ] After 237ms SMT Verify possible using 372 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:36] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 0 ms to minimize.
[2023-04-07 02:37:36] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2023-04-07 02:37:36] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 0 ms to minimize.
[2023-04-07 02:37:37] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 0 ms to minimize.
[2023-04-07 02:37:37] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 1 ms to minimize.
[2023-04-07 02:37:37] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 0 ms to minimize.
[2023-04-07 02:37:37] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-04-07 02:37:38] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 0 ms to minimize.
[2023-04-07 02:37:38] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 0 ms to minimize.
[2023-04-07 02:37:38] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2023-04-07 02:37:38] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:37:38] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
[2023-04-07 02:37:38] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:37:39] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:37:39] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2023-04-07 02:37:39] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:37:39] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3387 ms
[2023-04-07 02:37:39] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
[2023-04-07 02:37:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-04-07 02:37:39] [INFO ] After 4008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-04-07 02:37:39] [INFO ] After 4733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 3258/3258 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 821 transition count 3249
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 812 transition count 3249
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 812 transition count 2997
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 560 transition count 2997
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 523 place count 559 transition count 2988
Iterating global reduction 2 with 1 rules applied. Total rules applied 524 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 668 place count 487 transition count 2916
Applied a total of 668 rules in 151 ms. Remains 487 /821 variables (removed 334) and now considering 2916/3258 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 487/821 places, 2916/3258 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 252640 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252640 steps, saw 162217 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 02:37:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2023-04-07 02:37:43] [INFO ] Computed 28 invariants in 17 ms
[2023-04-07 02:37:43] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:37:43] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:37:43] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:37:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2023-04-07 02:37:43] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:37:43] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:43] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:37:44] [INFO ] After 138ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:44] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 1 ms to minimize.
[2023-04-07 02:37:44] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-07 02:37:44] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 02:37:44] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-04-07 02:37:45] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-04-07 02:37:46] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-04-07 02:37:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2081 ms
[2023-04-07 02:37:46] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-04-07 02:37:46] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2023-04-07 02:37:46] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:37:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2023-04-07 02:37:46] [INFO ] After 2693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-04-07 02:37:46] [INFO ] After 3212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 86 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 102 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2023-04-07 02:37:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2023-04-07 02:37:46] [INFO ] Invariant cache hit.
[2023-04-07 02:37:47] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-04-07 02:37:47] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2023-04-07 02:37:47] [INFO ] Invariant cache hit.
[2023-04-07 02:37:47] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:37:49] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 2701 ms to find 0 implicit places.
[2023-04-07 02:37:49] [INFO ] Redundant transitions in 73 ms returned []
[2023-04-07 02:37:49] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2023-04-07 02:37:49] [INFO ] Invariant cache hit.
[2023-04-07 02:37:50] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3752 ms. Remains : 487/487 places, 2916/2916 transitions.
Graph (trivial) has 2700 edges and 487 vertex of which 80 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2023 transitions
Reduce isomorphic transitions removed 2298 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 416 transition count 521
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 319 transition count 521
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 319 transition count 503
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 293 transition count 503
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 150 transition count 360
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 150 transition count 290
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 142 transition count 291
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 620 place count 142 transition count 282
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 631 place count 142 transition count 271
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 142 transition count 198
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 69 transition count 198
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 69 transition count 198
Applied a total of 786 rules in 23 ms. Remains 69 /487 variables (removed 418) and now considering 198/2916 (removed 2718) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 198 rows 69 cols
[2023-04-07 02:37:50] [INFO ] Computed 20 invariants in 1 ms
[2023-04-07 02:37:50] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:37:50] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 02:37:50] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 02:37:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:37:50] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 02:37:50] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 02:37:50] [INFO ] After 19ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 02:37:50] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-07 02:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-04-07 02:37:50] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 02:37:50] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-07 02:37:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2023-04-07 02:37:50] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 02:37:50] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[true, true, p1, (NOT p1), p1, p1, true]
Stuttering acceptance computed with spot in 273 ms :[true, true, p1, (NOT p1), p1, p1, true]
[2023-04-07 02:37:51] [INFO ] Flow matrix only has 1179 transitions (discarded 2079 similar events)
// Phase 1: matrix 1179 rows 821 cols
[2023-04-07 02:37:51] [INFO ] Computed 28 invariants in 9 ms
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [true]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[true, true, p1, (NOT p1), p1, p1, true]
Stuttering acceptance computed with spot in 260 ms :[true, true, p1, (NOT p1), p1, p1, true]
Product exploration explored 100000 steps with 16638 reset in 536 ms.
Stack based approach found an accepted trace after 1367 steps with 236 reset with depth 6 and stack size 6 in 8 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-03 finished in 57861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0)) U (p1||F(p2)))))'
Support contains 8 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 218 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2023-04-07 02:37:53] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 02:37:53] [INFO ] Computed 28 invariants in 8 ms
[2023-04-07 02:37:54] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-04-07 02:37:54] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:37:54] [INFO ] Invariant cache hit.
[2023-04-07 02:37:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:37:56] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
[2023-04-07 02:37:56] [INFO ] Redundant transitions in 73 ms returned []
[2023-04-07 02:37:56] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:37:56] [INFO ] Invariant cache hit.
[2023-04-07 02:37:57] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3789 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-04 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 p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s32 1) (EQ s216 1)), p2:(AND (EQ s7 1) (EQ s31 1) (EQ s313 1)), p0:(AND (EQ s6 1) (EQ s29 1) (EQ s307 1) (EQ s32 1) (EQ s216 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 275 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 4237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 157 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2023-04-07 02:37:57] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 02:37:57] [INFO ] Computed 28 invariants in 6 ms
[2023-04-07 02:37:58] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-04-07 02:37:58] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:37:58] [INFO ] Invariant cache hit.
[2023-04-07 02:37:58] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:38:00] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 2932 ms to find 0 implicit places.
[2023-04-07 02:38:00] [INFO ] Redundant transitions in 70 ms returned []
[2023-04-07 02:38:00] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:00] [INFO ] Invariant cache hit.
[2023-04-07 02:38:01] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3967 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 267 ms.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 348 ms. (steps per millisecond=156 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 349 ms. (steps per millisecond=155 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 98 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2023-04-07 02:38:03] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:03] [INFO ] Invariant cache hit.
[2023-04-07 02:38:03] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-04-07 02:38:03] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:03] [INFO ] Invariant cache hit.
[2023-04-07 02:38:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:38:06] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2023-04-07 02:38:06] [INFO ] Redundant transitions in 66 ms returned []
[2023-04-07 02:38:06] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:06] [INFO ] Invariant cache hit.
[2023-04-07 02:38:07] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4129 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 347 ms. (steps per millisecond=156 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 347 ms. (steps per millisecond=156 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 275 ms.
Product exploration explored 100000 steps with 0 reset in 335 ms.
Built C files in :
/tmp/ltsmin4066522434283417620
[2023-04-07 02:38:08] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:38:08] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4066522434283417620
Running compilation step : cd /tmp/ltsmin4066522434283417620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4066522434283417620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4066522434283417620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 88 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2023-04-07 02:38:11] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:11] [INFO ] Invariant cache hit.
[2023-04-07 02:38:12] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-04-07 02:38:12] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:12] [INFO ] Invariant cache hit.
[2023-04-07 02:38:12] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:38:14] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned []
Implicit Place search using SMT with State Equation took 3320 ms to find 0 implicit places.
[2023-04-07 02:38:15] [INFO ] Redundant transitions in 76 ms returned []
[2023-04-07 02:38:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2023-04-07 02:38:15] [INFO ] Invariant cache hit.
[2023-04-07 02:38:15] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4283 ms. Remains : 487/487 places, 2908/2908 transitions.
Built C files in :
/tmp/ltsmin8808911007311592552
[2023-04-07 02:38:15] [INFO ] Too many transitions (2908) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:38:15] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8808911007311592552
Running compilation step : cd /tmp/ltsmin8808911007311592552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8808911007311592552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8808911007311592552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-04-07 02:38:19] [INFO ] Flatten gal took : 107 ms
[2023-04-07 02:38:19] [INFO ] Flatten gal took : 113 ms
[2023-04-07 02:38:19] [INFO ] Time to serialize gal into /tmp/LTL18417117827281661885.gal : 20 ms
[2023-04-07 02:38:19] [INFO ] Time to serialize properties into /tmp/LTL12022773873475404814.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18417117827281661885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4820258886361048042.hoa' '-atoms' '/tmp/LTL12022773873475404814.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12022773873475404814.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4820258886361048042.hoa
Detected timeout of ITS tools.
[2023-04-07 02:38:34] [INFO ] Flatten gal took : 85 ms
[2023-04-07 02:38:34] [INFO ] Flatten gal took : 86 ms
[2023-04-07 02:38:34] [INFO ] Time to serialize gal into /tmp/LTL14978787719161970111.gal : 14 ms
[2023-04-07 02:38:34] [INFO ] Time to serialize properties into /tmp/LTL12819705725553682963.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14978787719161970111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12819705725553682963.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p34_2_6!=1)"))))
Formula 0 simplified : GF!"(p34_2_6!=1)"
Detected timeout of ITS tools.
[2023-04-07 02:38:49] [INFO ] Flatten gal took : 82 ms
[2023-04-07 02:38:49] [INFO ] Applying decomposition
[2023-04-07 02:38:49] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11474270673479827245.txt' '-o' '/tmp/graph11474270673479827245.bin' '-w' '/tmp/graph11474270673479827245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11474270673479827245.bin' '-l' '-1' '-v' '-w' '/tmp/graph11474270673479827245.weights' '-q' '0' '-e' '0.001'
[2023-04-07 02:38:50] [INFO ] Decomposing Gal with order
[2023-04-07 02:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 02:38:50] [INFO ] Removed a total of 6340 redundant transitions.
[2023-04-07 02:38:50] [INFO ] Flatten gal took : 449 ms
[2023-04-07 02:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 653 labels/synchronizations in 119 ms.
[2023-04-07 02:38:50] [INFO ] Time to serialize gal into /tmp/LTL2482599480328007554.gal : 21 ms
[2023-04-07 02:38:50] [INFO ] Time to serialize properties into /tmp/LTL15197939978276317750.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2482599480328007554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15197939978276317750.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u28.p34_2_6!=1)"))))
Formula 0 simplified : GF!"(i0.u28.p34_2_6!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15411321058847904329
[2023-04-07 02:39:05] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15411321058847904329
Running compilation step : cd /tmp/ltsmin15411321058847904329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15411321058847904329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin15411321058847904329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 EisenbergMcGuire-PT-09-LTLFireability-05 finished in 71352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 36 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2023-04-07 02:39:09] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2023-04-07 02:39:09] [INFO ] Computed 28 invariants in 9 ms
[2023-04-07 02:39:09] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-04-07 02:39:09] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:39:09] [INFO ] Invariant cache hit.
[2023-04-07 02:39:09] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:13] [INFO ] Implicit Places using invariants and state equation in 4167 ms returned []
Implicit Place search using SMT with State Equation took 4707 ms to find 0 implicit places.
[2023-04-07 02:39:13] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:39:13] [INFO ] Invariant cache hit.
[2023-04-07 02:39:14] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5692 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 559 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s165 0)), p2:(OR (EQ s6 0) (EQ s207 0)), p1:(OR (EQ s32 0) (EQ s165 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 51 reset in 250 ms.
Product exploration explored 100000 steps with 51 reset in 314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 80 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:39:16] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2023-04-07 02:39:16] [INFO ] Invariant cache hit.
[2023-04-07 02:39:16] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:39:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-04-07 02:39:16] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 02:39:16] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:16] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:16] [INFO ] After 158ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:17] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 1 ms to minimize.
[2023-04-07 02:39:17] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-07 02:39:17] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 1 ms to minimize.
[2023-04-07 02:39:17] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 1 ms to minimize.
[2023-04-07 02:39:17] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2023-04-07 02:39:18] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 0 ms to minimize.
[2023-04-07 02:39:18] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 0 ms to minimize.
[2023-04-07 02:39:18] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 1 ms to minimize.
[2023-04-07 02:39:18] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2023-04-07 02:39:19] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 0 ms to minimize.
[2023-04-07 02:39:19] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2023-04-07 02:39:19] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-04-07 02:39:19] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 02:39:19] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-04-07 02:39:19] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2901 ms
[2023-04-07 02:39:19] [INFO ] After 3134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-04-07 02:39:19] [INFO ] After 3654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 133 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 488/820 places, 2917/3249 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 460600 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 460600 steps, saw 279966 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:39:22] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:39:22] [INFO ] Computed 28 invariants in 6 ms
[2023-04-07 02:39:23] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:39:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:39:23] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:39:23] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:23] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:23] [INFO ] After 110ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:23] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2023-04-07 02:39:23] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 02:39:23] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2023-04-07 02:39:24] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-04-07 02:39:25] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:39:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 02:39:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1685 ms
[2023-04-07 02:39:25] [INFO ] After 1850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 02:39:25] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 85 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 85 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:39:25] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:25] [INFO ] Invariant cache hit.
[2023-04-07 02:39:25] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-04-07 02:39:25] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:25] [INFO ] Invariant cache hit.
[2023-04-07 02:39:26] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:28] [INFO ] Implicit Places using invariants and state equation in 2381 ms returned []
Implicit Place search using SMT with State Equation took 2842 ms to find 0 implicit places.
[2023-04-07 02:39:28] [INFO ] Redundant transitions in 67 ms returned []
[2023-04-07 02:39:28] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:28] [INFO ] Invariant cache hit.
[2023-04-07 02:39:29] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3887 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 28 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 02:39:29] [INFO ] Computed 21 invariants in 1 ms
[2023-04-07 02:39:29] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:39:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:39:29] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 02:39:29] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 02:39:29] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:29] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-07 02:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-04-07 02:39:29] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 02:39:29] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 804 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 137 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2023-04-07 02:39:30] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:39:30] [INFO ] Computed 28 invariants in 6 ms
[2023-04-07 02:39:31] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-04-07 02:39:31] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:31] [INFO ] Invariant cache hit.
[2023-04-07 02:39:31] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:33] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned []
Implicit Place search using SMT with State Equation took 2850 ms to find 0 implicit places.
[2023-04-07 02:39:33] [INFO ] Redundant transitions in 75 ms returned []
[2023-04-07 02:39:33] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:33] [INFO ] Invariant cache hit.
[2023-04-07 02:39:34] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/820 places, 2917/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3921 ms. Remains : 488/820 places, 2917/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:39:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:34] [INFO ] Invariant cache hit.
[2023-04-07 02:39:34] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:39:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:39:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:39:35] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:35] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:35] [INFO ] After 112ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:35] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-07 02:39:35] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2023-04-07 02:39:35] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 02:39:35] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 0 ms to minimize.
[2023-04-07 02:39:35] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 02:39:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1589 ms
[2023-04-07 02:39:36] [INFO ] After 1745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 02:39:36] [INFO ] After 2099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 87 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 445520 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445520 steps, saw 271590 distinct states, run finished after 3004 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:39:39] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:39] [INFO ] Invariant cache hit.
[2023-04-07 02:39:40] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:39:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:39:40] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2023-04-07 02:39:40] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:40] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:40] [INFO ] After 106ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:40] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2023-04-07 02:39:40] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2023-04-07 02:39:40] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2023-04-07 02:39:41] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-04-07 02:39:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 02:39:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1610 ms
[2023-04-07 02:39:42] [INFO ] After 1757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 02:39:42] [INFO ] After 2097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:39:42] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:42] [INFO ] Invariant cache hit.
[2023-04-07 02:39:42] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-04-07 02:39:42] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:42] [INFO ] Invariant cache hit.
[2023-04-07 02:39:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:45] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 2847 ms to find 0 implicit places.
[2023-04-07 02:39:45] [INFO ] Redundant transitions in 74 ms returned []
[2023-04-07 02:39:45] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:45] [INFO ] Invariant cache hit.
[2023-04-07 02:39:46] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3821 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 20 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 02:39:46] [INFO ] Computed 21 invariants in 6 ms
[2023-04-07 02:39:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:39:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:39:46] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 02:39:46] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 02:39:46] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:39:46] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 02:39:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-04-07 02:39:46] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 02:39:46] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 91 reset in 279 ms.
Product exploration explored 100000 steps with 90 reset in 286 ms.
Built C files in :
/tmp/ltsmin61046750990206869
[2023-04-07 02:39:47] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:39:47] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin61046750990206869
Running compilation step : cd /tmp/ltsmin61046750990206869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin61046750990206869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin61046750990206869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 93 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:39:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:39:50] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 02:39:50] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-04-07 02:39:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:50] [INFO ] Invariant cache hit.
[2023-04-07 02:39:51] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:39:53] [INFO ] Implicit Places using invariants and state equation in 2371 ms returned []
Implicit Place search using SMT with State Equation took 2827 ms to find 0 implicit places.
[2023-04-07 02:39:53] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 02:39:53] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:39:53] [INFO ] Invariant cache hit.
[2023-04-07 02:39:54] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3779 ms. Remains : 488/488 places, 2917/2917 transitions.
Built C files in :
/tmp/ltsmin21732298475811545
[2023-04-07 02:39:54] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:39:54] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin21732298475811545
Running compilation step : cd /tmp/ltsmin21732298475811545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin21732298475811545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin21732298475811545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-04-07 02:39:57] [INFO ] Flatten gal took : 86 ms
[2023-04-07 02:39:57] [INFO ] Flatten gal took : 73 ms
[2023-04-07 02:39:57] [INFO ] Time to serialize gal into /tmp/LTL4966397982457643822.gal : 17 ms
[2023-04-07 02:39:57] [INFO ] Time to serialize properties into /tmp/LTL1349279957278469770.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4966397982457643822.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2381616923380618258.hoa' '-atoms' '/tmp/LTL1349279957278469770.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1349279957278469770.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2381616923380618258.hoa
Detected timeout of ITS tools.
[2023-04-07 02:40:12] [INFO ] Flatten gal took : 65 ms
[2023-04-07 02:40:12] [INFO ] Flatten gal took : 67 ms
[2023-04-07 02:40:12] [INFO ] Time to serialize gal into /tmp/LTL9356357779140887093.gal : 9 ms
[2023-04-07 02:40:12] [INFO ] Time to serialize properties into /tmp/LTL5818506609842718065.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9356357779140887093.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5818506609842718065.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_7_active==0)||(p09_3_7==0))")||(F((X("((flag_7_active==0)||(p09_3_7==0))"))||(G("((turn_6==0)||(p10_1_2==0))"))))))))
Formula 0 simplified : XF(!"((flag_7_active==0)||(p09_3_7==0))" & G(X!"((flag_7_active==0)||(p09_3_7==0))" & F!"((turn_6==0)||(p10_1_2==0))"))
Detected timeout of ITS tools.
[2023-04-07 02:40:27] [INFO ] Flatten gal took : 70 ms
[2023-04-07 02:40:27] [INFO ] Applying decomposition
[2023-04-07 02:40:27] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4645596193441380319.txt' '-o' '/tmp/graph4645596193441380319.bin' '-w' '/tmp/graph4645596193441380319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4645596193441380319.bin' '-l' '-1' '-v' '-w' '/tmp/graph4645596193441380319.weights' '-q' '0' '-e' '0.001'
[2023-04-07 02:40:27] [INFO ] Decomposing Gal with order
[2023-04-07 02:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 02:40:28] [INFO ] Removed a total of 6350 redundant transitions.
[2023-04-07 02:40:28] [INFO ] Flatten gal took : 170 ms
[2023-04-07 02:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 612 labels/synchronizations in 66 ms.
[2023-04-07 02:40:28] [INFO ] Time to serialize gal into /tmp/LTL11716931227777648879.gal : 15 ms
[2023-04-07 02:40:28] [INFO ] Time to serialize properties into /tmp/LTL17344618389537474684.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11716931227777648879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17344618389537474684.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i3.u5.flag_7_active==0)||(i13.u12.p09_3_7==0))")||(F((X("((i3.u5.flag_7_active==0)||(i13.u12.p09_3_7==0))"))||(G("((i2.u3.t...192
Formula 0 simplified : XF(!"((i3.u5.flag_7_active==0)||(i13.u12.p09_3_7==0))" & G(X!"((i3.u5.flag_7_active==0)||(i13.u12.p09_3_7==0))" & F!"((i2.u3.turn_6=...180
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8830361691362456319
[2023-04-07 02:40:43] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8830361691362456319
Running compilation step : cd /tmp/ltsmin8830361691362456319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8830361691362456319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8830361691362456319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 EisenbergMcGuire-PT-09-LTLFireability-07 finished in 97529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||(!p1 U (p2||G(!p1)))))||(p0&&F(p3))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 164 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2023-04-07 02:40:46] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-07 02:40:46] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 02:40:47] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-04-07 02:40:47] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:40:47] [INFO ] Invariant cache hit.
[2023-04-07 02:40:47] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:40:49] [INFO ] Implicit Places using invariants and state equation in 2382 ms returned []
Implicit Place search using SMT with State Equation took 2819 ms to find 0 implicit places.
[2023-04-07 02:40:49] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 02:40:49] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:40:49] [INFO ] Invariant cache hit.
[2023-04-07 02:40:50] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3901 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s290 1), p2:(AND (NOT (AND (EQ s6 1) (EQ s27 1) (EQ s300 1))) (NOT (AND (EQ s15 1) (EQ s217 1)))), p1:(AND (EQ s15 1) (EQ s217 1)), p3:(OR (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Product exploration explored 100000 steps with 0 reset in 362 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 128 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 191950 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191950 steps, saw 126093 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 10 properties.
[2023-04-07 02:40:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:40:55] [INFO ] Invariant cache hit.
[2023-04-07 02:40:55] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 02:40:55] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:40:55] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-04-07 02:40:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:40:55] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 02:40:55] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :3
[2023-04-07 02:40:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:40:56] [INFO ] After 198ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :7 sat :3
[2023-04-07 02:40:56] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-04-07 02:40:56] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 1 ms to minimize.
[2023-04-07 02:40:56] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 0 ms to minimize.
[2023-04-07 02:40:56] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:40:57] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2023-04-07 02:40:58] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-07 02:40:58] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2023-04-07 02:40:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-07 02:40:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2154 ms
[2023-04-07 02:40:58] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 02:40:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 02:40:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-04-07 02:40:58] [INFO ] After 2740ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-04-07 02:40:58] [INFO ] After 3388ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :3
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 228160 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228160 steps, saw 147527 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 02:41:02] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:41:02] [INFO ] Invariant cache hit.
[2023-04-07 02:41:02] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:41:02] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:41:02] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:41:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 02:41:02] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:41:02] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:41:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:02] [INFO ] After 225ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 0 ms to minimize.
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2023-04-07 02:41:03] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1188 ms
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:41:04] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2023-04-07 02:41:05] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2023-04-07 02:41:05] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2023-04-07 02:41:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 607 ms
[2023-04-07 02:41:05] [INFO ] After 2483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-04-07 02:41:05] [INFO ] After 3078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 82 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2023-04-07 02:41:05] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:41:05] [INFO ] Invariant cache hit.
[2023-04-07 02:41:05] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-04-07 02:41:05] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:41:05] [INFO ] Invariant cache hit.
[2023-04-07 02:41:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:08] [INFO ] Implicit Places using invariants and state equation in 2230 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2023-04-07 02:41:08] [INFO ] Redundant transitions in 70 ms returned []
[2023-04-07 02:41:08] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:41:08] [INFO ] Invariant cache hit.
[2023-04-07 02:41:09] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3648 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2647 edges and 488 vertex of which 81 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 416 transition count 520
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 322 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 321 transition count 519
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 191 place count 321 transition count 500
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 238 place count 293 transition count 500
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 518 place count 153 transition count 360
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 583 place count 153 transition count 295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 595 place count 147 transition count 295
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 601 place count 147 transition count 289
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 610 place count 147 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 685 place count 147 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 760 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 769 place count 72 transition count 205
Applied a total of 769 rules in 24 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 205 rows 72 cols
[2023-04-07 02:41:09] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 02:41:09] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:41:09] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:41:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:41:09] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:41:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-07 02:41:09] [INFO ] After 47ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:41:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-07 02:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-04-07 02:41:09] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 02:41:09] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p3) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p3) (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (G (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 18 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-08 finished in 23003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 145 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2023-04-07 02:41:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 02:41:09] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 02:41:10] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-04-07 02:41:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:10] [INFO ] Invariant cache hit.
[2023-04-07 02:41:10] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:12] [INFO ] Implicit Places using invariants and state equation in 2426 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
[2023-04-07 02:41:12] [INFO ] Redundant transitions in 75 ms returned []
[2023-04-07 02:41:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:12] [INFO ] Invariant cache hit.
[2023-04-07 02:41:13] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3951 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s7 0) (EQ s30 0) (EQ s304 0)) (OR (NEQ s1 1) (NEQ s12 1) (NEQ s340 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Product exploration explored 100000 steps with 0 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 464330 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 464330 steps, saw 283459 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:41:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:17] [INFO ] Invariant cache hit.
[2023-04-07 02:41:17] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:41:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 02:41:17] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:41:17] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:17] [INFO ] After 89ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:17] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:41:18] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-04-07 02:41:18] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-07 02:41:18] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2023-04-07 02:41:18] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2023-04-07 02:41:18] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 1 ms to minimize.
[2023-04-07 02:41:18] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-04-07 02:41:19] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 02:41:20] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-04-07 02:41:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2370 ms
[2023-04-07 02:41:20] [INFO ] After 2505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 02:41:20] [INFO ] After 2830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469110 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469110 steps, saw 286289 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:41:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:23] [INFO ] Invariant cache hit.
[2023-04-07 02:41:23] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:41:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 02:41:23] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 02:41:23] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:23] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:23] [INFO ] After 90ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:23] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-04-07 02:41:24] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 0 ms to minimize.
[2023-04-07 02:41:24] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-04-07 02:41:24] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-07 02:41:24] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-04-07 02:41:24] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2023-04-07 02:41:24] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-04-07 02:41:25] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:41:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 02:41:26] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:41:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2363 ms
[2023-04-07 02:41:26] [INFO ] After 2497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 02:41:26] [INFO ] After 2835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 79 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 02:41:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:26] [INFO ] Invariant cache hit.
[2023-04-07 02:41:26] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-04-07 02:41:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:26] [INFO ] Invariant cache hit.
[2023-04-07 02:41:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:29] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
[2023-04-07 02:41:29] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 02:41:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:29] [INFO ] Invariant cache hit.
[2023-04-07 02:41:29] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3579 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 18 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2023-04-07 02:41:29] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 02:41:29] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:41:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:41:29] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-07 02:41:29] [INFO ] After 19ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:30] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 02:41:30] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 02:41:30] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2023-04-07 02:41:30] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 0 ms to minimize.
[2023-04-07 02:41:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 100 ms
[2023-04-07 02:41:30] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 02:41:30] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 02:41:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 02:41:30] [INFO ] Computed 28 invariants in 2 ms
[2023-04-07 02:41:30] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-04-07 02:41:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:30] [INFO ] Invariant cache hit.
[2023-04-07 02:41:30] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:33] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2023-04-07 02:41:33] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 02:41:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:33] [INFO ] Invariant cache hit.
[2023-04-07 02:41:33] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3633 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 473850 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473850 steps, saw 289015 distinct states, run finished after 3003 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:41:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:37] [INFO ] Invariant cache hit.
[2023-04-07 02:41:37] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:41:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 02:41:37] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:41:37] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:37] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:37] [INFO ] After 88ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:37] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-07 02:41:37] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2023-04-07 02:41:38] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-04-07 02:41:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2402 ms
[2023-04-07 02:41:39] [INFO ] After 2536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 02:41:40] [INFO ] After 2865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468310 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468310 steps, saw 285863 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:41:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:43] [INFO ] Invariant cache hit.
[2023-04-07 02:41:43] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:41:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:41:43] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 02:41:43] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:43] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:43] [INFO ] After 94ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:43] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:41:43] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-04-07 02:41:44] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-04-07 02:41:44] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 02:41:44] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-04-07 02:41:44] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2023-04-07 02:41:44] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-04-07 02:41:44] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-04-07 02:41:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2320 ms
[2023-04-07 02:41:45] [INFO ] After 2463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-04-07 02:41:45] [INFO ] After 2797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 79 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 02:41:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:46] [INFO ] Invariant cache hit.
[2023-04-07 02:41:46] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-04-07 02:41:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:46] [INFO ] Invariant cache hit.
[2023-04-07 02:41:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:48] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 2656 ms to find 0 implicit places.
[2023-04-07 02:41:48] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 02:41:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:48] [INFO ] Invariant cache hit.
[2023-04-07 02:41:49] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3584 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 18 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2023-04-07 02:41:49] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 02:41:49] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:41:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:41:49] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-07 02:41:49] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:41:49] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-07 02:41:49] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 02:41:49] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 02:41:49] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 02:41:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 98 ms
[2023-04-07 02:41:49] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-07 02:41:49] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Product exploration explored 100000 steps with 0 reset in 282 ms.
Built C files in :
/tmp/ltsmin4099349874065115063
[2023-04-07 02:41:50] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:41:50] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4099349874065115063
Running compilation step : cd /tmp/ltsmin4099349874065115063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4099349874065115063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4099349874065115063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 02:41:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 02:41:53] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 02:41:54] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-04-07 02:41:54] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:54] [INFO ] Invariant cache hit.
[2023-04-07 02:41:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:41:56] [INFO ] Implicit Places using invariants and state equation in 2258 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-04-07 02:41:56] [INFO ] Redundant transitions in 68 ms returned []
[2023-04-07 02:41:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 02:41:56] [INFO ] Invariant cache hit.
[2023-04-07 02:41:57] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3620 ms. Remains : 486/486 places, 2907/2907 transitions.
Built C files in :
/tmp/ltsmin3910790262813189414
[2023-04-07 02:41:57] [INFO ] Too many transitions (2907) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:41:57] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3910790262813189414
Running compilation step : cd /tmp/ltsmin3910790262813189414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3910790262813189414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin3910790262813189414;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-04-07 02:42:00] [INFO ] Flatten gal took : 63 ms
[2023-04-07 02:42:00] [INFO ] Flatten gal took : 62 ms
[2023-04-07 02:42:00] [INFO ] Time to serialize gal into /tmp/LTL12736452787456970400.gal : 9 ms
[2023-04-07 02:42:00] [INFO ] Time to serialize properties into /tmp/LTL474526391478799984.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12736452787456970400.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17325044833335157671.hoa' '-atoms' '/tmp/LTL474526391478799984.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL474526391478799984.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17325044833335157671.hoa
Detected timeout of ITS tools.
[2023-04-07 02:42:15] [INFO ] Flatten gal took : 62 ms
[2023-04-07 02:42:15] [INFO ] Flatten gal took : 65 ms
[2023-04-07 02:42:15] [INFO ] Time to serialize gal into /tmp/LTL6276450477166351301.gal : 9 ms
[2023-04-07 02:42:15] [INFO ] Time to serialize properties into /tmp/LTL13380739307857310545.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6276450477166351301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13380739307857310545.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((turn_7==0)||(flag_7_idle==0))||(p25_0_8==0))&&(((turn_1!=1)||(flag_1_idle!=1))||(p25_5_3!=1)))"))))
Formula 0 simplified : GF!"((((turn_7==0)||(flag_7_idle==0))||(p25_0_8==0))&&(((turn_1!=1)||(flag_1_idle!=1))||(p25_5_3!=1)))"
Detected timeout of ITS tools.
[2023-04-07 02:42:30] [INFO ] Flatten gal took : 60 ms
[2023-04-07 02:42:30] [INFO ] Applying decomposition
[2023-04-07 02:42:30] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12559515496174681627.txt' '-o' '/tmp/graph12559515496174681627.bin' '-w' '/tmp/graph12559515496174681627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12559515496174681627.bin' '-l' '-1' '-v' '-w' '/tmp/graph12559515496174681627.weights' '-q' '0' '-e' '0.001'
[2023-04-07 02:42:31] [INFO ] Decomposing Gal with order
[2023-04-07 02:42:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 02:42:31] [INFO ] Removed a total of 6303 redundant transitions.
[2023-04-07 02:42:31] [INFO ] Flatten gal took : 169 ms
[2023-04-07 02:42:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 661 labels/synchronizations in 53 ms.
[2023-04-07 02:42:31] [INFO ] Time to serialize gal into /tmp/LTL17983145894555102789.gal : 15 ms
[2023-04-07 02:42:31] [INFO ] Time to serialize properties into /tmp/LTL11188422085702219220.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17983145894555102789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11188422085702219220.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((((i15.u4.turn_7==0)||(i3.u6.flag_7_idle==0))||(i5.u0.p25_0_8==0))&&(((i1.u3.turn_1!=1)||(i5.u0.flag_1_idle!=1))||(i2.u5.p25_...169
Formula 0 simplified : GF!"((((i15.u4.turn_7==0)||(i3.u6.flag_7_idle==0))||(i5.u0.p25_0_8==0))&&(((i1.u3.turn_1!=1)||(i5.u0.flag_1_idle!=1))||(i2.u5.p25_5_...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9900945401054715655
[2023-04-07 02:42:46] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9900945401054715655
Running compilation step : cd /tmp/ltsmin9900945401054715655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9900945401054715655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9900945401054715655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 EisenbergMcGuire-PT-09-LTLFireability-09 finished in 99963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 30 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 02:42:49] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 02:42:49] [INFO ] Computed 28 invariants in 8 ms
[2023-04-07 02:42:49] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-04-07 02:42:49] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:42:49] [INFO ] Invariant cache hit.
[2023-04-07 02:42:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:42:54] [INFO ] Implicit Places using invariants and state equation in 4088 ms returned []
Implicit Place search using SMT with State Equation took 4567 ms to find 0 implicit places.
[2023-04-07 02:42:54] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:42:54] [INFO ] Invariant cache hit.
[2023-04-07 02:42:55] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5576 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s29 0) (EQ s581 0)), p1:(AND (EQ s2 1) (EQ s17 1) (EQ s553 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 5980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||(!p1&&G(!p2))) U p3)))'
Support contains 8 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 823 transition count 3268
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 815 transition count 3268
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 16 place count 815 transition count 3017
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 151 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2023-04-07 02:42:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-07 02:42:55] [INFO ] Computed 28 invariants in 5 ms
[2023-04-07 02:42:56] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-04-07 02:42:56] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:42:56] [INFO ] Invariant cache hit.
[2023-04-07 02:42:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:42:58] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2023-04-07 02:42:58] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 02:42:58] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:42:58] [INFO ] Invariant cache hit.
[2023-04-07 02:42:59] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3710 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p3), true, p2, (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p3 p0 (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s13 1) (EQ s135 1)), p0:(AND (EQ s0 1) (EQ s9 1) (EQ s362 1)), p1:(AND (EQ s13 1) (EQ s135 1) (EQ s5 1) (EQ s26 1) (EQ s364 1)), p2:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (OR p3 p0 (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (OR p3 p0 (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 132 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p3), true, p2, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 02:43:00] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:43:00] [INFO ] Invariant cache hit.
[2023-04-07 02:43:00] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 02:43:00] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:43:00] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:43:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 02:43:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 02:43:00] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:43:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:43:00] [INFO ] After 192ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:43:01] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2023-04-07 02:43:01] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-04-07 02:43:01] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-07 02:43:01] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2023-04-07 02:43:01] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 1 ms to minimize.
[2023-04-07 02:43:02] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 0 ms to minimize.
[2023-04-07 02:43:02] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 0 ms to minimize.
[2023-04-07 02:43:02] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2023-04-07 02:43:02] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2023-04-07 02:43:02] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2023-04-07 02:43:03] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2023-04-07 02:43:03] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2023-04-07 02:43:03] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 1 ms to minimize.
[2023-04-07 02:43:03] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 1 ms to minimize.
[2023-04-07 02:43:04] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 0 ms to minimize.
[2023-04-07 02:43:04] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 1 ms to minimize.
[2023-04-07 02:43:04] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 0 ms to minimize.
[2023-04-07 02:43:04] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 0 ms to minimize.
[2023-04-07 02:43:04] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4138 ms
[2023-04-07 02:43:05] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 0 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 529 ms
[2023-04-07 02:43:05] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-04-07 02:43:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-07 02:43:05] [INFO ] After 5167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-04-07 02:43:06] [INFO ] After 5738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 80 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 488/488 places, 2909/2909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 255940 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255940 steps, saw 164420 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 02:43:09] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:43:09] [INFO ] Invariant cache hit.
[2023-04-07 02:43:09] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:43:09] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 02:43:09] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:43:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-04-07 02:43:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:43:09] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:43:09] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:43:10] [INFO ] After 195ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:43:10] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2023-04-07 02:43:10] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-04-07 02:43:10] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-07 02:43:11] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-04-07 02:43:11] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 1 ms to minimize.
[2023-04-07 02:43:11] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-04-07 02:43:11] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2023-04-07 02:43:11] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-04-07 02:43:12] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-04-07 02:43:12] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-04-07 02:43:12] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 0 ms to minimize.
[2023-04-07 02:43:12] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2023-04-07 02:43:12] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-04-07 02:43:13] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 1 ms to minimize.
[2023-04-07 02:43:13] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-04-07 02:43:13] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-04-07 02:43:13] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 1 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 0 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4148 ms
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2023-04-07 02:43:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 522 ms
[2023-04-07 02:43:15] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-07 02:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-07 02:43:15] [INFO ] After 5160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-04-07 02:43:15] [INFO ] After 5743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 82 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2023-04-07 02:43:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:43:15] [INFO ] Invariant cache hit.
[2023-04-07 02:43:15] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-04-07 02:43:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:43:15] [INFO ] Invariant cache hit.
[2023-04-07 02:43:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:43:18] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 2666 ms to find 0 implicit places.
[2023-04-07 02:43:18] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 02:43:18] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2023-04-07 02:43:18] [INFO ] Invariant cache hit.
[2023-04-07 02:43:19] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3640 ms. Remains : 488/488 places, 2909/2909 transitions.
Graph (trivial) has 2674 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 417 transition count 520
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 320 transition count 520
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 320 transition count 502
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 294 transition count 502
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 523 place count 152 transition count 360
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 2 with 69 rules applied. Total rules applied 592 place count 152 transition count 291
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 606 place count 145 transition count 292
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 613 place count 145 transition count 285
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 620 place count 145 transition count 278
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 693 place count 145 transition count 205
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 766 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 775 place count 72 transition count 205
Applied a total of 775 rules in 21 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 205 rows 72 cols
[2023-04-07 02:43:19] [INFO ] Computed 20 invariants in 1 ms
[2023-04-07 02:43:19] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:43:19] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 02:43:19] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 02:43:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:43:19] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 02:43:19] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 02:43:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 02:43:19] [INFO ] After 37ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 02:43:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 02:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 02:43:19] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 02:43:19] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (OR p3 p0 (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (OR p3 p0 (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))]
Knowledge based reduction with 12 factoid took 171 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p3), true, p2, (NOT p3)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), true, p2, (NOT p3)]
[2023-04-07 02:43:19] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2023-04-07 02:43:19] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 02:43:20] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-04-07 02:43:20] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 17 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (OR p3 p0 (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2)))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (OR p3 p0 (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), true, (X (X (OR (AND (NOT p3) p0) (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) (NOT p0) p2))))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 12 factoid took 183 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 25613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 39 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 02:43:21] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2023-04-07 02:43:21] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 02:43:21] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-04-07 02:43:21] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:43:21] [INFO ] Invariant cache hit.
[2023-04-07 02:43:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:43:26] [INFO ] Implicit Places using invariants and state equation in 4885 ms returned []
Implicit Place search using SMT with State Equation took 5364 ms to find 0 implicit places.
[2023-04-07 02:43:26] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:43:26] [INFO ] Invariant cache hit.
[2023-04-07 02:43:27] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6362 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s33 1) (EQ s710 1)), p1:(AND (EQ s2 1) (EQ s16 1) (EQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-12 finished in 6505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((F(p2)&&p1)))))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 28 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2023-04-07 02:43:27] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:43:27] [INFO ] Invariant cache hit.
[2023-04-07 02:43:28] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-04-07 02:43:28] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:43:28] [INFO ] Invariant cache hit.
[2023-04-07 02:43:28] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 02:43:33] [INFO ] Implicit Places using invariants and state equation in 5344 ms returned []
Implicit Place search using SMT with State Equation took 5819 ms to find 0 implicit places.
[2023-04-07 02:43:33] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2023-04-07 02:43:33] [INFO ] Invariant cache hit.
[2023-04-07 02:43:34] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6810 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s10 1) (EQ s599 1)), p1:(AND (EQ s3 1) (EQ s20 1) (EQ s592 1)), p2:(AND (EQ s3 1) (EQ s20 1) (EQ s592 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 231 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 7161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-07
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 523 place count 560 transition count 2989
Iterating global reduction 2 with 3 rules applied. Total rules applied 526 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2917
Applied a total of 670 rules in 110 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2023-04-07 02:43:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:43:35] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 02:43:35] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-04-07 02:43:35] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:35] [INFO ] Invariant cache hit.
[2023-04-07 02:43:35] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:43:38] [INFO ] Implicit Places using invariants and state equation in 2469 ms returned []
Implicit Place search using SMT with State Equation took 2910 ms to find 0 implicit places.
[2023-04-07 02:43:38] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:38] [INFO ] Invariant cache hit.
[2023-04-07 02:43:38] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2917/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3818 ms. Remains : 488/823 places, 2917/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s135 0)), p2:(OR (EQ s6 0) (EQ s136 0)), p1:(OR (EQ s32 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 91 reset in 225 ms.
Product exploration explored 100000 steps with 91 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:43:39] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:39] [INFO ] Invariant cache hit.
[2023-04-07 02:43:39] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:43:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:43:39] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:43:40] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:40] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:43:40] [INFO ] After 123ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:40] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-07 02:43:40] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2023-04-07 02:43:40] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:43:40] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2023-04-07 02:43:40] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-04-07 02:43:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1668 ms
[2023-04-07 02:43:41] [INFO ] After 1835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 02:43:41] [INFO ] After 2170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 99 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 467320 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467320 steps, saw 282872 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:43:45] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:45] [INFO ] Invariant cache hit.
[2023-04-07 02:43:45] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:43:45] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-07 02:43:45] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 02:43:45] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:45] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:43:45] [INFO ] After 114ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:45] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2023-04-07 02:43:45] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 02:43:45] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2023-04-07 02:43:46] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2023-04-07 02:43:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2023-04-07 02:43:47] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-04-07 02:43:47] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1691 ms
[2023-04-07 02:43:47] [INFO ] After 1849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-04-07 02:43:47] [INFO ] After 2191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 80 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 79 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:43:47] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:47] [INFO ] Invariant cache hit.
[2023-04-07 02:43:47] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-04-07 02:43:47] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:47] [INFO ] Invariant cache hit.
[2023-04-07 02:43:48] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:43:50] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2023-04-07 02:43:50] [INFO ] Redundant transitions in 73 ms returned []
[2023-04-07 02:43:50] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:50] [INFO ] Invariant cache hit.
[2023-04-07 02:43:51] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3651 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 26 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 02:43:51] [INFO ] Computed 21 invariants in 1 ms
[2023-04-07 02:43:51] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:43:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-07 02:43:51] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 02:43:51] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 02:43:51] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:51] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-07 02:43:51] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 96 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:43:51] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:43:51] [INFO ] Computed 28 invariants in 4 ms
[2023-04-07 02:43:52] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-04-07 02:43:52] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:52] [INFO ] Invariant cache hit.
[2023-04-07 02:43:52] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:43:54] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
[2023-04-07 02:43:54] [INFO ] Redundant transitions in 71 ms returned []
[2023-04-07 02:43:54] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:54] [INFO ] Invariant cache hit.
[2023-04-07 02:43:55] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3699 ms. Remains : 488/488 places, 2917/2917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:43:55] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:43:55] [INFO ] Invariant cache hit.
[2023-04-07 02:43:55] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:43:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:43:55] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:43:55] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:55] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:43:55] [INFO ] After 122ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:43:56] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 02:43:56] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 02:43:56] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-07 02:43:56] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2023-04-07 02:43:56] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:43:56] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 0 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 1 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-04-07 02:43:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1710 ms
[2023-04-07 02:43:57] [INFO ] After 1872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 02:43:57] [INFO ] After 2212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 82 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 488/488 places, 2917/2917 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 467860 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467860 steps, saw 283122 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 02:44:00] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:44:00] [INFO ] Invariant cache hit.
[2023-04-07 02:44:00] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:44:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 02:44:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 02:44:01] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:44:01] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:44:01] [INFO ] After 118ms SMT Verify possible using 364 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:44:01] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-07 02:44:01] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-04-07 02:44:01] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 02:44:01] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-04-07 02:44:02] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-04-07 02:44:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1691 ms
[2023-04-07 02:44:03] [INFO ] After 1850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-04-07 02:44:03] [INFO ] After 2191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 79 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 79 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:44:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:44:03] [INFO ] Invariant cache hit.
[2023-04-07 02:44:03] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-04-07 02:44:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:44:03] [INFO ] Invariant cache hit.
[2023-04-07 02:44:03] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:44:05] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 2703 ms to find 0 implicit places.
[2023-04-07 02:44:06] [INFO ] Redundant transitions in 73 ms returned []
[2023-04-07 02:44:06] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:44:06] [INFO ] Invariant cache hit.
[2023-04-07 02:44:06] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3669 ms. Remains : 488/488 places, 2917/2917 transitions.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 18 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 71 cols
[2023-04-07 02:44:06] [INFO ] Computed 21 invariants in 2 ms
[2023-04-07 02:44:06] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 02:44:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-07 02:44:06] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-07 02:44:06] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 02:44:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 02:44:06] [INFO ] After 20ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 02:44:06] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-07 02:44:07] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 90 reset in 227 ms.
Product exploration explored 100000 steps with 91 reset in 252 ms.
Built C files in :
/tmp/ltsmin14374507373695878887
[2023-04-07 02:44:07] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:44:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14374507373695878887
Running compilation step : cd /tmp/ltsmin14374507373695878887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14374507373695878887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin14374507373695878887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 81 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2023-04-07 02:44:10] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2023-04-07 02:44:10] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 02:44:11] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-04-07 02:44:11] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:44:11] [INFO ] Invariant cache hit.
[2023-04-07 02:44:11] [INFO ] State equation strengthened by 364 read => feed constraints.
[2023-04-07 02:44:13] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2023-04-07 02:44:13] [INFO ] Redundant transitions in 70 ms returned []
[2023-04-07 02:44:13] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2023-04-07 02:44:13] [INFO ] Invariant cache hit.
[2023-04-07 02:44:14] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3569 ms. Remains : 488/488 places, 2917/2917 transitions.
Built C files in :
/tmp/ltsmin16937377622193539534
[2023-04-07 02:44:14] [INFO ] Too many transitions (2917) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:44:14] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16937377622193539534
Running compilation step : cd /tmp/ltsmin16937377622193539534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16937377622193539534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16937377622193539534;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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-04-07 02:44:17] [INFO ] Flatten gal took : 63 ms
[2023-04-07 02:44:17] [INFO ] Flatten gal took : 64 ms
[2023-04-07 02:44:17] [INFO ] Time to serialize gal into /tmp/LTL6838823823781710256.gal : 9 ms
[2023-04-07 02:44:17] [INFO ] Time to serialize properties into /tmp/LTL12446587083618695477.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6838823823781710256.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2438380260107109328.hoa' '-atoms' '/tmp/LTL12446587083618695477.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12446587083618695477.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2438380260107109328.hoa
Detected timeout of ITS tools.
[2023-04-07 02:44:32] [INFO ] Flatten gal took : 82 ms
[2023-04-07 02:44:32] [INFO ] Flatten gal took : 64 ms
[2023-04-07 02:44:32] [INFO ] Time to serialize gal into /tmp/LTL4526692850741487858.gal : 9 ms
[2023-04-07 02:44:32] [INFO ] Time to serialize properties into /tmp/LTL17612124653061174802.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4526692850741487858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17612124653061174802.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((flag_7_active==0)||(p09_3_7==0))")||(F((X("((flag_7_active==0)||(p09_3_7==0))"))||(G("((turn_6==0)||(p10_1_2==0))"))))))))
Formula 0 simplified : XF(!"((flag_7_active==0)||(p09_3_7==0))" & G(X!"((flag_7_active==0)||(p09_3_7==0))" & F!"((turn_6==0)||(p10_1_2==0))"))
Detected timeout of ITS tools.
[2023-04-07 02:44:48] [INFO ] Flatten gal took : 65 ms
[2023-04-07 02:44:48] [INFO ] Applying decomposition
[2023-04-07 02:44:48] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph878656668010016039.txt' '-o' '/tmp/graph878656668010016039.bin' '-w' '/tmp/graph878656668010016039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph878656668010016039.bin' '-l' '-1' '-v' '-w' '/tmp/graph878656668010016039.weights' '-q' '0' '-e' '0.001'
[2023-04-07 02:44:48] [INFO ] Decomposing Gal with order
[2023-04-07 02:44:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 02:44:48] [INFO ] Removed a total of 6302 redundant transitions.
[2023-04-07 02:44:48] [INFO ] Flatten gal took : 169 ms
[2023-04-07 02:44:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 664 labels/synchronizations in 53 ms.
[2023-04-07 02:44:48] [INFO ] Time to serialize gal into /tmp/LTL15784037103771054941.gal : 12 ms
[2023-04-07 02:44:48] [INFO ] Time to serialize properties into /tmp/LTL6646520581648693560.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15784037103771054941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6646520581648693560.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i2.u2.flag_7_active==0)||(u10.p09_3_7==0))")||(F((X("((i2.u2.flag_7_active==0)||(u10.p09_3_7==0))"))||(G("((i11.u77.turn_6=...185
Formula 0 simplified : XF(!"((i2.u2.flag_7_active==0)||(u10.p09_3_7==0))" & G(X!"((i2.u2.flag_7_active==0)||(u10.p09_3_7==0))" & F!"((i11.u77.turn_6==0)||(...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10459168581346280998
[2023-04-07 02:45:03] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10459168581346280998
Running compilation step : cd /tmp/ltsmin10459168581346280998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10459168581346280998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10459168581346280998;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 EisenbergMcGuire-PT-09-LTLFireability-07 finished in 91680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-04-07 02:45:06] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5273342619803412030
[2023-04-07 02:45:06] [INFO ] Too many transitions (3276) to apply POR reductions. Disabling POR matrices.
[2023-04-07 02:45:06] [INFO ] Applying decomposition
[2023-04-07 02:45:06] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5273342619803412030
Running compilation step : cd /tmp/ltsmin5273342619803412030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-07 02:45:06] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5199113363596728912.txt' '-o' '/tmp/graph5199113363596728912.bin' '-w' '/tmp/graph5199113363596728912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5199113363596728912.bin' '-l' '-1' '-v' '-w' '/tmp/graph5199113363596728912.weights' '-q' '0' '-e' '0.001'
[2023-04-07 02:45:07] [INFO ] Decomposing Gal with order
[2023-04-07 02:45:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 02:45:07] [INFO ] Removed a total of 6535 redundant transitions.
[2023-04-07 02:45:07] [INFO ] Flatten gal took : 174 ms
[2023-04-07 02:45:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 878 labels/synchronizations in 77 ms.
[2023-04-07 02:45:07] [INFO ] Time to serialize gal into /tmp/LTLFireability446049712440986351.gal : 14 ms
[2023-04-07 02:45:07] [INFO ] Time to serialize properties into /tmp/LTLFireability1839370800764458773.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability446049712440986351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1839370800764458773.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 3 LTL properties
Checking formula 0 : !((F(G("(i17.u202.p34_2_6!=1)"))))
Formula 0 simplified : GF!"(i17.u202.p34_2_6!=1)"
Compilation finished in 7486 ms.
Running link step : cd /tmp/ltsmin5273342619803412030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin5273342619803412030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin5273342619803412030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5273342619803412030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>((X((LTLAPp2==true))||[]((LTLAPp3==true))))||(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 03:08:16] [INFO ] Applying decomposition
[2023-04-07 03:08:16] [INFO ] Flatten gal took : 175 ms
[2023-04-07 03:08:16] [INFO ] Decomposing Gal with order
[2023-04-07 03:08:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 03:08:17] [INFO ] Removed a total of 7632 redundant transitions.
[2023-04-07 03:08:17] [INFO ] Flatten gal took : 515 ms
[2023-04-07 03:08:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 421 labels/synchronizations in 101 ms.
[2023-04-07 03:08:17] [INFO ] Time to serialize gal into /tmp/LTLFireability10421606601728668584.gal : 23 ms
[2023-04-07 03:08:17] [INFO ] Time to serialize properties into /tmp/LTLFireability5840406141647856442.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10421606601728668584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5840406141647856442.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((F(G("(i0.u23.p34_2_6!=1)"))))
Formula 0 simplified : GF!"(i0.u23.p34_2_6!=1)"
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin5273342619803412030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>((X((LTLAPp2==true))||[]((LTLAPp3==true))))||(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5273342619803412030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 03:31:29] [INFO ] Flatten gal took : 97 ms
[2023-04-07 03:31:29] [INFO ] Input system was already deterministic with 3276 transitions.
[2023-04-07 03:31:29] [INFO ] Transformed 823 places.
[2023-04-07 03:31:29] [INFO ] Transformed 3276 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-04-07 03:31:30] [INFO ] Time to serialize gal into /tmp/LTLFireability2473951935285859352.gal : 23 ms
[2023-04-07 03:31:30] [INFO ] Time to serialize properties into /tmp/LTLFireability534953651950685832.ltl : 8 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2473951935285859352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability534953651950685832.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(p34_2_6!=1)"))))
Formula 0 simplified : GF!"(p34_2_6!=1)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11778176 kB
After kill :
MemTotal: 16393232 kB
MemFree: 14833976 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r517-tall-167987243600268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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