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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.7M 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-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680831242403

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-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 01:34:03] [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 01:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:34:04] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2023-04-07 01:34:04] [INFO ] Transformed 712 places.
[2023-04-07 01:34:04] [INFO ] Transformed 2816 transitions.
[2023-04-07 01:34:04] [INFO ] Found NUPN structural information;
[2023-04-07 01:34:04] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 660 transition count 2400
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 660 transition count 2400
Applied a total of 104 rules in 114 ms. Remains 660 /712 variables (removed 52) and now considering 2400/2816 (removed 416) transitions.
[2023-04-07 01:34:04] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
// Phase 1: matrix 952 rows 660 cols
[2023-04-07 01:34:04] [INFO ] Computed 25 invariants in 28 ms
[2023-04-07 01:34:05] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-04-07 01:34:05] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-07 01:34:05] [INFO ] Invariant cache hit.
[2023-04-07 01:34:05] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 01:34:07] [INFO ] Implicit Places using invariants and state equation in 2194 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
[2023-04-07 01:34:07] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-07 01:34:07] [INFO ] Invariant cache hit.
[2023-04-07 01:34:08] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 660/712 places, 2400/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3797 ms. Remains : 660/712 places, 2400/2816 transitions.
Support contains 47 out of 660 places after structural reductions.
[2023-04-07 01:34:08] [INFO ] Flatten gal took : 163 ms
[2023-04-07 01:34:08] [INFO ] Flatten gal took : 106 ms
[2023-04-07 01:34:09] [INFO ] Input system was already deterministic with 2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 29) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-04-07 01:34:09] [INFO ] Flow matrix only has 952 transitions (discarded 1448 similar events)
[2023-04-07 01:34:09] [INFO ] Invariant cache hit.
[2023-04-07 01:34:11] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-04-07 01:34:11] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 11 ms returned sat
[2023-04-07 01:34:11] [INFO ] After 2184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-04-07 01:34:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-07 01:34:12] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:34:13] [INFO ] After 1099ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :21
[2023-04-07 01:34:13] [INFO ] State equation strengthened by 312 read => feed constraints.
[2023-04-07 01:34:14] [INFO ] After 1202ms SMT Verify possible using 312 Read/Feed constraints in natural domain returned unsat :1 sat :21
[2023-04-07 01:34:16] [INFO ] Deduced a trap composed of 3 places in 1740 ms of which 15 ms to minimize.
[2023-04-07 01:34:16] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-04-07 01:34:17] [INFO ] Deduced a trap composed of 63 places in 158 ms of which 1 ms to minimize.
[2023-04-07 01:34:17] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2023-04-07 01:34:17] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:34:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2548 ms
[2023-04-07 01:34:17] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 0 ms to minimize.
[2023-04-07 01:34:17] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-04-07 01:34:18] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-07 01:34:18] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-04-07 01:34:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 757 ms
[2023-04-07 01:34:18] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 01:34:18] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 01:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2023-04-07 01:34:18] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-04-07 01:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-07 01:34:19] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 1 ms to minimize.
[2023-04-07 01:34:19] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 0 ms to minimize.
[2023-04-07 01:34:19] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 0 ms to minimize.
[2023-04-07 01:34:19] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2023-04-07 01:34:19] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2023-04-07 01:34:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 902 ms
[2023-04-07 01:34:20] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 3 ms to minimize.
[2023-04-07 01:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-07 01:34:20] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-04-07 01:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-07 01:34:20] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2023-04-07 01:34:20] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2023-04-07 01:34:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-07 01:34:21] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-07 01:34:21] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2023-04-07 01:34:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-04-07 01:34:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-04-07 01:34:21] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 1 ms to minimize.
[2023-04-07 01:34:21] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2023-04-07 01:34:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-04-07 01:34:22] [INFO ] After 8519ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :21
Attempting to minimize the solution found.
Minimization took 1256 ms.
[2023-04-07 01:34:23] [INFO ] After 11490ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :21
Fused 22 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 882 ms.
Support contains 37 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 416 place count 451 transition count 2177
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 451 transition count 2177
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 395 transition count 2121
Applied a total of 530 rules in 229 ms. Remains 395 /660 variables (removed 265) and now considering 2121/2400 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 395/660 places, 2121/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) 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 21) 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 21) seen :0
Interrupted probabilistic random walk after 143613 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{6=1, 20=1}
Probabilistic random walk after 143613 steps, saw 91144 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :2
Running SMT prover for 19 properties.
[2023-04-07 01:34:28] [INFO ] Flow matrix only has 673 transitions (discarded 1448 similar events)
// Phase 1: matrix 673 rows 395 cols
[2023-04-07 01:34:28] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:34:28] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 01:34:28] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 01:34:28] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 01:34:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:34:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:34:29] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 01:34:29] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-04-07 01:34:30] [INFO ] After 744ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 01:34:30] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 01:34:30] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 1 ms to minimize.
[2023-04-07 01:34:30] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-04-07 01:34:30] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-04-07 01:34:30] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 4 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1393 ms
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-07 01:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-07 01:34:31] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2023-04-07 01:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-07 01:34:32] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-04-07 01:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 01:34:32] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 1 ms to minimize.
[2023-04-07 01:34:32] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2023-04-07 01:34:32] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2023-04-07 01:34:32] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-04-07 01:34:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 458 ms
[2023-04-07 01:34:33] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-04-07 01:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-07 01:34:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-04-07 01:34:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-04-07 01:34:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-04-07 01:34:33] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-07 01:34:33] [INFO ] After 4425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-04-07 01:34:34] [INFO ] After 6051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 150 ms.
Support contains 35 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2121/2121 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 395 transition count 2120
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 394 transition count 2120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 393 transition count 2112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 393 transition count 2112
Applied a total of 4 rules in 91 ms. Remains 393 /395 variables (removed 2) and now considering 2112/2121 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 393/395 places, 2112/2121 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Interrupted probabilistic random walk after 166707 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166707 steps, saw 102193 distinct states, run finished after 3003 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 19 properties.
[2023-04-07 01:34:38] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2023-04-07 01:34:38] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 01:34:38] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 01:34:38] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 01:34:38] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 01:34:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 01:34:38] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:34:39] [INFO ] After 655ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 01:34:39] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 01:34:40] [INFO ] After 786ms SMT Verify possible using 291 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 01:34:40] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2023-04-07 01:34:40] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2023-04-07 01:34:40] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 0 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 793 ms
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-07 01:34:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 473 ms
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 0 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-04-07 01:34:42] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 0 ms to minimize.
[2023-04-07 01:34:43] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-04-07 01:34:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 908 ms
[2023-04-07 01:34:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 01:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-07 01:34:43] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2023-04-07 01:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-07 01:34:43] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-04-07 01:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-07 01:34:43] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2023-04-07 01:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-04-07 01:34:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-04-07 01:34:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 4 ms to minimize.
[2023-04-07 01:34:44] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-04-07 01:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-04-07 01:34:45] [INFO ] After 5516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 822 ms.
[2023-04-07 01:34:45] [INFO ] After 7297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 163 ms.
Support contains 35 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2023-04-07 01:34:46] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-07 01:34:46] [INFO ] Invariant cache hit.
[2023-04-07 01:34:46] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-04-07 01:34:46] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-07 01:34:46] [INFO ] Invariant cache hit.
[2023-04-07 01:34:46] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 01:34:47] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
[2023-04-07 01:34:48] [INFO ] Redundant transitions in 108 ms returned []
[2023-04-07 01:34:48] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2023-04-07 01:34:48] [INFO ] Invariant cache hit.
[2023-04-07 01:34:48] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2459 ms. Remains : 393/393 places, 2112/2112 transitions.
Graph (trivial) has 1628 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 337 transition count 427
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 273 transition count 427
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 129 place count 273 transition count 411
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 168 place count 250 transition count 411
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 366 place count 151 transition count 312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 399 place count 151 transition count 279
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 415 place count 151 transition count 263
Free-agglomeration rule applied 72 times.
Iterating global reduction 3 with 72 rules applied. Total rules applied 487 place count 151 transition count 191
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 559 place count 79 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 568 place count 79 transition count 191
Applied a total of 568 rules in 38 ms. Remains 79 /393 variables (removed 314) and now considering 191/2112 (removed 1921) transitions.
Running SMT prover for 19 properties.
// Phase 1: matrix 191 rows 79 cols
[2023-04-07 01:34:48] [INFO ] Computed 18 invariants in 1 ms
[2023-04-07 01:34:48] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 01:34:48] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 01:34:48] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-07 01:34:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:34:48] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 01:34:49] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-07 01:34:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 01:34:49] [INFO ] After 128ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-07 01:34:49] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-07 01:34:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-04-07 01:34:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-04-07 01:34:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-04-07 01:34:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-07 01:34:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 152 ms
[2023-04-07 01:34:49] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-04-07 01:34:49] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((F(G(p0)) U p1))'
Support contains 5 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 418 place count 449 transition count 2161
Iterating global reduction 2 with 4 rules applied. Total rules applied 422 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 393 transition count 2105
Applied a total of 534 rules in 165 ms. Remains 393 /660 variables (removed 267) and now considering 2105/2400 (removed 295) transitions.
[2023-04-07 01:34:50] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 01:34:50] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 01:34:50] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-04-07 01:34:50] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:34:50] [INFO ] Invariant cache hit.
[2023-04-07 01:34:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:34:52] [INFO ] Implicit Places using invariants and state equation in 1555 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
[2023-04-07 01:34:52] [INFO ] Redundant transitions in 93 ms returned []
[2023-04-07 01:34:52] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:34:52] [INFO ] Invariant cache hit.
[2023-04-07 01:34:52] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 393/660 places, 2105/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2814 ms. Remains : 393/660 places, 2105/2400 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 192 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s29 1) (EQ s285 1)), p0:(AND (EQ s28 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 376 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 3441 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))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 652 transition count 2192
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 452 transition count 2192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 420 place count 448 transition count 2160
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 392 transition count 2104
Applied a total of 536 rules in 127 ms. Remains 392 /660 variables (removed 268) and now considering 2104/2400 (removed 296) transitions.
[2023-04-07 01:34:53] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:34:53] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 01:34:53] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-04-07 01:34:53] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:34:53] [INFO ] Invariant cache hit.
[2023-04-07 01:34:54] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:34:55] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
[2023-04-07 01:34:55] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-07 01:34:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:34:55] [INFO ] Invariant cache hit.
[2023-04-07 01:34:56] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/660 places, 2104/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2764 ms. Remains : 392/660 places, 2104/2400 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s8 1) (EQ s252 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 257 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-01 finished in 3089 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)))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 27 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:34:56] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 01:34:56] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 01:34:56] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-04-07 01:34:56] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:56] [INFO ] Invariant cache hit.
[2023-04-07 01:34:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:34:59] [INFO ] Implicit Places using invariants and state equation in 3011 ms returned []
Implicit Place search using SMT with State Equation took 3382 ms to find 0 implicit places.
[2023-04-07 01:34:59] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:34:59] [INFO ] Invariant cache hit.
[2023-04-07 01:35:00] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4181 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s137 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 825 ms.
Product exploration explored 100000 steps with 50000 reset in 753 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 5901 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((G(F(p0))||(F(p0)&&X(G(p1)))))))'
Support contains 7 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 28 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:35:02] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:02] [INFO ] Invariant cache hit.
[2023-04-07 01:35:02] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-04-07 01:35:02] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:02] [INFO ] Invariant cache hit.
[2023-04-07 01:35:03] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:35:05] [INFO ] Implicit Places using invariants and state equation in 3190 ms returned []
Implicit Place search using SMT with State Equation took 3570 ms to find 0 implicit places.
[2023-04-07 01:35:05] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:05] [INFO ] Invariant cache hit.
[2023-04-07 01:35:06] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4379 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s4 1) (EQ s20 1) (EQ s449 1)) (AND (EQ s7 1) (EQ s30 1) (EQ s482 1))), p1:(NEQ s293 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 227 ms.
Stack based approach found an accepted trace after 1306 steps with 0 reset with depth 1307 and stack size 1280 in 4 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 4827 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(G(p0))&&(F(p1) U p2))))'
Support contains 9 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 23 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:35:07] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:07] [INFO ] Invariant cache hit.
[2023-04-07 01:35:07] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-04-07 01:35:07] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:07] [INFO ] Invariant cache hit.
[2023-04-07 01:35:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:35:10] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned []
Implicit Place search using SMT with State Equation took 2899 ms to find 0 implicit places.
[2023-04-07 01:35:10] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:10] [INFO ] Invariant cache hit.
[2023-04-07 01:35:10] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3695 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s3 1) (EQ s17 1) (EQ s433 1)), p1:(AND (EQ s4 1) (EQ s22 1) (EQ s436 1)), p0:(AND (EQ s2 1) (EQ s16 1) (EQ s466 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-05 finished in 3966 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(G(p0))))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 25 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:35:11] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:11] [INFO ] Invariant cache hit.
[2023-04-07 01:35:11] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-04-07 01:35:11] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:11] [INFO ] Invariant cache hit.
[2023-04-07 01:35:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:35:14] [INFO ] Implicit Places using invariants and state equation in 2698 ms returned []
Implicit Place search using SMT with State Equation took 3078 ms to find 0 implicit places.
[2023-04-07 01:35:14] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:14] [INFO ] Invariant cache hit.
[2023-04-07 01:35:15] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3862 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s11 1) (NEQ s333 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 413 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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
Finished probabilistic random walk after 6226 steps, run visited all 1 properties in 37 ms. (steps per millisecond=168 )
Probabilistic random walk after 6226 steps, saw 5373 distinct states, run finished after 37 ms. (steps per millisecond=168 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 10 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-07 01:35:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:16] [INFO ] Invariant cache hit.
[2023-04-07 01:35:16] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-04-07 01:35:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:16] [INFO ] Invariant cache hit.
[2023-04-07 01:35:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:35:19] [INFO ] Implicit Places using invariants and state equation in 3060 ms returned []
Implicit Place search using SMT with State Equation took 3463 ms to find 0 implicit places.
[2023-04-07 01:35:19] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:19] [INFO ] Invariant cache hit.
[2023-04-07 01:35:20] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4240 ms. Remains : 656/656 places, 2368/2368 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (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 6226 steps, run visited all 1 properties in 41 ms. (steps per millisecond=151 )
Probabilistic random walk after 6226 steps, saw 5373 distinct states, run finished after 42 ms. (steps per millisecond=148 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2368
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 191 Pre rules applied. Total rules applied 8 place count 656 transition count 2686
Deduced a syphon composed of 199 places in 2 ms
Iterating global reduction 1 with 191 rules applied. Total rules applied 199 place count 656 transition count 2686
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 263 places in 2 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 263 place count 656 transition count 2686
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 271 place count 648 transition count 2678
Deduced a syphon composed of 255 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 279 place count 648 transition count 2678
Deduced a syphon composed of 255 places in 2 ms
Applied a total of 279 rules in 179 ms. Remains 648 /656 variables (removed 8) and now considering 2678/2368 (removed -310) transitions.
[2023-04-07 01:35:22] [INFO ] Redundant transitions in 64 ms returned []
[2023-04-07 01:35:22] [INFO ] Flow matrix only has 1071 transitions (discarded 1607 similar events)
// Phase 1: matrix 1071 rows 648 cols
[2023-04-07 01:35:22] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 01:35:23] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 648/656 places, 2678/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1109 ms. Remains : 648/656 places, 2678/2368 transitions.
Built C files in :
/tmp/ltsmin2212436797779439982
[2023-04-07 01:35:23] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2212436797779439982
Running compilation step : cd /tmp/ltsmin2212436797779439982;'/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/ltsmin2212436797779439982;'/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/ltsmin2212436797779439982;'/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 2 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 17 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2023-04-07 01:35:26] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 01:35:26] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 01:35:27] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-04-07 01:35:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:27] [INFO ] Invariant cache hit.
[2023-04-07 01:35:27] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:35:30] [INFO ] Implicit Places using invariants and state equation in 2955 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
[2023-04-07 01:35:30] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:35:30] [INFO ] Invariant cache hit.
[2023-04-07 01:35:30] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4143 ms. Remains : 656/656 places, 2368/2368 transitions.
Built C files in :
/tmp/ltsmin14252707011275694151
[2023-04-07 01:35:30] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14252707011275694151
Running compilation step : cd /tmp/ltsmin14252707011275694151;'/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/ltsmin14252707011275694151;'/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/ltsmin14252707011275694151;'/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 01:35:34] [INFO ] Flatten gal took : 78 ms
[2023-04-07 01:35:34] [INFO ] Flatten gal took : 82 ms
[2023-04-07 01:35:34] [INFO ] Time to serialize gal into /tmp/LTL7741979229921006550.gal : 18 ms
[2023-04-07 01:35:34] [INFO ] Time to serialize properties into /tmp/LTL7330684697096948562.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/LTL7741979229921006550.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10549930742613288227.hoa' '-atoms' '/tmp/LTL7330684697096948562.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/LTL7330684697096948562.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10549930742613288227.hoa
Detected timeout of ITS tools.
[2023-04-07 01:35:49] [INFO ] Flatten gal took : 61 ms
[2023-04-07 01:35:49] [INFO ] Flatten gal took : 62 ms
[2023-04-07 01:35:49] [INFO ] Time to serialize gal into /tmp/LTL14242383249520403328.gal : 9 ms
[2023-04-07 01:35:49] [INFO ] Time to serialize properties into /tmp/LTL2876289959448480640.ltl : 74 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/LTL14242383249520403328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2876289959448480640.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(X(G("((flag_1_idle!=1)||(p18_4_1!=1))")))))
Formula 0 simplified : XXF!"((flag_1_idle!=1)||(p18_4_1!=1))"
Detected timeout of ITS tools.
[2023-04-07 01:36:04] [INFO ] Flatten gal took : 58 ms
[2023-04-07 01:36:04] [INFO ] Applying decomposition
[2023-04-07 01:36:04] [INFO ] Flatten gal took : 61 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/graph13047644912166469512.txt' '-o' '/tmp/graph13047644912166469512.bin' '-w' '/tmp/graph13047644912166469512.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13047644912166469512.bin' '-l' '-1' '-v' '-w' '/tmp/graph13047644912166469512.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:36:05] [INFO ] Decomposing Gal with order
[2023-04-07 01:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:36:05] [INFO ] Removed a total of 4568 redundant transitions.
[2023-04-07 01:36:05] [INFO ] Flatten gal took : 582 ms
[2023-04-07 01:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 657 labels/synchronizations in 92 ms.
[2023-04-07 01:36:05] [INFO ] Time to serialize gal into /tmp/LTL5149320152901250646.gal : 18 ms
[2023-04-07 01:36:05] [INFO ] Time to serialize properties into /tmp/LTL3786371758161577408.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/LTL5149320152901250646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3786371758161577408.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i12.i2.u114.flag_1_idle!=1)||(i12.i1.u152.p18_4_1!=1))")))))
Formula 0 simplified : XXF!"((i12.i2.u114.flag_1_idle!=1)||(i12.i1.u152.p18_4_1!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10660758105322385961
[2023-04-07 01:36:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10660758105322385961
Running compilation step : cd /tmp/ltsmin10660758105322385961;'/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/ltsmin10660758105322385961;'/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/ltsmin10660758105322385961;'/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-08-LTLFireability-07 finished in 72925 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((G(!p1) U (!p2&&G(!p1))))||p0)))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 28 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:36:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:24] [INFO ] Invariant cache hit.
[2023-04-07 01:36:24] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-04-07 01:36:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:24] [INFO ] Invariant cache hit.
[2023-04-07 01:36:24] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:36:27] [INFO ] Implicit Places using invariants and state equation in 3198 ms returned []
Implicit Place search using SMT with State Equation took 3599 ms to find 0 implicit places.
[2023-04-07 01:36:27] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:27] [INFO ] Invariant cache hit.
[2023-04-07 01:36:28] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4394 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 174 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s7 1) (EQ s29 1) (EQ s456 1)), p0:(OR (NEQ s0 1) (NEQ s9 1) (NEQ s448 1)), p2:(AND (EQ s0 1) (EQ s9 1) (EQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 861 ms.
Product exploration explored 100000 steps with 50000 reset in 864 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) p0 (NOT p2)), (X p0), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-08 finished in 6354 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(G(p0))||G(F(!p1))||(F(!p1)&&F(p2)))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 657 transition count 2376
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 657 transition count 2376
Applied a total of 6 rules in 28 ms. Remains 657 /660 variables (removed 3) and now considering 2376/2400 (removed 24) transitions.
[2023-04-07 01:36:30] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
// Phase 1: matrix 928 rows 657 cols
[2023-04-07 01:36:30] [INFO ] Computed 25 invariants in 9 ms
[2023-04-07 01:36:30] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-04-07 01:36:30] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2023-04-07 01:36:30] [INFO ] Invariant cache hit.
[2023-04-07 01:36:31] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 01:36:33] [INFO ] Implicit Places using invariants and state equation in 2818 ms returned []
Implicit Place search using SMT with State Equation took 3189 ms to find 0 implicit places.
[2023-04-07 01:36:33] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2023-04-07 01:36:33] [INFO ] Invariant cache hit.
[2023-04-07 01:36:34] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 657/660 places, 2376/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4028 ms. Remains : 657/660 places, 2376/2400 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p1:(AND (EQ s0 1) (EQ s9 1) (EQ s466 1)), p2:(NEQ s172 1), p0:(AND (EQ s4 1) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 821 ms.
Product exploration explored 100000 steps with 50000 reset in 865 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) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p2)), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 37 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 6084 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(!X((!X(G((X(p1)&&!p2)))&&p0))) U p3))'
Support contains 10 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 417 place count 450 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 420 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 394 transition count 2113
Applied a total of 532 rules in 149 ms. Remains 394 /660 variables (removed 266) and now considering 2113/2400 (removed 287) transitions.
[2023-04-07 01:36:36] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 394 cols
[2023-04-07 01:36:36] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 01:36:37] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-04-07 01:36:37] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 01:36:37] [INFO ] Invariant cache hit.
[2023-04-07 01:36:37] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 01:36:38] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2023-04-07 01:36:38] [INFO ] Redundant transitions in 44 ms returned []
[2023-04-07 01:36:38] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 01:36:38] [INFO ] Invariant cache hit.
[2023-04-07 01:36:39] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/660 places, 2113/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2725 ms. Remains : 394/660 places, 2113/2400 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p3), (OR (NOT p3) (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p0), acceptance={} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s0 1) (EQ s46 1)), p0:(AND (EQ s1 1) (EQ s12 1) (EQ s291 1)), p2:(AND (EQ s24 1) (EQ s112 1)), p1:(AND (EQ s6 1) (EQ s28 1) (EQ s277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10597 reset in 436 ms.
Stack based approach found an accepted trace after 29 steps with 3 reset with depth 15 and stack size 15 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 3382 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&&G(!p1)) U !p2)))'
Support contains 9 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 27 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:36:39] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 01:36:39] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 01:36:40] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-04-07 01:36:40] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:40] [INFO ] Invariant cache hit.
[2023-04-07 01:36:40] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:36:43] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 3165 ms to find 0 implicit places.
[2023-04-07 01:36:43] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:43] [INFO ] Invariant cache hit.
[2023-04-07 01:36:43] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3932 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 156 ms :[p2, p2, true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s0 1) (EQ s9 1) (EQ s493 1)), p0:(AND (EQ s4 1) (EQ s20 1) (EQ s478 1)), p1:(AND (EQ s7 1) (EQ s29 1) (EQ s480 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 812 ms.
Product exploration explored 100000 steps with 50000 reset in 823 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (OR (AND p2 p0) (AND p2 p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), true, (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 5878 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(p0)))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 25 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:36:45] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:45] [INFO ] Invariant cache hit.
[2023-04-07 01:36:46] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-04-07 01:36:46] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:46] [INFO ] Invariant cache hit.
[2023-04-07 01:36:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:36:49] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3313 ms to find 0 implicit places.
[2023-04-07 01:36:49] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:49] [INFO ] Invariant cache hit.
[2023-04-07 01:36:49] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4140 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 278 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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 502731 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502731 steps, saw 347968 distinct states, run finished after 3003 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:36:53] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:36:53] [INFO ] Invariant cache hit.
[2023-04-07 01:36:53] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-04-07 01:36:53] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 01:36:54] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:36:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 01:36:54] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 01:36:54] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:36:54] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:36:54] [INFO ] After 119ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:36:54] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-04-07 01:36:55] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2023-04-07 01:36:55] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-07 01:36:55] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 1 ms to minimize.
[2023-04-07 01:36:55] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-04-07 01:36:55] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2023-04-07 01:36:56] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2023-04-07 01:36:56] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-04-07 01:36:56] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2023-04-07 01:36:56] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2023-04-07 01:36:56] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 01:36:56] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2023-04-07 01:36:57] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 0 ms to minimize.
[2023-04-07 01:36:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2410 ms
[2023-04-07 01:36:57] [INFO ] After 2581ms 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 01:36:57] [INFO ] After 2981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 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 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 116 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 392/656 places, 2104/2368 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 553527 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553527 steps, saw 285816 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:37:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:37:00] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 01:37:00] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:37:00] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 01:37:00] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:37:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:37:00] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:37:00] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:00] [INFO ] After 69ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 5 ms to minimize.
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-04-07 01:37:01] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-07 01:37:02] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-04-07 01:37:02] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2023-04-07 01:37:02] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2023-04-07 01:37:02] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2023-04-07 01:37:02] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-04-07 01:37:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1766 ms
[2023-04-07 01:37:02] [INFO ] After 1873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 01:37:02] [INFO ] After 2152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:37:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:02] [INFO ] Invariant cache hit.
[2023-04-07 01:37:03] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-04-07 01:37:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:03] [INFO ] Invariant cache hit.
[2023-04-07 01:37:03] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:04] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-04-07 01:37:04] [INFO ] Redundant transitions in 38 ms returned []
[2023-04-07 01:37:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:04] [INFO ] Invariant cache hit.
[2023-04-07 01:37:05] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2648 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 45 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 01:37:05] [INFO ] Computed 17 invariants in 1 ms
[2023-04-07 01:37:05] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-07 01:37:05] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:37:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:37:05] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 01:37:05] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:05] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 01:37:05] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 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 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 99 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2023-04-07 01:37:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:37:05] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 01:37:06] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-04-07 01:37:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:06] [INFO ] Invariant cache hit.
[2023-04-07 01:37:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:07] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2023-04-07 01:37:08] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:37:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:08] [INFO ] Invariant cache hit.
[2023-04-07 01:37:08] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2831 ms. Remains : 392/656 places, 2104/2368 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 545031 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545031 steps, saw 281830 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:37:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:11] [INFO ] Invariant cache hit.
[2023-04-07 01:37:11] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-04-07 01:37:11] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:37:12] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:37:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-07 01:37:12] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:37:12] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:12] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:12] [INFO ] After 70ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:12] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-04-07 01:37:12] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 1 ms to minimize.
[2023-04-07 01:37:12] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2023-04-07 01:37:13] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2023-04-07 01:37:14] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-04-07 01:37:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1558 ms
[2023-04-07 01:37:14] [INFO ] After 1660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 01:37:14] [INFO ] After 1933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 563292 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 563292 steps, saw 290480 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:37:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:17] [INFO ] Invariant cache hit.
[2023-04-07 01:37:17] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-04-07 01:37:17] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:37:17] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:37:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:37:17] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:37:17] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:17] [INFO ] After 73ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:17] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 0 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2023-04-07 01:37:18] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-07 01:37:19] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2023-04-07 01:37:19] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:37:19] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-04-07 01:37:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1563 ms
[2023-04-07 01:37:19] [INFO ] After 1672ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 01:37:19] [INFO ] After 1956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:37:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:19] [INFO ] Invariant cache hit.
[2023-04-07 01:37:19] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-04-07 01:37:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:19] [INFO ] Invariant cache hit.
[2023-04-07 01:37:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:21] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2023-04-07 01:37:21] [INFO ] Redundant transitions in 45 ms returned []
[2023-04-07 01:37:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:21] [INFO ] Invariant cache hit.
[2023-04-07 01:37:22] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2652 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 20 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 01:37:22] [INFO ] Computed 17 invariants in 0 ms
[2023-04-07 01:37:22] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:37:22] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:37:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:37:22] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 01:37:22] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:37:22] [INFO ] After 15ms 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 01:37:22] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Product exploration explored 100000 steps with 0 reset in 266 ms.
Built C files in :
/tmp/ltsmin9865689219311274572
[2023-04-07 01:37:23] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2023-04-07 01:37:23] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9865689219311274572
Running compilation step : cd /tmp/ltsmin9865689219311274572;'/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/ltsmin9865689219311274572;'/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/ltsmin9865689219311274572;'/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 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:37:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:37:26] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 01:37:26] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-04-07 01:37:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:26] [INFO ] Invariant cache hit.
[2023-04-07 01:37:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:37:28] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2023-04-07 01:37:28] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:37:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:37:28] [INFO ] Invariant cache hit.
[2023-04-07 01:37:28] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2661 ms. Remains : 392/392 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin17400878645689246120
[2023-04-07 01:37:28] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2023-04-07 01:37:28] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17400878645689246120
Running compilation step : cd /tmp/ltsmin17400878645689246120;'/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/ltsmin17400878645689246120;'/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/ltsmin17400878645689246120;'/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 01:37:31] [INFO ] Flatten gal took : 61 ms
[2023-04-07 01:37:32] [INFO ] Flatten gal took : 115 ms
[2023-04-07 01:37:32] [INFO ] Time to serialize gal into /tmp/LTL15661945817092074080.gal : 7 ms
[2023-04-07 01:37:32] [INFO ] Time to serialize properties into /tmp/LTL374231165530696831.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/LTL15661945817092074080.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12114255591542768427.hoa' '-atoms' '/tmp/LTL374231165530696831.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/LTL374231165530696831.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12114255591542768427.hoa
Detected timeout of ITS tools.
[2023-04-07 01:37:47] [INFO ] Flatten gal took : 56 ms
[2023-04-07 01:37:47] [INFO ] Flatten gal took : 48 ms
[2023-04-07 01:37:47] [INFO ] Time to serialize gal into /tmp/LTL15365456919996837812.gal : 24 ms
[2023-04-07 01:37:47] [INFO ] Time to serialize properties into /tmp/LTL7147882124992794030.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/LTL15365456919996837812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7147882124992794030.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("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
Detected timeout of ITS tools.
[2023-04-07 01:38:02] [INFO ] Flatten gal took : 49 ms
[2023-04-07 01:38:02] [INFO ] Applying decomposition
[2023-04-07 01:38:02] [INFO ] Flatten gal took : 51 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/graph11829648215278108187.txt' '-o' '/tmp/graph11829648215278108187.bin' '-w' '/tmp/graph11829648215278108187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11829648215278108187.bin' '-l' '-1' '-v' '-w' '/tmp/graph11829648215278108187.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:38:02] [INFO ] Decomposing Gal with order
[2023-04-07 01:38:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:38:03] [INFO ] Removed a total of 4384 redundant transitions.
[2023-04-07 01:38:03] [INFO ] Flatten gal took : 289 ms
[2023-04-07 01:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 98 ms.
[2023-04-07 01:38:03] [INFO ] Time to serialize gal into /tmp/LTL11425295895289075963.gal : 45 ms
[2023-04-07 01:38:03] [INFO ] Time to serialize properties into /tmp/LTL12058458250533825062.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/LTL11425295895289075963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12058458250533825062.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("(((i11.i1.u55.turn_1!=1)||(i13.i2.u17.flag_1_idle!=1))||(i12.u54.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i11.i1.u55.turn_1!=1)||(i13.i2.u17.flag_1_idle!=1))||(i12.u54.p25_3_5!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5728688629398656671
[2023-04-07 01:38:18] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5728688629398656671
Running compilation step : cd /tmp/ltsmin5728688629398656671;'/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/ltsmin5728688629398656671;'/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/ltsmin5728688629398656671;'/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-08-LTLFireability-12 finished in 95679 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)))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 2400/2400 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 656 transition count 2368
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 656 transition count 2368
Applied a total of 8 rules in 21 ms. Remains 656 /660 variables (removed 4) and now considering 2368/2400 (removed 32) transitions.
[2023-04-07 01:38:21] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2023-04-07 01:38:21] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 01:38:21] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-04-07 01:38:21] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:38:21] [INFO ] Invariant cache hit.
[2023-04-07 01:38:22] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:38:24] [INFO ] Implicit Places using invariants and state equation in 2612 ms returned []
Implicit Place search using SMT with State Equation took 3015 ms to find 0 implicit places.
[2023-04-07 01:38:24] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2023-04-07 01:38:24] [INFO ] Invariant cache hit.
[2023-04-07 01:38:25] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 656/660 places, 2368/2400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3811 ms. Remains : 656/660 places, 2368/2400 transitions.
Stuttering acceptance computed with spot in 418 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s31 1) (EQ s478 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][false, false]]
Product exploration explored 100000 steps with 0 reset in 213 ms.
Stack based approach found an accepted trace after 96 steps with 0 reset with depth 97 and stack size 97 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 4468 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(((p1||X(F(p2)))&&p0))))'
Support contains 6 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 417 place count 450 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 420 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 532 place count 394 transition count 2113
Applied a total of 532 rules in 104 ms. Remains 394 /660 variables (removed 266) and now considering 2113/2400 (removed 287) transitions.
[2023-04-07 01:38:26] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 394 cols
[2023-04-07 01:38:26] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 01:38:26] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-04-07 01:38:26] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 01:38:26] [INFO ] Invariant cache hit.
[2023-04-07 01:38:26] [INFO ] State equation strengthened by 291 read => feed constraints.
[2023-04-07 01:38:27] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2023-04-07 01:38:28] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-07 01:38:28] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2023-04-07 01:38:28] [INFO ] Invariant cache hit.
[2023-04-07 01:38:28] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 394/660 places, 2113/2400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2782 ms. Remains : 394/660 places, 2113/2400 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s29 1) (EQ s256 1)), p1:(EQ s192 1), p2:(AND (EQ s6 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 229 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-15 finished in 3101 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(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-07
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 652 transition count 2193
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 453 transition count 2193
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 418 place count 449 transition count 2161
Iterating global reduction 2 with 4 rules applied. Total rules applied 422 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 534 place count 393 transition count 2105
Applied a total of 534 rules in 68 ms. Remains 393 /660 variables (removed 267) and now considering 2105/2400 (removed 295) transitions.
[2023-04-07 01:38:29] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 01:38:29] [INFO ] Computed 25 invariants in 1 ms
[2023-04-07 01:38:29] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-04-07 01:38:29] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:29] [INFO ] Invariant cache hit.
[2023-04-07 01:38:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:38:31] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
[2023-04-07 01:38:31] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:31] [INFO ] Invariant cache hit.
[2023-04-07 01:38:32] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 393/660 places, 2105/2400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2890 ms. Remains : 393/660 places, 2105/2400 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s11 1) (NEQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 266 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (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
Finished Best-First random walk after 9173 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1528 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 13 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:38:33] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:33] [INFO ] Invariant cache hit.
[2023-04-07 01:38:33] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-04-07 01:38:33] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:33] [INFO ] Invariant cache hit.
[2023-04-07 01:38:33] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:38:35] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
[2023-04-07 01:38:35] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:35] [INFO ] Invariant cache hit.
[2023-04-07 01:38:35] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2794 ms. Remains : 393/393 places, 2105/2105 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 279 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished Best-First random walk after 3132 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1044 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 244 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 56 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:38:37] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:38:37] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:37] [INFO ] Invariant cache hit.
[2023-04-07 01:38:38] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 933 ms. Remains : 393/393 places, 2105/2105 transitions.
Built C files in :
/tmp/ltsmin1495286386449421193
[2023-04-07 01:38:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1495286386449421193
Running compilation step : cd /tmp/ltsmin1495286386449421193;'/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/ltsmin1495286386449421193;'/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/ltsmin1495286386449421193;'/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 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 9 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:38:41] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:41] [INFO ] Invariant cache hit.
[2023-04-07 01:38:41] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-04-07 01:38:41] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:41] [INFO ] Invariant cache hit.
[2023-04-07 01:38:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:38:43] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2023-04-07 01:38:43] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:38:43] [INFO ] Invariant cache hit.
[2023-04-07 01:38:44] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2616 ms. Remains : 393/393 places, 2105/2105 transitions.
Built C files in :
/tmp/ltsmin820613162741005943
[2023-04-07 01:38:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin820613162741005943
Running compilation step : cd /tmp/ltsmin820613162741005943;'/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/ltsmin820613162741005943;'/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/ltsmin820613162741005943;'/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 01:38:47] [INFO ] Flatten gal took : 47 ms
[2023-04-07 01:38:47] [INFO ] Flatten gal took : 48 ms
[2023-04-07 01:38:47] [INFO ] Time to serialize gal into /tmp/LTL7376786814467644524.gal : 9 ms
[2023-04-07 01:38:47] [INFO ] Time to serialize properties into /tmp/LTL16500617043463698928.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/LTL7376786814467644524.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18074120450756903696.hoa' '-atoms' '/tmp/LTL16500617043463698928.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/LTL16500617043463698928.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18074120450756903696.hoa
Detected timeout of ITS tools.
[2023-04-07 01:39:02] [INFO ] Flatten gal took : 48 ms
[2023-04-07 01:39:02] [INFO ] Flatten gal took : 46 ms
[2023-04-07 01:39:02] [INFO ] Time to serialize gal into /tmp/LTL200222195748475735.gal : 9 ms
[2023-04-07 01:39:02] [INFO ] Time to serialize properties into /tmp/LTL7414180102945997498.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/LTL200222195748475735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7414180102945997498.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...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((flag_1_idle!=1)||(p18_4_1!=1))")))))
Formula 0 simplified : XXF!"((flag_1_idle!=1)||(p18_4_1!=1))"
Detected timeout of ITS tools.
[2023-04-07 01:39:17] [INFO ] Flatten gal took : 45 ms
[2023-04-07 01:39:17] [INFO ] Applying decomposition
[2023-04-07 01:39:17] [INFO ] Flatten gal took : 57 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/graph3974858418917731014.txt' '-o' '/tmp/graph3974858418917731014.bin' '-w' '/tmp/graph3974858418917731014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3974858418917731014.bin' '-l' '-1' '-v' '-w' '/tmp/graph3974858418917731014.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:39:17] [INFO ] Decomposing Gal with order
[2023-04-07 01:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:39:18] [INFO ] Removed a total of 4378 redundant transitions.
[2023-04-07 01:39:18] [INFO ] Flatten gal took : 290 ms
[2023-04-07 01:39:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 539 labels/synchronizations in 74 ms.
[2023-04-07 01:39:18] [INFO ] Time to serialize gal into /tmp/LTL6672971774004174440.gal : 26 ms
[2023-04-07 01:39:18] [INFO ] Time to serialize properties into /tmp/LTL9667492568311951577.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/LTL6672971774004174440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9667492568311951577.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...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i14.u7.flag_1_idle!=1)||(i9.u48.p18_4_1!=1))")))))
Formula 0 simplified : XXF!"((i14.u7.flag_1_idle!=1)||(i9.u48.p18_4_1!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15620308617872548296
[2023-04-07 01:39:33] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15620308617872548296
Running compilation step : cd /tmp/ltsmin15620308617872548296;'/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/ltsmin15620308617872548296;'/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/ltsmin15620308617872548296;'/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-08-LTLFireability-07 finished in 67508 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(p0)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 660/660 places, 2400/2400 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 660 transition count 2392
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 652 transition count 2392
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 652 transition count 2192
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 452 transition count 2192
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 420 place count 448 transition count 2160
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 536 place count 392 transition count 2104
Applied a total of 536 rules in 62 ms. Remains 392 /660 variables (removed 268) and now considering 2104/2400 (removed 296) transitions.
[2023-04-07 01:39:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:39:36] [INFO ] Computed 25 invariants in 1 ms
[2023-04-07 01:39:37] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-04-07 01:39:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:37] [INFO ] Invariant cache hit.
[2023-04-07 01:39:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:39:38] [INFO ] Implicit Places using invariants and state equation in 1551 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
[2023-04-07 01:39:38] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:38] [INFO ] Invariant cache hit.
[2023-04-07 01:39:39] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 392/660 places, 2104/2400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2894 ms. Remains : 392/660 places, 2104/2400 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s1 1) (NEQ s11 1) (NEQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 0 reset in 245 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (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 569907 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569907 steps, saw 293709 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:39:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:43] [INFO ] Invariant cache hit.
[2023-04-07 01:39:43] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:39:43] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:39:43] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:39:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:39:43] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:39:43] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:39:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:39:43] [INFO ] After 71ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:39:43] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-04-07 01:39:44] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 01:39:45] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-04-07 01:39:45] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-04-07 01:39:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-04-07 01:39:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1541 ms
[2023-04-07 01:39:45] [INFO ] After 1648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 01:39:45] [INFO ] After 1924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 392/392 places, 2104/2104 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 563184 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 563184 steps, saw 290417 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:39:48] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:48] [INFO ] Invariant cache hit.
[2023-04-07 01:39:48] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:39:48] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:39:48] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:39:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:39:48] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:39:49] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:39:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:39:49] [INFO ] After 69ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:39:49] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-07 01:39:49] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-07 01:39:49] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2023-04-07 01:39:49] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 0 ms to minimize.
[2023-04-07 01:39:49] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-04-07 01:39:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1500 ms
[2023-04-07 01:39:50] [INFO ] After 1600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 01:39:50] [INFO ] After 1977ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 50 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 50 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:39:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:50] [INFO ] Invariant cache hit.
[2023-04-07 01:39:51] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-04-07 01:39:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:51] [INFO ] Invariant cache hit.
[2023-04-07 01:39:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:39:52] [INFO ] Implicit Places using invariants and state equation in 1578 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
[2023-04-07 01:39:52] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:39:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:52] [INFO ] Invariant cache hit.
[2023-04-07 01:39:53] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2717 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 23 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 01:39:53] [INFO ] Computed 17 invariants in 0 ms
[2023-04-07 01:39:53] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:39:53] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:39:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:39:53] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:39:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 01:39:53] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:39:53] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-07 01:39:53] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:39:53] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:39:53] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 01:39:54] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-04-07 01:39:54] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:54] [INFO ] Invariant cache hit.
[2023-04-07 01:39:54] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:39:55] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2023-04-07 01:39:55] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:39:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:55] [INFO ] Invariant cache hit.
[2023-04-07 01:39:56] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2647 ms. Remains : 392/392 places, 2104/2104 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 574443 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 574443 steps, saw 295508 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:39:59] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:39:59] [INFO ] Invariant cache hit.
[2023-04-07 01:39:59] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-07 01:39:59] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:39:59] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:39:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:39:59] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:40:00] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:40:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:40:00] [INFO ] After 67ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:40:00] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-04-07 01:40:00] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2023-04-07 01:40:00] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-04-07 01:40:00] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-04-07 01:40:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1518 ms
[2023-04-07 01:40:01] [INFO ] After 1614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 01:40:01] [INFO ] After 1999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 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 569943 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569943 steps, saw 293729 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 01:40:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:40:04] [INFO ] Invariant cache hit.
[2023-04-07 01:40:04] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:40:04] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:40:05] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:40:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-07 01:40:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:40:05] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:40:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:40:05] [INFO ] After 72ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:40:05] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 0 ms to minimize.
[2023-04-07 01:40:05] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 0 ms to minimize.
[2023-04-07 01:40:05] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-04-07 01:40:06] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-04-07 01:40:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1534 ms
[2023-04-07 01:40:07] [INFO ] After 1642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 01:40:07] [INFO ] After 1911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 49 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 49 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:40:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:40:07] [INFO ] Invariant cache hit.
[2023-04-07 01:40:07] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-04-07 01:40:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:40:07] [INFO ] Invariant cache hit.
[2023-04-07 01:40:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:40:09] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2023-04-07 01:40:09] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:40:09] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:40:09] [INFO ] Invariant cache hit.
[2023-04-07 01:40:09] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2595 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
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 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 16 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-07 01:40:09] [INFO ] Computed 17 invariants in 0 ms
[2023-04-07 01:40:09] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:40:09] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:40:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-07 01:40:09] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:40:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-07 01:40:09] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:40:09] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-07 01:40:09] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Built C files in :
/tmp/ltsmin12470194347828138964
[2023-04-07 01:40:10] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2023-04-07 01:40:10] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12470194347828138964
Running compilation step : cd /tmp/ltsmin12470194347828138964;'/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/ltsmin12470194347828138964;'/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/ltsmin12470194347828138964;'/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 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:40:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:40:13] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 01:40:14] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-04-07 01:40:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:40:14] [INFO ] Invariant cache hit.
[2023-04-07 01:40:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:40:15] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-04-07 01:40:15] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:40:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:40:15] [INFO ] Invariant cache hit.
[2023-04-07 01:40:16] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2619 ms. Remains : 392/392 places, 2104/2104 transitions.
Built C files in :
/tmp/ltsmin17126447637618822424
[2023-04-07 01:40:16] [INFO ] Too many transitions (2104) to apply POR reductions. Disabling POR matrices.
[2023-04-07 01:40:16] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17126447637618822424
Running compilation step : cd /tmp/ltsmin17126447637618822424;'/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/ltsmin17126447637618822424;'/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/ltsmin17126447637618822424;'/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 01:40:19] [INFO ] Flatten gal took : 45 ms
[2023-04-07 01:40:19] [INFO ] Flatten gal took : 57 ms
[2023-04-07 01:40:19] [INFO ] Time to serialize gal into /tmp/LTL18348266658148175232.gal : 8 ms
[2023-04-07 01:40:19] [INFO ] Time to serialize properties into /tmp/LTL10481285967395832716.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/LTL18348266658148175232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16507575429091888601.hoa' '-atoms' '/tmp/LTL10481285967395832716.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...320
Loading property file /tmp/LTL10481285967395832716.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16507575429091888601.hoa
Detected timeout of ITS tools.
[2023-04-07 01:40:34] [INFO ] Flatten gal took : 45 ms
[2023-04-07 01:40:34] [INFO ] Flatten gal took : 56 ms
[2023-04-07 01:40:34] [INFO ] Time to serialize gal into /tmp/LTL11224149998944699937.gal : 30 ms
[2023-04-07 01:40:34] [INFO ] Time to serialize properties into /tmp/LTL16469384602445859985.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/LTL11224149998944699937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16469384602445859985.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 : !((X(G("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
Detected timeout of ITS tools.
[2023-04-07 01:40:49] [INFO ] Flatten gal took : 45 ms
[2023-04-07 01:40:49] [INFO ] Applying decomposition
[2023-04-07 01:40:49] [INFO ] Flatten gal took : 45 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/graph14267470554882014697.txt' '-o' '/tmp/graph14267470554882014697.bin' '-w' '/tmp/graph14267470554882014697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14267470554882014697.bin' '-l' '-1' '-v' '-w' '/tmp/graph14267470554882014697.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:40:49] [INFO ] Decomposing Gal with order
[2023-04-07 01:40:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:40:50] [INFO ] Removed a total of 4421 redundant transitions.
[2023-04-07 01:40:50] [INFO ] Flatten gal took : 145 ms
[2023-04-07 01:40:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 523 labels/synchronizations in 84 ms.
[2023-04-07 01:40:50] [INFO ] Time to serialize gal into /tmp/LTL11249609537157967997.gal : 25 ms
[2023-04-07 01:40:50] [INFO ] Time to serialize properties into /tmp/LTL16407782895368470032.ltl : 12 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/LTL11249609537157967997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16407782895368470032.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("(((i8.u3.turn_1!=1)||(i5.i1.u18.flag_1_idle!=1))||(i6.i1.u59.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((i8.u3.turn_1!=1)||(i5.i1.u18.flag_1_idle!=1))||(i6.i1.u59.p25_3_5!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13335690368505308872
[2023-04-07 01:41:05] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13335690368505308872
Running compilation step : cd /tmp/ltsmin13335690368505308872;'/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/ltsmin13335690368505308872;'/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/ltsmin13335690368505308872;'/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-08-LTLFireability-12 finished in 92010 ms.
[2023-04-07 01:41:08] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin577159331451628725
[2023-04-07 01:41:08] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2023-04-07 01:41:08] [INFO ] Applying decomposition
[2023-04-07 01:41:08] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin577159331451628725
Running compilation step : cd /tmp/ltsmin577159331451628725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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 01:41:08] [INFO ] Flatten gal took : 53 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/graph5442949311773777671.txt' '-o' '/tmp/graph5442949311773777671.bin' '-w' '/tmp/graph5442949311773777671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5442949311773777671.bin' '-l' '-1' '-v' '-w' '/tmp/graph5442949311773777671.weights' '-q' '0' '-e' '0.001'
[2023-04-07 01:41:08] [INFO ] Decomposing Gal with order
[2023-04-07 01:41:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 01:41:09] [INFO ] Removed a total of 4591 redundant transitions.
[2023-04-07 01:41:09] [INFO ] Flatten gal took : 238 ms
[2023-04-07 01:41:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 93 ms.
[2023-04-07 01:41:09] [INFO ] Time to serialize gal into /tmp/LTLFireability15926766687099573796.gal : 14 ms
[2023-04-07 01:41:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17798892203900491744.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/LTLFireability15926766687099573796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17798892203900491744.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...278
Read 2 LTL properties
Checking formula 0 : !((X(X(G("((i16.i2.u144.flag_1_idle!=1)||(i19.i0.u149.p18_4_1!=1))")))))
Formula 0 simplified : XXF!"((i16.i2.u144.flag_1_idle!=1)||(i19.i0.u149.p18_4_1!=1))"
Compilation finished in 5589 ms.
Running link step : cd /tmp/ltsmin577159331451628725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin577159331451628725;'/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([]((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 486588 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin577159331451628725;'/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([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 02:03:31] [INFO ] Applying decomposition
[2023-04-07 02:03:31] [INFO ] Flatten gal took : 200 ms
[2023-04-07 02:03:31] [INFO ] Decomposing Gal with order
[2023-04-07 02:03:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 02:03:31] [INFO ] Removed a total of 5013 redundant transitions.
[2023-04-07 02:03:31] [INFO ] Flatten gal took : 389 ms
[2023-04-07 02:03:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 49 ms.
[2023-04-07 02:03:32] [INFO ] Time to serialize gal into /tmp/LTLFireability1847352360501138221.gal : 45 ms
[2023-04-07 02:03:32] [INFO ] Time to serialize properties into /tmp/LTLFireability16727684130720007690.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/LTLFireability1847352360501138221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16727684130720007690.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 1 LTL properties
Checking formula 0 : !((X(G("(((u10.turn_1!=1)||(u12.flag_1_idle!=1))||(u6.p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((u10.turn_1!=1)||(u12.flag_1_idle!=1))||(u6.p25_3_5!=1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin577159331451628725;'/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([]((LTLAPp1==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin577159331451628725;'/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([]((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 02:25:54] [INFO ] Flatten gal took : 189 ms
[2023-04-07 02:25:54] [INFO ] Input system was already deterministic with 2400 transitions.
[2023-04-07 02:25:54] [INFO ] Transformed 660 places.
[2023-04-07 02:25:54] [INFO ] Transformed 2400 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 02:25:55] [INFO ] Time to serialize gal into /tmp/LTLFireability14103485779168426291.gal : 9 ms
[2023-04-07 02:25:55] [INFO ] Time to serialize properties into /tmp/LTLFireability15718494890095361977.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/LTLFireability14103485779168426291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15718494890095361977.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G("(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"))))
Formula 0 simplified : XF!"(((turn_1!=1)||(flag_1_idle!=1))||(p25_3_5!=1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7903032 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16035940 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-08"
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-08, 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-167987243600260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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