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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K 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-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680824467914

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-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-06 23:41:09] [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-06 23:41:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:41:09] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-04-06 23:41:09] [INFO ] Transformed 414 places.
[2023-04-06 23:41:09] [INFO ] Transformed 1296 transitions.
[2023-04-06 23:41:09] [INFO ] Found NUPN structural information;
[2023-04-06 23:41:09] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 387 transition count 1134
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 387 transition count 1134
Applied a total of 54 rules in 63 ms. Remains 387 /414 variables (removed 27) and now considering 1134/1296 (removed 162) transitions.
[2023-04-06 23:41:09] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
// Phase 1: matrix 540 rows 387 cols
[2023-04-06 23:41:09] [INFO ] Computed 19 invariants in 16 ms
[2023-04-06 23:41:10] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-04-06 23:41:10] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-06 23:41:10] [INFO ] Invariant cache hit.
[2023-04-06 23:41:10] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 23:41:10] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2023-04-06 23:41:10] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-06 23:41:10] [INFO ] Invariant cache hit.
[2023-04-06 23:41:11] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 387/414 places, 1134/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1605 ms. Remains : 387/414 places, 1134/1296 transitions.
Support contains 47 out of 387 places after structural reductions.
[2023-04-06 23:41:11] [INFO ] Flatten gal took : 193 ms
[2023-04-06 23:41:11] [INFO ] Flatten gal took : 129 ms
[2023-04-06 23:41:12] [INFO ] Input system was already deterministic with 1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 813 ms. (steps per millisecond=12 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-04-06 23:41:13] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-06 23:41:13] [INFO ] Invariant cache hit.
[2023-04-06 23:41:13] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-04-06 23:41:13] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:41:13] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-06 23:41:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 23:41:13] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:41:14] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-06 23:41:14] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 23:41:15] [INFO ] After 596ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 4 ms to minimize.
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 1 ms to minimize.
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-06 23:41:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 579 ms
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 23:41:15] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 377 ms
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:41:16] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2023-04-06 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2023-04-06 23:41:18] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 23:41:18] [INFO ] After 3648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 659 ms.
[2023-04-06 23:41:18] [INFO ] After 5389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 323 ms.
Support contains 31 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 12 place count 381 transition count 1019
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 230 place count 272 transition count 1019
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 290 place count 242 transition count 989
Applied a total of 290 rules in 95 ms. Remains 242 /387 variables (removed 145) and now considering 989/1134 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 242/387 places, 989/1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 373814 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{0=1, 3=1, 4=1, 6=1, 8=1, 9=1, 10=1, 11=1, 13=1, 15=1, 16=1}
Probabilistic random walk after 373814 steps, saw 116677 distinct states, run finished after 3002 ms. (steps per millisecond=124 ) properties seen :11
Running SMT prover for 6 properties.
[2023-04-06 23:41:22] [INFO ] Flow matrix only has 395 transitions (discarded 594 similar events)
// Phase 1: matrix 395 rows 242 cols
[2023-04-06 23:41:22] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 23:41:22] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:41:22] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:41:22] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 23:41:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-06 23:41:22] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:41:22] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 23:41:22] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-06 23:41:23] [INFO ] After 134ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:41:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 892 ms
[2023-04-06 23:41:24] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-04-06 23:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 23:41:24] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 23:41:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 23:41:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-04-06 23:41:24] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 23:41:24] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 23:41:24] [INFO ] After 1518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-04-06 23:41:24] [INFO ] After 1910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 26 ms.
Support contains 12 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 989/989 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 242 transition count 985
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 238 transition count 985
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 236 transition count 973
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 236 transition count 973
Applied a total of 12 rules in 54 ms. Remains 236 /242 variables (removed 6) and now considering 973/989 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 236/242 places, 973/989 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 320579 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320579 steps, saw 98074 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-06 23:41:28] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
// Phase 1: matrix 379 rows 236 cols
[2023-04-06 23:41:28] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 23:41:28] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2023-04-06 23:41:28] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-06 23:41:28] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 23:41:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:41:28] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:41:28] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 23:41:28] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:41:28] [INFO ] After 142ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 23:41:28] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:41:28] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 23:41:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 23:41:28] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:41:29] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-04-06 23:41:29] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-04-06 23:41:29] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:41:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 558 ms
[2023-04-06 23:41:29] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2023-04-06 23:41:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 23:41:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:41:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 23:41:29] [INFO ] After 987ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-04-06 23:41:29] [INFO ] After 1394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 25 ms.
Support contains 12 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 973/973 transitions.
Applied a total of 0 rules in 29 ms. Remains 236 /236 variables (removed 0) and now considering 973/973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 236/236 places, 973/973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 973/973 transitions.
Applied a total of 0 rules in 26 ms. Remains 236 /236 variables (removed 0) and now considering 973/973 (removed 0) transitions.
[2023-04-06 23:41:29] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-06 23:41:29] [INFO ] Invariant cache hit.
[2023-04-06 23:41:29] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-04-06 23:41:29] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-06 23:41:29] [INFO ] Invariant cache hit.
[2023-04-06 23:41:29] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:41:30] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-04-06 23:41:30] [INFO ] Redundant transitions in 54 ms returned []
[2023-04-06 23:41:30] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-06 23:41:30] [INFO ] Invariant cache hit.
[2023-04-06 23:41:30] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1088 ms. Remains : 236/236 places, 973/973 transitions.
Graph (trivial) has 813 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions removed 112 transitions
Ensure Unique test removed 575 transitions
Reduce isomorphic transitions removed 687 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 206 transition count 244
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 164 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 163 transition count 243
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 87 place count 163 transition count 231
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 116 place count 146 transition count 231
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 226 place count 91 transition count 176
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 249 place count 91 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 257 place count 87 transition count 172
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 87 transition count 169
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 270 place count 87 transition count 159
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 300 place count 87 transition count 129
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 330 place count 57 transition count 129
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 342 place count 57 transition count 129
Applied a total of 342 rules in 27 ms. Remains 57 /236 variables (removed 179) and now considering 129/973 (removed 844) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 129 rows 57 cols
[2023-04-06 23:41:30] [INFO ] Computed 14 invariants in 2 ms
[2023-04-06 23:41:30] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:41:30] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:41:30] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 23:41:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:41:30] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 23:41:30] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 23:41:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 23:41:30] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 23:41:30] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2023-04-06 23:41:30] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2023-04-06 23:41:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2023-04-06 23:41:31] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 23:41:31] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(X(F(((X(p0) U p1)&&X(p2)))))))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 17 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:41:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:41:31] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 23:41:31] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-04-06 23:41:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:31] [INFO ] Invariant cache hit.
[2023-04-06 23:41:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:32] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
[2023-04-06 23:41:32] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:32] [INFO ] Invariant cache hit.
[2023-04-06 23:41:32] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1432 ms. Remains : 384/387 places, 1116/1134 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 374 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s19 1) (EQ s80 1)), p2:(EQ s121 1), p0:(AND (EQ s0 1) (EQ s8 1) (EQ s254 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 293 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 2163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||(X(X(p0))&&X(p0)))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 17 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:41:33] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:33] [INFO ] Invariant cache hit.
[2023-04-06 23:41:33] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-04-06 23:41:33] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:33] [INFO ] Invariant cache hit.
[2023-04-06 23:41:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:34] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2023-04-06 23:41:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:34] [INFO ] Invariant cache hit.
[2023-04-06 23:41:34] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1415 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s277 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Product exploration explored 100000 steps with 0 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 312942 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312942 steps, saw 187505 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:41:39] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:39] [INFO ] Invariant cache hit.
[2023-04-06 23:41:39] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-06 23:41:39] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-06 23:41:39] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:41:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 23:41:39] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:41:39] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:39] [INFO ] After 131ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:39] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 4 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 874 ms
[2023-04-06 23:41:40] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 0 ms to minimize.
[2023-04-06 23:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-06 23:41:40] [INFO ] After 1252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-04-06 23:41:41] [INFO ] After 1697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 54 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 563899 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 563899 steps, saw 141858 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:41:44] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:41:44] [INFO ] Computed 19 invariants in 8 ms
[2023-04-06 23:41:44] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:41:44] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:41:44] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:41:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:41:44] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:41:44] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:44] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:44] [INFO ] After 102ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:44] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 5 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 442 ms
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 23:41:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 23:41:45] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-04-06 23:41:45] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 26 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 24 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:41:45] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:41:45] [INFO ] Invariant cache hit.
[2023-04-06 23:41:45] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-04-06 23:41:45] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:41:45] [INFO ] Invariant cache hit.
[2023-04-06 23:41:45] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:46] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-04-06 23:41:46] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-06 23:41:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:41:46] [INFO ] Invariant cache hit.
[2023-04-06 23:41:46] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 18 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 23:41:46] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:41:46] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:41:46] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:41:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:41:46] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:41:46] [INFO ] After 19ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:46] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-06 23:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-06 23:41:46] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-06 23:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-06 23:41:46] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-06 23:41:46] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 14 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 23:41:47] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:41:47] [INFO ] Computed 19 invariants in 9 ms
[2023-04-06 23:41:47] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-06 23:41:47] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:47] [INFO ] Invariant cache hit.
[2023-04-06 23:41:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:48] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2023-04-06 23:41:48] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:48] [INFO ] Invariant cache hit.
[2023-04-06 23:41:48] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1477 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 306551 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306551 steps, saw 183887 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:41:52] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:41:52] [INFO ] Invariant cache hit.
[2023-04-06 23:41:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-06 23:41:52] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 7 ms returned sat
[2023-04-06 23:41:52] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:41:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 23:41:52] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:41:52] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:52] [INFO ] After 128ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 0 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 866 ms
[2023-04-06 23:41:53] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-06 23:41:54] [INFO ] After 1239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-04-06 23:41:54] [INFO ] After 1661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 36 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 439362 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439362 steps, saw 118834 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:41:57] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:41:57] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 23:41:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:41:57] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:41:57] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:41:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:41:57] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:41:57] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:58] [INFO ] After 102ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 447 ms
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-06 23:41:58] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-04-06 23:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-06 23:41:58] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-04-06 23:41:58] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:41:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:41:58] [INFO ] Invariant cache hit.
[2023-04-06 23:41:58] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-04-06 23:41:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:41:58] [INFO ] Invariant cache hit.
[2023-04-06 23:41:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:41:59] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-04-06 23:41:59] [INFO ] Redundant transitions in 16 ms returned []
[2023-04-06 23:41:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:41:59] [INFO ] Invariant cache hit.
[2023-04-06 23:41:59] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1052 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 19 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 23:41:59] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:41:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:41:59] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:41:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:41:59] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:41:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:41:59] [INFO ] After 18ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:42:00] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2023-04-06 23:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-04-06 23:42:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-06 23:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-06 23:42:00] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 23:42:00] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 185 ms.
Product exploration explored 100000 steps with 0 reset in 236 ms.
Built C files in :
/tmp/ltsmin17230848085581189495
[2023-04-06 23:42:01] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17230848085581189495
Running compilation step : cd /tmp/ltsmin17230848085581189495;'/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'
Compilation finished in 1853 ms.
Running link step : cd /tmp/ltsmin17230848085581189495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17230848085581189495;'/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' '--hoa' '/tmp/stateBased6711635963101051898.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 23:42:16] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:42:16] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 23:42:16] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-04-06 23:42:16] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:42:16] [INFO ] Invariant cache hit.
[2023-04-06 23:42:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:42:17] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2023-04-06 23:42:17] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:42:17] [INFO ] Invariant cache hit.
[2023-04-06 23:42:17] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1482 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin18404408666968538095
[2023-04-06 23:42:17] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18404408666968538095
Running compilation step : cd /tmp/ltsmin18404408666968538095;'/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'
Compilation finished in 1846 ms.
Running link step : cd /tmp/ltsmin18404408666968538095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18404408666968538095;'/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' '--hoa' '/tmp/stateBased3379540613443451598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-06 23:42:33] [INFO ] Flatten gal took : 53 ms
[2023-04-06 23:42:33] [INFO ] Flatten gal took : 46 ms
[2023-04-06 23:42:33] [INFO ] Time to serialize gal into /tmp/LTL5123514509462581798.gal : 10 ms
[2023-04-06 23:42:33] [INFO ] Time to serialize properties into /tmp/LTL1114752118759450859.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/LTL5123514509462581798.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15997825029444268377.hoa' '-atoms' '/tmp/LTL1114752118759450859.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/LTL1114752118759450859.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15997825029444268377.hoa
Detected timeout of ITS tools.
[2023-04-06 23:42:48] [INFO ] Flatten gal took : 38 ms
[2023-04-06 23:42:48] [INFO ] Flatten gal took : 36 ms
[2023-04-06 23:42:48] [INFO ] Time to serialize gal into /tmp/LTL9792836001376247675.gal : 6 ms
[2023-04-06 23:42:48] [INFO ] Time to serialize properties into /tmp/LTL10548833705261668374.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9792836001376247675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10548833705261668374.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
Detected timeout of ITS tools.
[2023-04-06 23:43:03] [INFO ] Flatten gal took : 37 ms
[2023-04-06 23:43:03] [INFO ] Applying decomposition
[2023-04-06 23:43:03] [INFO ] Flatten gal took : 37 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/graph13036519771557165270.txt' '-o' '/tmp/graph13036519771557165270.bin' '-w' '/tmp/graph13036519771557165270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13036519771557165270.bin' '-l' '-1' '-v' '-w' '/tmp/graph13036519771557165270.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:43:03] [INFO ] Decomposing Gal with order
[2023-04-06 23:43:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:43:03] [INFO ] Removed a total of 1855 redundant transitions.
[2023-04-06 23:43:03] [INFO ] Flatten gal took : 203 ms
[2023-04-06 23:43:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 51 ms.
[2023-04-06 23:43:03] [INFO ] Time to serialize gal into /tmp/LTL15879341373945516320.gal : 13 ms
[2023-04-06 23:43:03] [INFO ] Time to serialize properties into /tmp/LTL9878331362564746150.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/LTL15879341373945516320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9878331362564746150.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((i0.u0.turn_5==1)&&(i14.u1.flag_5_active==1))&&(i10.u2.p25_2_1==1))"))||(G("(((i0.u0.turn_5==0)||(i14.u1.flag_5_active==0)...346
Formula 0 simplified : G(F!"(((i0.u0.turn_5==0)||(i14.u1.flag_5_active==0))||(i11.u4.p25_4_1==0))" & X(!"(((i0.u0.turn_5==1)&&(i14.u1.flag_5_active==1))&&(...253
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11572201051235794807
[2023-04-06 23:43:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11572201051235794807
Running compilation step : cd /tmp/ltsmin11572201051235794807;'/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'
Compilation finished in 1781 ms.
Running link step : cd /tmp/ltsmin11572201051235794807;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11572201051235794807;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 120536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F(p2)&&p0))))'
Support contains 7 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 15 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:43:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:34] [INFO ] Invariant cache hit.
[2023-04-06 23:43:34] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-04-06 23:43:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:34] [INFO ] Invariant cache hit.
[2023-04-06 23:43:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:35] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
[2023-04-06 23:43:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:35] [INFO ] Invariant cache hit.
[2023-04-06 23:43:35] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1603 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s357 1)), p1:(AND (EQ s0 1) (EQ s340 1)), p2:(AND (EQ s4 1) (EQ s18 1) (EQ s282 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-02 finished in 1835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 381 transition count 1015
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 268 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 265 transition count 997
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 967
Applied a total of 304 rules in 59 ms. Remains 235 /387 variables (removed 152) and now considering 967/1134 (removed 167) transitions.
[2023-04-06 23:43:35] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2023-04-06 23:43:35] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:43:36] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-04-06 23:43:36] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2023-04-06 23:43:36] [INFO ] Invariant cache hit.
[2023-04-06 23:43:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:36] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-04-06 23:43:36] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 23:43:36] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2023-04-06 23:43:36] [INFO ] Invariant cache hit.
[2023-04-06 23:43:36] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 967/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1034 ms. Remains : 235/387 places, 967/1134 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s72 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 687 steps with 0 reset with depth 688 and stack size 533 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-03 finished in 1267 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)||G(p1)))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 242 place count 265 transition count 1002
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 265 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 972
Applied a total of 304 rules in 46 ms. Remains 235 /387 variables (removed 152) and now considering 972/1134 (removed 162) transitions.
[2023-04-06 23:43:37] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
// Phase 1: matrix 378 rows 235 cols
[2023-04-06 23:43:37] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:43:37] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-04-06 23:43:37] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2023-04-06 23:43:37] [INFO ] Invariant cache hit.
[2023-04-06 23:43:37] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:43:37] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-04-06 23:43:37] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-06 23:43:37] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2023-04-06 23:43:37] [INFO ] Invariant cache hit.
[2023-04-06 23:43:38] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 972/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 235/387 places, 972/1134 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s186 1)), p1:(AND (EQ s2 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 1287 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' '!(((!p0 U ((p2 U p3)&&p1))||G(p4)))'
Support contains 10 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 387 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 382 transition count 1129
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 10 place count 382 transition count 1018
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 232 place count 271 transition count 1018
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 234 place count 269 transition count 1006
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 269 transition count 1006
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 294 place count 240 transition count 977
Applied a total of 294 rules in 45 ms. Remains 240 /387 variables (removed 147) and now considering 977/1134 (removed 157) transitions.
[2023-04-06 23:43:38] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
// Phase 1: matrix 383 rows 240 cols
[2023-04-06 23:43:38] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:43:38] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-04-06 23:43:38] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
[2023-04-06 23:43:38] [INFO ] Invariant cache hit.
[2023-04-06 23:43:38] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:43:39] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-04-06 23:43:39] [INFO ] Redundant transitions in 16 ms returned []
[2023-04-06 23:43:39] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
[2023-04-06 23:43:39] [INFO ] Invariant cache hit.
[2023-04-06 23:43:39] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/387 places, 977/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 240/387 places, 977/1134 transitions.
Stuttering acceptance computed with spot in 341 ms :[true, (OR (NOT p1) (NOT p3)), (NOT p4), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=1 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 7}], [{ cond=(NOT p4), acceptance={} source=2 dest: 0}, { cond=p4, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p4)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 p4), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p4), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 p0 p4), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p4)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) p0 (NOT p4)) (AND (NOT p3) (NOT p2) p0 (NOT p4))), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p2) (NOT p0) (NOT p4))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p3) (NOT p2) p0 p4)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0) p4), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p3) (NOT p2) (NOT p0) p4)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3) p2 p0 p4), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0 (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p4), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2 p4), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p1:(AND (NOT (AND (EQ s5 1) (EQ s22 1) (EQ s174 1))) (EQ s9 1) (EQ s73 1)), p0:(AND (EQ s20 1) (EQ s112 1)), p3:(AND (EQ s9 1) (EQ s73 1)), p2:(AND (EQ s0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 372 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 1532 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 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 9 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:43:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:43:40] [INFO ] Computed 19 invariants in 7 ms
[2023-04-06 23:43:40] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-04-06 23:43:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:40] [INFO ] Invariant cache hit.
[2023-04-06 23:43:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:41] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-04-06 23:43:41] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:41] [INFO ] Invariant cache hit.
[2023-04-06 23:43:41] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1622 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-07 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:(NEQ s38 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]]
Entered a terminal (fully accepting) state of product in 417 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-07 finished in 1704 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(X(G((F(G(p0)) U p1))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 385 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 385 transition count 1122
Applied a total of 4 rules in 15 ms. Remains 385 /387 variables (removed 2) and now considering 1122/1134 (removed 12) transitions.
[2023-04-06 23:43:41] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2023-04-06 23:43:41] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:43:41] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-04-06 23:43:41] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2023-04-06 23:43:41] [INFO ] Invariant cache hit.
[2023-04-06 23:43:42] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-06 23:43:42] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-04-06 23:43:42] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2023-04-06 23:43:42] [INFO ] Invariant cache hit.
[2023-04-06 23:43:43] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 385/387 places, 1122/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 385/387 places, 1122/1134 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s14 1) (EQ s260 1)), p0:(AND (EQ s1 1) (EQ s102 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 0 reset in 154 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 1747 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||G(p1)))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 12 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:43:43] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:43:43] [INFO ] Computed 19 invariants in 5 ms
[2023-04-06 23:43:43] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-04-06 23:43:43] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:43] [INFO ] Invariant cache hit.
[2023-04-06 23:43:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:44] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2023-04-06 23:43:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:44] [INFO ] Invariant cache hit.
[2023-04-06 23:43:44] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1457 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s203 0)), p0:(AND (EQ s23 1) (EQ s305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 23:43:45] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:43:45] [INFO ] Invariant cache hit.
[2023-04-06 23:43:45] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 23:43:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 23:43:45] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:46] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 23:43:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:46] [INFO ] After 63ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 23:43:46] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-04-06 23:43:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:43:46] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 23:43:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-04-06 23:43:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:43:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 384 ms
[2023-04-06 23:43:46] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 23:43:46] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 23:43:46] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 33 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 236/384 places, 968/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1009260 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1009260 steps, saw 234235 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:43:49] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 23:43:49] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:43:49] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:43:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:43:49] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:43:49] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:49] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:49] [INFO ] After 33ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:49] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:43:50] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:43:50] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-04-06 23:43:50] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2023-04-06 23:43:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 23:43:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 314 ms
[2023-04-06 23:43:50] [INFO ] After 357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-06 23:43:50] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 23:43:50] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:50] [INFO ] Invariant cache hit.
[2023-04-06 23:43:50] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-04-06 23:43:50] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:50] [INFO ] Invariant cache hit.
[2023-04-06 23:43:50] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:51] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-04-06 23:43:51] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 23:43:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:51] [INFO ] Invariant cache hit.
[2023-04-06 23:43:51] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1077 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 16 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 23:43:51] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:43:51] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:43:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:43:51] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:43:51] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-06 23:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-06 23:43:51] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 23:43:51] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 34 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
[2023-04-06 23:43:51] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-06 23:43:51] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 23:43:51] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-04-06 23:43:52] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:52] [INFO ] Invariant cache hit.
[2023-04-06 23:43:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:52] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-04-06 23:43:52] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 23:43:52] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:52] [INFO ] Invariant cache hit.
[2023-04-06 23:43:52] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/384 places, 968/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1082 ms. Remains : 236/384 places, 968/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:43:53] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:53] [INFO ] Invariant cache hit.
[2023-04-06 23:43:53] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:43:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:43:53] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:43:53] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:53] [INFO ] After 35ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:53] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 23:43:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:43:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 23:43:53] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-04-06 23:43:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
[2023-04-06 23:43:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 23:43:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 345 ms
[2023-04-06 23:43:53] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-06 23:43:53] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1020082 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1020082 steps, saw 235717 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:43:56] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:56] [INFO ] Invariant cache hit.
[2023-04-06 23:43:56] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:43:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:43:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 1 ms returned sat
[2023-04-06 23:43:57] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:57] [INFO ] After 32ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:57] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 23:43:57] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-04-06 23:43:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 23:43:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:43:57] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-04-06 23:43:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 23:43:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 340 ms
[2023-04-06 23:43:57] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-06 23:43:57] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 21 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-06 23:43:57] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:57] [INFO ] Invariant cache hit.
[2023-04-06 23:43:57] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-04-06 23:43:57] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:57] [INFO ] Invariant cache hit.
[2023-04-06 23:43:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:43:58] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-04-06 23:43:58] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 23:43:58] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-06 23:43:58] [INFO ] Invariant cache hit.
[2023-04-06 23:43:58] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1038 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 12 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 23:43:58] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:43:58] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:43:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 23:43:58] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:43:58] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:43:58] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-06 23:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-06 23:43:58] [INFO ] After 36ms 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-06 23:43:58] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Built C files in :
/tmp/ltsmin4003749947977889577
[2023-04-06 23:43:59] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2023-04-06 23:43:59] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:43:59] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2023-04-06 23:43:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:43:59] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2023-04-06 23:43:59] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:43:59] [INFO ] Built C files in 217ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4003749947977889577
Running compilation step : cd /tmp/ltsmin4003749947977889577;'/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'
Compilation finished in 2611 ms.
Running link step : cd /tmp/ltsmin4003749947977889577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4003749947977889577;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5289673429108971852.hoa' '--buchi-type=spotba'
LTSmin run took 12097 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 31109 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(X(F(p0)))))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 13 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:44:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:44:14] [INFO ] Computed 19 invariants in 6 ms
[2023-04-06 23:44:14] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-04-06 23:44:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:14] [INFO ] Invariant cache hit.
[2023-04-06 23:44:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:15] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2023-04-06 23:44:15] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:15] [INFO ] Invariant cache hit.
[2023-04-06 23:44:16] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1500 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s14 0) (EQ s256 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 336 ms.
Product exploration explored 100000 steps with 25000 reset in 313 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 846300 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 846300 steps, saw 409424 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:44:20] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:20] [INFO ] Invariant cache hit.
[2023-04-06 23:44:20] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:44:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 23:44:20] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:44:20] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:20] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:20] [INFO ] After 48ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:20] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2023-04-06 23:44:20] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-06 23:44:20] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-06 23:44:20] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-04-06 23:44:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1089 ms
[2023-04-06 23:44:21] [INFO ] After 1158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-06 23:44:21] [INFO ] After 1408ms 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 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 36 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 987161 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 987161 steps, saw 231874 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:44:24] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:44:24] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 23:44:24] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:44:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:44:24] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:44:24] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:24] [INFO ] After 37ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:24] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 23:44:25] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2023-04-06 23:44:25] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:44:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:44:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 295 ms
[2023-04-06 23:44:25] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 23:44:25] [INFO ] After 504ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:44:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:25] [INFO ] Invariant cache hit.
[2023-04-06 23:44:25] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-04-06 23:44:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:25] [INFO ] Invariant cache hit.
[2023-04-06 23:44:25] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:25] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-04-06 23:44:26] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-06 23:44:26] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:26] [INFO ] Invariant cache hit.
[2023-04-06 23:44:26] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1028 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 14 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 23:44:26] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 23:44:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:44:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:44:26] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:44:26] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-06 23:44:26] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-06 23:44:26] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-06 23:44:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 71 ms
[2023-04-06 23:44:26] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-06 23:44:26] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 23:44:26] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:44:26] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:44:26] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-06 23:44:26] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:26] [INFO ] Invariant cache hit.
[2023-04-06 23:44:27] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:27] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2023-04-06 23:44:27] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:27] [INFO ] Invariant cache hit.
[2023-04-06 23:44:28] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 384/384 places, 1116/1116 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 869169 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 869169 steps, saw 416248 distinct states, run finished after 3003 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:44:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:31] [INFO ] Invariant cache hit.
[2023-04-06 23:44:31] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:44:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-06 23:44:31] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:44:31] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:31] [INFO ] After 40ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:31] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-04-06 23:44:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1032 ms
[2023-04-06 23:44:32] [INFO ] After 1095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-06 23:44:32] [INFO ] After 1341ms 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 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 31 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 989401 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 989401 steps, saw 232162 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 23:44:35] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:44:35] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:44:36] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:44:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:44:36] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:44:36] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:36] [INFO ] After 39ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:36] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-04-06 23:44:36] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-06 23:44:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 23:44:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 23:44:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 284 ms
[2023-04-06 23:44:36] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-06 23:44:36] [INFO ] After 493ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:44:36] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:36] [INFO ] Invariant cache hit.
[2023-04-06 23:44:36] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-04-06 23:44:36] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:36] [INFO ] Invariant cache hit.
[2023-04-06 23:44:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:37] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2023-04-06 23:44:37] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 23:44:37] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:37] [INFO ] Invariant cache hit.
[2023-04-06 23:44:37] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 13 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-06 23:44:37] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:44:37] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 23:44:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:44:37] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:44:37] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 23:44:37] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-06 23:44:37] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-06 23:44:37] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-06 23:44:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 75 ms
[2023-04-06 23:44:37] [INFO ] After 85ms 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-06 23:44:37] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 288 ms.
Product exploration explored 100000 steps with 25000 reset in 307 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 6 place count 384 transition count 1284
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 114 place count 384 transition count 1284
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 150 place count 384 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 378 transition count 1278
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 378 transition count 1278
Deduced a syphon composed of 144 places in 1 ms
Applied a total of 162 rules in 57 ms. Remains 378 /384 variables (removed 6) and now considering 1278/1116 (removed -162) transitions.
[2023-04-06 23:44:39] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-06 23:44:39] [INFO ] Flow matrix only has 600 transitions (discarded 678 similar events)
// Phase 1: matrix 600 rows 378 cols
[2023-04-06 23:44:39] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:44:39] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 1278/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 378/384 places, 1278/1116 transitions.
Built C files in :
/tmp/ltsmin17451831798419234985
[2023-04-06 23:44:39] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17451831798419234985
Running compilation step : cd /tmp/ltsmin17451831798419234985;'/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'
Compilation finished in 1782 ms.
Running link step : cd /tmp/ltsmin17451831798419234985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17451831798419234985;'/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' '--hoa' '/tmp/stateBased10403226617678097724.hoa' '--buchi-type=spotba'
LTSmin run took 324 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 27197 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(X(F(p0)))))'
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 16 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:44:41] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:44:41] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 23:44:41] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-04-06 23:44:41] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:41] [INFO ] Invariant cache hit.
[2023-04-06 23:44:42] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:43] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-04-06 23:44:43] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:43] [INFO ] Invariant cache hit.
[2023-04-06 23:44:43] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1596 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s180 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 285 ms.
Product exploration explored 100000 steps with 25000 reset in 299 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 7 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-06 23:44:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:44] [INFO ] Invariant cache hit.
[2023-04-06 23:44:44] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-04-06 23:44:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:44] [INFO ] Invariant cache hit.
[2023-04-06 23:44:45] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:46] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-04-06 23:44:46] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:46] [INFO ] Invariant cache hit.
[2023-04-06 23:44:46] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1611 ms. Remains : 384/384 places, 1116/1116 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 295 ms.
Product exploration explored 100000 steps with 25000 reset in 299 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1116
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 5 place count 384 transition count 1284
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 113 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 148 place count 384 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 153 place count 379 transition count 1279
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 158 place count 379 transition count 1279
Deduced a syphon composed of 143 places in 1 ms
Applied a total of 158 rules in 44 ms. Remains 379 /384 variables (removed 5) and now considering 1279/1116 (removed -163) transitions.
[2023-04-06 23:44:48] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-06 23:44:48] [INFO ] Flow matrix only has 601 transitions (discarded 678 similar events)
// Phase 1: matrix 601 rows 379 cols
[2023-04-06 23:44:48] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:44:48] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/384 places, 1279/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 379/384 places, 1279/1116 transitions.
Built C files in :
/tmp/ltsmin15997221173615635751
[2023-04-06 23:44:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15997221173615635751
Running compilation step : cd /tmp/ltsmin15997221173615635751;'/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'
Compilation finished in 1930 ms.
Running link step : cd /tmp/ltsmin15997221173615635751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin15997221173615635751;'/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' '--hoa' '/tmp/stateBased16835553304053367861.hoa' '--buchi-type=spotba'
LTSmin run took 269 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 9251 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((G((p0||(F(p0)&&p1)))||(p2&&X(p3))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 7 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-06 23:44:51] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-06 23:44:51] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:44:51] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-04-06 23:44:51] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:51] [INFO ] Invariant cache hit.
[2023-04-06 23:44:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:52] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2023-04-06 23:44:52] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-06 23:44:52] [INFO ] Invariant cache hit.
[2023-04-06 23:44:52] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1586 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (NOT p0), (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=6 dest: 4}]], initial=0, aps=[p2:(EQ s132 1), p0:(AND (EQ s10 1) (EQ s319 1)), p1:(AND (EQ s10 1) (EQ s319 1)), p3:(AND (EQ s21 1) (EQ s96 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-15 finished in 1860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||(X(X(p0))&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 264 transition count 996
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 306 place count 234 transition count 966
Applied a total of 306 rules in 35 ms. Remains 234 /387 variables (removed 153) and now considering 966/1134 (removed 168) transitions.
[2023-04-06 23:44:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:44:53] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 23:44:53] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-04-06 23:44:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:53] [INFO ] Invariant cache hit.
[2023-04-06 23:44:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:53] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2023-04-06 23:44:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:53] [INFO ] Invariant cache hit.
[2023-04-06 23:44:54] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 234/387 places, 966/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1063 ms. Remains : 234/387 places, 966/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s165 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 518112 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518112 steps, saw 133893 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:44:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:44:58] [INFO ] Invariant cache hit.
[2023-04-06 23:44:58] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:44:58] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:44:58] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:44:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:44:58] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:44:58] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:44:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:44:58] [INFO ] After 86ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:44:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:44:58] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-06 23:44:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:44:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 23:44:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 23:44:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 357 ms
[2023-04-06 23:44:58] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-04-06 23:44:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-04-06 23:44:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-04-06 23:44:59] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-04-06 23:44:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-04-06 23:44:59] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-04-06 23:44:59] [INFO ] After 1014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 511938 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :{}
Probabilistic random walk after 511938 steps, saw 133079 distinct states, run finished after 3003 ms. (steps per millisecond=170 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:45:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:02] [INFO ] Invariant cache hit.
[2023-04-06 23:45:02] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:45:02] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:45:02] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:45:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-06 23:45:02] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:45:02] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:03] [INFO ] After 94ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 363 ms
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-04-06 23:45:03] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-04-06 23:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-04-06 23:45:03] [INFO ] After 764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-04-06 23:45:03] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 26 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:45:03] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:03] [INFO ] Invariant cache hit.
[2023-04-06 23:45:04] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-04-06 23:45:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:04] [INFO ] Invariant cache hit.
[2023-04-06 23:45:04] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:04] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-04-06 23:45:04] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-06 23:45:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:04] [INFO ] Invariant cache hit.
[2023-04-06 23:45:04] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 10 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 23:45:04] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 23:45:05] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:45:05] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:45:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:45:05] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:45:05] [INFO ] After 19ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-06 23:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-06 23:45:05] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-06 23:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-06 23:45:05] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 23:45:05] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:45:05] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:45:05] [INFO ] Computed 19 invariants in 3 ms
[2023-04-06 23:45:05] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-04-06 23:45:05] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:05] [INFO ] Invariant cache hit.
[2023-04-06 23:45:05] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:06] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-04-06 23:45:06] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:06] [INFO ] Invariant cache hit.
[2023-04-06 23:45:06] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 234/234 places, 966/966 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 525840 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 525840 steps, saw 135067 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:45:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:10] [INFO ] Invariant cache hit.
[2023-04-06 23:45:10] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:45:10] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:45:10] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:45:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:45:10] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:45:10] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:10] [INFO ] After 98ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:10] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 23:45:10] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:45:10] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:45:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:45:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-04-06 23:45:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 349 ms
[2023-04-06 23:45:11] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-04-06 23:45:11] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-04-06 23:45:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-04-06 23:45:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2023-04-06 23:45:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 23:45:11] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-04-06 23:45:11] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 505932 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 505932 steps, saw 132172 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-06 23:45:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:14] [INFO ] Invariant cache hit.
[2023-04-06 23:45:14] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:45:14] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-06 23:45:14] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:45:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-06 23:45:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 23:45:15] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:15] [INFO ] After 89ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 379 ms
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-04-06 23:45:15] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-04-06 23:45:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-04-06 23:45:15] [INFO ] After 773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-04-06 23:45:15] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 25 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:45:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:15] [INFO ] Invariant cache hit.
[2023-04-06 23:45:16] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-04-06 23:45:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:16] [INFO ] Invariant cache hit.
[2023-04-06 23:45:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:16] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-04-06 23:45:16] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-06 23:45:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:16] [INFO ] Invariant cache hit.
[2023-04-06 23:45:17] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1128 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 9 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-06 23:45:17] [INFO ] Computed 13 invariants in 0 ms
[2023-04-06 23:45:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-06 23:45:17] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 23:45:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-06 23:45:17] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-06 23:45:17] [INFO ] After 28ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-06 23:45:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-06 23:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 23:45:17] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-06 23:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-06 23:45:17] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 23:45:17] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 195 ms.
Built C files in :
/tmp/ltsmin12218657577182789636
[2023-04-06 23:45:18] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12218657577182789636
Running compilation step : cd /tmp/ltsmin12218657577182789636;'/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'
Compilation finished in 1557 ms.
Running link step : cd /tmp/ltsmin12218657577182789636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12218657577182789636;'/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' '--hoa' '/tmp/stateBased13331139253799320753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 9 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-06 23:45:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-06 23:45:33] [INFO ] Computed 19 invariants in 4 ms
[2023-04-06 23:45:33] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-04-06 23:45:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:33] [INFO ] Invariant cache hit.
[2023-04-06 23:45:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-06 23:45:34] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2023-04-06 23:45:34] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-06 23:45:34] [INFO ] Invariant cache hit.
[2023-04-06 23:45:34] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1136 ms. Remains : 234/234 places, 966/966 transitions.
Built C files in :
/tmp/ltsmin10220630032768595790
[2023-04-06 23:45:34] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10220630032768595790
Running compilation step : cd /tmp/ltsmin10220630032768595790;'/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'
Compilation finished in 1501 ms.
Running link step : cd /tmp/ltsmin10220630032768595790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10220630032768595790;'/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' '--hoa' '/tmp/stateBased7841359394404889783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-06 23:45:49] [INFO ] Flatten gal took : 27 ms
[2023-04-06 23:45:49] [INFO ] Flatten gal took : 26 ms
[2023-04-06 23:45:49] [INFO ] Time to serialize gal into /tmp/LTL7301856437735729685.gal : 4 ms
[2023-04-06 23:45:49] [INFO ] Time to serialize properties into /tmp/LTL5216260032793671871.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/LTL7301856437735729685.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6079680355292353918.hoa' '-atoms' '/tmp/LTL5216260032793671871.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5216260032793671871.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6079680355292353918.hoa
Detected timeout of ITS tools.
[2023-04-06 23:46:04] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:46:04] [INFO ] Flatten gal took : 25 ms
[2023-04-06 23:46:04] [INFO ] Time to serialize gal into /tmp/LTL16847768406939631640.gal : 4 ms
[2023-04-06 23:46:04] [INFO ] Time to serialize properties into /tmp/LTL2634221337951766295.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/LTL16847768406939631640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2634221337951766295.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
Detected timeout of ITS tools.
[2023-04-06 23:46:19] [INFO ] Flatten gal took : 24 ms
[2023-04-06 23:46:19] [INFO ] Applying decomposition
[2023-04-06 23:46:19] [INFO ] Flatten gal took : 24 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/graph16056222944775447667.txt' '-o' '/tmp/graph16056222944775447667.bin' '-w' '/tmp/graph16056222944775447667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16056222944775447667.bin' '-l' '-1' '-v' '-w' '/tmp/graph16056222944775447667.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:46:19] [INFO ] Decomposing Gal with order
[2023-04-06 23:46:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:46:20] [INFO ] Removed a total of 1757 redundant transitions.
[2023-04-06 23:46:20] [INFO ] Flatten gal took : 66 ms
[2023-04-06 23:46:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 305 labels/synchronizations in 23 ms.
[2023-04-06 23:46:20] [INFO ] Time to serialize gal into /tmp/LTL6319221802906684081.gal : 5 ms
[2023-04-06 23:46:20] [INFO ] Time to serialize properties into /tmp/LTL6698451015909580042.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/LTL6319221802906684081.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6698451015909580042.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 : !((F(((G("(((i0.u3.turn_5==1)&&(i4.u1.flag_5_active==1))&&(i11.i0.u2.p25_2_1==1))"))||(G("(((i0.u3.turn_5==0)||(i4.u1.flag_5_active==0...350
Formula 0 simplified : G(F!"(((i0.u3.turn_5==0)||(i4.u1.flag_5_active==0))||(i1.u4.p25_4_1==0))" & X(!"(((i0.u3.turn_5==1)&&(i4.u1.flag_5_active==1))&&(i11...255
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin347046311566732476
[2023-04-06 23:46:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin347046311566732476
Running compilation step : cd /tmp/ltsmin347046311566732476;'/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'
Compilation finished in 1506 ms.
Running link step : cd /tmp/ltsmin347046311566732476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin347046311566732476;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 117371 ms.
[2023-04-06 23:46:50] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1212202817562430543
[2023-04-06 23:46:50] [INFO ] Computing symmetric may disable matrix : 1134 transitions.
[2023-04-06 23:46:50] [INFO ] Applying decomposition
[2023-04-06 23:46:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:46:50] [INFO ] Computing symmetric may enable matrix : 1134 transitions.
[2023-04-06 23:46:50] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-06 23:46:50] [INFO ] Flatten gal took : 26 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/graph4799625596864910218.txt' '-o' '/tmp/graph4799625596864910218.bin' '-w' '/tmp/graph4799625596864910218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4799625596864910218.bin' '-l' '-1' '-v' '-w' '/tmp/graph4799625596864910218.weights' '-q' '0' '-e' '0.001'
[2023-04-06 23:46:50] [INFO ] Decomposing Gal with order
[2023-04-06 23:46:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-06 23:46:50] [INFO ] Removed a total of 1899 redundant transitions.
[2023-04-06 23:46:50] [INFO ] Flatten gal took : 69 ms
[2023-04-06 23:46:50] [INFO ] Computing Do-Not-Accords matrix : 1134 transitions.
[2023-04-06 23:46:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 388 labels/synchronizations in 28 ms.
[2023-04-06 23:46:50] [INFO ] Time to serialize gal into /tmp/LTLFireability15941795623373651074.gal : 8 ms
[2023-04-06 23:46:50] [INFO ] Time to serialize properties into /tmp/LTLFireability7086122383393667617.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/LTLFireability15941795623373651074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7086122383393667617.ltl' '-c' '-stutter-deadlock'
[2023-04-06 23:46:50] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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
[2023-04-06 23:46:50] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1212202817562430543
Running compilation step : cd /tmp/ltsmin1212202817562430543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Checking formula 0 : !((F(((G("(((i13.u0.turn_5==1)&&(i8.i1.u91.flag_5_active==1))&&(i12.i2.u93.p25_2_1==1))"))||(G("(((i13.u0.turn_5==0)||(i8.i1.u91.flag_...377
Formula 0 simplified : G(F!"(((i13.u0.turn_5==0)||(i8.i1.u91.flag_5_active==0))||(i10.i0.u1.p25_4_1==0))" & X(!"(((i13.u0.turn_5==1)&&(i8.i1.u91.flag_5_act...276
Compilation finished in 3240 ms.
Running link step : cd /tmp/ltsmin1212202817562430543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1212202817562430543;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 1066629 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1411474 ms.

BK_STOP 1680825884106

--------------------
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-06"
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-06, 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-167987243600244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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