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.r231-tall-167856416000388.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 lolaxred
Input is LamportFastMutEx-COL-8, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416000388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679449720904

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 01:48:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:48:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:48:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 01:48:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 01:48:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 440 ms
[2023-03-22 01:48:42] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 01:48:43] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2023-03-22 01:48:43] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-8-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 4049 steps, including 1 resets, run visited all 14 properties in 32 ms. (steps per millisecond=126 )
[2023-03-22 01:48:43] [INFO ] Flatten gal took : 14 ms
[2023-03-22 01:48:43] [INFO ] Flatten gal took : 3 ms
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 01:48:43] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 21 ms.
[2023-03-22 01:48:43] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-COL-8-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 194 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 14 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:48:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:48:43] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-22 01:48:43] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-22 01:48:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:48:43] [INFO ] Invariant cache hit.
[2023-03-22 01:48:43] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:48:43] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2023-03-22 01:48:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:48:43] [INFO ] Invariant cache hit.
[2023-03-22 01:48:44] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 194 out of 266 places after structural reductions.
[2023-03-22 01:48:44] [INFO ] Flatten gal took : 55 ms
[2023-03-22 01:48:44] [INFO ] Flatten gal took : 64 ms
[2023-03-22 01:48:44] [INFO ] Input system was already deterministic with 584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:48:44] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:48:44] [INFO ] Invariant cache hit.
[2023-03-22 01:48:44] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 01:48:45] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:48:45] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 01:48:45] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:48:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:48:45] [INFO ] After 156ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:48:45] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 4 ms to minimize.
[2023-03-22 01:48:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2023-03-22 01:48:46] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:48:47] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:48:48] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-22 01:48:49] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:48:50] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 5 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:48:51] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:48:52] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:48:53] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 7896 ms
[2023-03-22 01:48:53] [INFO ] After 8180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-22 01:48:53] [INFO ] After 8600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 25 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 44 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 258/266 places, 576/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1102367 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1102367 steps, saw 539263 distinct states, run finished after 3002 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:48:56] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 01:48:56] [INFO ] Computed 82 place invariants in 8 ms
[2023-03-22 01:48:56] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned sat
[2023-03-22 01:48:57] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:48:57] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 01:48:57] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:48:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:48:57] [INFO ] After 145ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:48:57] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-22 01:48:57] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:48:57] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:48:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 830 ms
[2023-03-22 01:48:58] [INFO ] After 1105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-22 01:48:58] [INFO ] After 1476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 25 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 31 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 258/258 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 01:48:58] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:48:58] [INFO ] Invariant cache hit.
[2023-03-22 01:48:58] [INFO ] Implicit Places using invariants in 153 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 155 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/258 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 180 ms. Remains : 250/258 places, 576/576 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1127787 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1127787 steps, saw 552433 distinct states, run finished after 3001 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:49:01] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2023-03-22 01:49:01] [INFO ] Computed 74 place invariants in 7 ms
[2023-03-22 01:49:02] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 01:49:02] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:02] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:02] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:02] [INFO ] After 123ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:02] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2023-03-22 01:49:02] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:49:02] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2023-03-22 01:49:03] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:49:04] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2023-03-22 01:49:04] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:49:04] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:49:04] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1534 ms
[2023-03-22 01:49:04] [INFO ] After 1772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-22 01:49:04] [INFO ] After 2142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 25 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 250/250 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 01:49:04] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:49:04] [INFO ] Invariant cache hit.
[2023-03-22 01:49:04] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-22 01:49:04] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:49:04] [INFO ] Invariant cache hit.
[2023-03-22 01:49:04] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:04] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-22 01:49:04] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-22 01:49:04] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:49:04] [INFO ] Invariant cache hit.
[2023-03-22 01:49:05] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 250/250 places, 576/576 transitions.
Graph (trivial) has 248 edges and 250 vertex of which 40 / 250 are part of one of the 8 SCC in 8 ms
Free SCC test removed 32 places
Drop transitions removed 96 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 208 transitions.
Graph (complete) has 664 edges and 218 vertex of which 209 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 209 transition count 304
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 66 place count 209 transition count 240
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 250 place count 89 transition count 240
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 266 place count 89 transition count 224
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 282 place count 73 transition count 224
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 290 place count 73 transition count 224
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 73 transition count 216
Applied a total of 298 rules in 53 ms. Remains 73 /250 variables (removed 177) and now considering 216/576 (removed 360) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 73 cols
[2023-03-22 01:49:05] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-22 01:49:05] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:05] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:05] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:05] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:49:05] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2023-03-22 01:49:05] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2023-03-22 01:49:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 106 ms
[2023-03-22 01:49:05] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-22 01:49:05] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||G(F(p2))))))'
Support contains 26 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:06] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:49:06] [INFO ] Computed 82 place invariants in 5 ms
[2023-03-22 01:49:06] [INFO ] Implicit Places using invariants in 144 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 145 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s9 1) (GEQ s80 1)) (AND (GEQ s14 1) (GEQ s81 1)) (AND (GEQ s9 1) (GEQ s78 1)) (AND (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s8 1) (GEQ s78 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6590 reset in 640 ms.
Product exploration explored 100000 steps with 6538 reset in 559 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 01:49:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 01:49:08] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 01:49:08] [INFO ] [Real]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 01:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:09] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-22 01:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:09] [INFO ] [Nat]Absence check using 74 positive place invariants in 35 ms returned sat
[2023-03-22 01:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:09] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-22 01:49:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 17 ms returned sat
[2023-03-22 01:49:09] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:49:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 797 ms
[2023-03-22 01:49:10] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 28 ms.
[2023-03-22 01:49:11] [INFO ] Added : 168 causal constraints over 34 iterations in 1060 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 26 out of 258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:11] [INFO ] Invariant cache hit.
[2023-03-22 01:49:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-22 01:49:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:11] [INFO ] Invariant cache hit.
[2023-03-22 01:49:11] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:12] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-22 01:49:12] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:12] [INFO ] Invariant cache hit.
[2023-03-22 01:49:12] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 258/258 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 01:49:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:13] [INFO ] Invariant cache hit.
[2023-03-22 01:49:13] [INFO ] [Real]Absence check using 74 positive place invariants in 43 ms returned sat
[2023-03-22 01:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:13] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-22 01:49:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:14] [INFO ] [Nat]Absence check using 74 positive place invariants in 34 ms returned sat
[2023-03-22 01:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:14] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-03-22 01:49:14] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:14] [INFO ] [Nat]Added 48 Read/Feed constraints in 19 ms returned sat
[2023-03-22 01:49:14] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:49:14] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:49:14] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:49:14] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:49:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1078 ms
[2023-03-22 01:49:15] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 01:49:16] [INFO ] Added : 193 causal constraints over 39 iterations in 1186 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6583 reset in 523 ms.
Product exploration explored 100000 steps with 6589 reset in 554 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 26 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 258 transition count 584
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 27 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:18] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 01:49:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 01:49:18] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 01:49:18] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/258 places, 584/584 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 258/258 places, 584/584 transitions.
Support contains 26 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 01:49:18] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 01:49:18] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-22 01:49:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:18] [INFO ] Invariant cache hit.
[2023-03-22 01:49:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:18] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-22 01:49:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:18] [INFO ] Invariant cache hit.
[2023-03-22 01:49:19] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLFireability-00 finished in 13119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:19] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:49:19] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 01:49:19] [INFO ] Implicit Places using invariants in 150 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 152 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-01 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: 1}]], initial=2, aps=[p0:(AND (OR (LT s18 1) (LT s226 1)) (OR (LT s20 1) (LT s228 1)) (OR (LT s22 1) (LT s230 1)) (OR (LT s24 1) (LT s232 1)) (OR (LT s19 1) (LT s227 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 255 ms.
Product exploration explored 100000 steps with 33333 reset in 263 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-01 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Support contains 25 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 18 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:49:20] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 01:49:20] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 01:49:20] [INFO ] Implicit Places using invariants in 149 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 150 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 250 transition count 568
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 12 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2023-03-22 01:49:20] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 01:49:20] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 01:49:20] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-22 01:49:20] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:20] [INFO ] Invariant cache hit.
[2023-03-22 01:49:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:20] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 661 ms. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s25 1) (GEQ s230 1)) (AND (GEQ s20 1) (GEQ s227 1)) (AND (GEQ s25 1) (GEQ s232 1)) (AND (GEQ s20 1) (GEQ s229 1)) (AND (GEQ s20 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 31141 reset in 1006 ms.
Product exploration explored 100000 steps with 31085 reset in 1010 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:49:23] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:23] [INFO ] Invariant cache hit.
[2023-03-22 01:49:23] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:23] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:23] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:23] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:24] [INFO ] After 154ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:24] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2023-03-22 01:49:24] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2023-03-22 01:49:24] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-22 01:49:24] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-22 01:49:24] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-22 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 649 ms
[2023-03-22 01:49:24] [INFO ] After 953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-22 01:49:25] [INFO ] After 1387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 31 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 242/242 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1029818 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1029818 steps, saw 507735 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:49:28] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:28] [INFO ] Invariant cache hit.
[2023-03-22 01:49:28] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:28] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:28] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:28] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:28] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:28] [INFO ] After 183ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:29] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 0 ms to minimize.
[2023-03-22 01:49:29] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2023-03-22 01:49:29] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-22 01:49:29] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-22 01:49:29] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-22 01:49:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 665 ms
[2023-03-22 01:49:29] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-22 01:49:29] [INFO ] After 1430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 19 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:49:29] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:29] [INFO ] Invariant cache hit.
[2023-03-22 01:49:30] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-22 01:49:30] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:30] [INFO ] Invariant cache hit.
[2023-03-22 01:49:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:30] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-22 01:49:30] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 01:49:30] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:30] [INFO ] Invariant cache hit.
[2023-03-22 01:49:30] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 242/242 places, 568/568 transitions.
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 242 transition count 400
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 242 transition count 336
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 352 place count 122 transition count 336
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 114 transition count 328
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 376 place count 106 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 384 place count 106 transition count 312
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 392 place count 106 transition count 304
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 400 place count 98 transition count 304
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 408 place count 98 transition count 296
Applied a total of 408 rules in 20 ms. Remains 98 /242 variables (removed 144) and now considering 296/568 (removed 272) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 98 cols
[2023-03-22 01:49:30] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-22 01:49:30] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:30] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:31] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:31] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-22 01:49:31] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 569 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-22 01:49:32] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 01:49:32] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 01:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:32] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-22 01:49:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:33] [INFO ] [Nat]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 01:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:33] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-22 01:49:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:33] [INFO ] [Nat]Added 48 Read/Feed constraints in 19 ms returned sat
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:49:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 612 ms
[2023-03-22 01:49:33] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 28 ms.
[2023-03-22 01:49:34] [INFO ] Added : 150 causal constraints over 30 iterations in 831 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:49:34] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:34] [INFO ] Invariant cache hit.
[2023-03-22 01:49:34] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-22 01:49:34] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:34] [INFO ] Invariant cache hit.
[2023-03-22 01:49:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:35] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-22 01:49:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 01:49:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:35] [INFO ] Invariant cache hit.
[2023-03-22 01:49:35] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 681 ms. Remains : 242/242 places, 568/568 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 308 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:49:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:35] [INFO ] Invariant cache hit.
[2023-03-22 01:49:36] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:36] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:36] [INFO ] [Nat]Absence check using 74 positive place invariants in 10 ms returned sat
[2023-03-22 01:49:36] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:36] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:36] [INFO ] After 157ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:37] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 0 ms to minimize.
[2023-03-22 01:49:37] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 0 ms to minimize.
[2023-03-22 01:49:37] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-22 01:49:37] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-22 01:49:37] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2023-03-22 01:49:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 646 ms
[2023-03-22 01:49:37] [INFO ] After 964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-22 01:49:37] [INFO ] After 1406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1040256 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1040256 steps, saw 512284 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:49:40] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:40] [INFO ] Invariant cache hit.
[2023-03-22 01:49:40] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:41] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:41] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 01:49:41] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:41] [INFO ] After 174ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:41] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2023-03-22 01:49:41] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2023-03-22 01:49:42] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-22 01:49:42] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-22 01:49:42] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-22 01:49:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 656 ms
[2023-03-22 01:49:42] [INFO ] After 978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 152 ms.
[2023-03-22 01:49:42] [INFO ] After 1415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 32 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:49:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:42] [INFO ] Invariant cache hit.
[2023-03-22 01:49:42] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-22 01:49:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:42] [INFO ] Invariant cache hit.
[2023-03-22 01:49:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:43] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-22 01:49:43] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 01:49:43] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:43] [INFO ] Invariant cache hit.
[2023-03-22 01:49:43] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 681 ms. Remains : 242/242 places, 568/568 transitions.
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 242 transition count 400
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 242 transition count 336
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 352 place count 122 transition count 336
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 368 place count 114 transition count 328
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 376 place count 106 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 384 place count 106 transition count 312
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 392 place count 106 transition count 304
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 400 place count 98 transition count 304
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 408 place count 98 transition count 296
Applied a total of 408 rules in 13 ms. Remains 98 /242 variables (removed 144) and now considering 296/568 (removed 272) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 98 cols
[2023-03-22 01:49:43] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-22 01:49:43] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-22 01:49:43] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 01:49:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-22 01:49:43] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 01:49:43] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-22 01:49:44] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 372 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-22 01:49:44] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 01:49:44] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 01:49:44] [INFO ] [Real]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 01:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:45] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-22 01:49:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:49:45] [INFO ] [Nat]Absence check using 74 positive place invariants in 26 ms returned sat
[2023-03-22 01:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:49:45] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-22 01:49:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:45] [INFO ] [Nat]Added 48 Read/Feed constraints in 20 ms returned sat
[2023-03-22 01:49:45] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-22 01:49:45] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:49:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 601 ms
[2023-03-22 01:49:46] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 01:49:47] [INFO ] Added : 150 causal constraints over 30 iterations in 814 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 31110 reset in 819 ms.
Product exploration explored 100000 steps with 31176 reset in 823 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:49:48] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:48] [INFO ] Invariant cache hit.
[2023-03-22 01:49:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-22 01:49:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:49] [INFO ] Invariant cache hit.
[2023-03-22 01:49:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:49:49] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-22 01:49:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 01:49:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:49:49] [INFO ] Invariant cache hit.
[2023-03-22 01:49:49] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 242/242 places, 568/568 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLFireability-02 finished in 29564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p1&&G((F(p2) U p3))))||p0))))'
Support contains 130 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:49:49] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 01:49:49] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-22 01:49:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:49] [INFO ] Invariant cache hit.
[2023-03-22 01:49:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:49:50] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-22 01:49:50] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:50] [INFO ] Invariant cache hit.
[2023-03-22 01:49:50] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(NOT p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s32 1) (GEQ s85 1)) (AND (GEQ s37 1) (GEQ s87 1)) (AND (GEQ s34 1) (GEQ s86 1)) (AND (GEQ s27 1) (GEQ s82 1)) (AND (GEQ s29 1) (GEQ s83 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 719 reset in 974 ms.
Stack based approach found an accepted trace after 4960 steps with 28 reset with depth 180 and stack size 180 in 51 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-03 finished in 1936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)&&p0)))))'
Support contains 96 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:51] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:51] [INFO ] Invariant cache hit.
[2023-03-22 01:49:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 01:49:51] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:51] [INFO ] Invariant cache hit.
[2023-03-22 01:49:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:49:51] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-22 01:49:51] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:51] [INFO ] Invariant cache hit.
[2023-03-22 01:49:52] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (OR (LT s32 1) (LT s125 1) (LT s165 1)) (OR (LT s30 1) (LT s156 1) (LT s169 1)) (OR (LT s26 1) (LT s122 1) (LT s165 1)) (OR (LT s34 1) (LT s150 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-04 finished in 825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U G(p2))&&X(X(p3)))))'
Support contains 57 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:49:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:49:52] [INFO ] Invariant cache hit.
[2023-03-22 01:49:52] [INFO ] Implicit Places using invariants in 135 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 136 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 143 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 761 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 8}, { cond=(AND p2 p1), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 9}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=4 dest: 10}, { cond=(OR p2 p1), acceptance={0} source=4 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 12}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 14}, { cond=(AND p2 p1), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=8 dest: 2}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=8 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=8 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=9 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}], [{ cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=11 dest: 8}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=11 dest: 10}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=11 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 12}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=12 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=12 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=13 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=13 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=13 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=13 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=13 dest: 6}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 14}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=14 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=14 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 8}, { cond=(AND p2 p1), acceptance={} source=15 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=15 dest: 10}, { cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=15 dest: 12}, { cond=(AND p2 (NOT p1)), acceptance={} source=15 dest: 13}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=15 dest: 16}, { cond=(AND p2 p1), acceptance={} source=15 dest: 17}], [{ cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=16 dest: 7}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=16 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=17 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=17 dest: 8}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=17 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=17 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=17 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=17 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=17 dest: 12}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=17 dest: 13}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=17 dest: 16}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=17 dest: 17}]], initial=0, aps=[p2:(OR (AND (GEQ s18 1) (GEQ s73 1)) (AND (GEQ s18 1) (GEQ s71 1)) (AND (GEQ s17 1) (GEQ s67 1)) (AND (GEQ s23 1) (GEQ s66 1)) (AND (GEQ s17 1) (GEQ s69 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11291 reset in 1027 ms.
Product exploration explored 100000 steps with 11258 reset in 1022 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))))]
Knowledge based reduction with 34 factoid took 4090 ms. Reduced automaton from 18 states, 96 edges and 4 AP (stutter sensitive) to 18 states, 96 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 799 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 01:50:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 01:50:00] [INFO ] Computed 74 place invariants in 5 ms
[2023-03-22 01:50:01] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT (AND p2 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (OR p2 p1))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (G (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 (NOT p2) (NOT p3)))), (G (NOT (AND p1 p2 (NOT p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 (NOT p0) (NOT p3))), (F (OR p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p2)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F p0), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND p1 p2 (NOT p0))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (OR (AND p1 (NOT p0) (NOT p3)) (AND p2 (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p2 (NOT p0)))]
Knowledge based reduction with 38 factoid took 5246 ms. Reduced automaton from 18 states, 96 edges and 4 AP (stutter sensitive) to 14 states, 58 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 804 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 626 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
[2023-03-22 01:50:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:07] [INFO ] Invariant cache hit.
[2023-03-22 01:50:08] [INFO ] [Real]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 01:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:08] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-22 01:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:50:08] [INFO ] [Nat]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 01:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:08] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-22 01:50:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:08] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2023-03-22 01:50:08] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 22 ms.
[2023-03-22 01:50:08] [INFO ] Added : 1 causal constraints over 1 iterations in 69 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-22 01:50:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:08] [INFO ] Invariant cache hit.
[2023-03-22 01:50:09] [INFO ] [Real]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 01:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:09] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-22 01:50:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:50:09] [INFO ] [Nat]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 01:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:09] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2023-03-22 01:50:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2023-03-22 01:50:09] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:50:09] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:50:10] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:50:10] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2023-03-22 01:50:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2023-03-22 01:50:10] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 24 ms.
[2023-03-22 01:50:10] [INFO ] Added : 138 causal constraints over 29 iterations in 807 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 57 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:10] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:10] [INFO ] Invariant cache hit.
[2023-03-22 01:50:11] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-22 01:50:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:11] [INFO ] Invariant cache hit.
[2023-03-22 01:50:11] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:11] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-22 01:50:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:11] [INFO ] Invariant cache hit.
[2023-03-22 01:50:11] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 583 ms. Remains : 258/258 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 p3) p2))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 p3) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))))]
Knowledge based reduction with 29 factoid took 5436 ms. Reduced automaton from 14 states, 58 edges and 4 AP (stutter sensitive) to 14 states, 58 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 789 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Finished random walk after 20 steps, including 0 resets, run visited all 19 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 p3) p2))), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 p3) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) p2)), (F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND p3 p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p3) p2)), (F (AND (NOT p0) (NOT p3) p2)), (F (AND p1 p2)), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 29 factoid took 6030 ms. Reduced automaton from 14 states, 58 edges and 4 AP (stutter sensitive) to 14 states, 58 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 641 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 612 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
[2023-03-22 01:50:25] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:25] [INFO ] Invariant cache hit.
[2023-03-22 01:50:25] [INFO ] [Real]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 01:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:25] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-22 01:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:50:26] [INFO ] [Nat]Absence check using 74 positive place invariants in 21 ms returned sat
[2023-03-22 01:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:26] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-22 01:50:26] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:26] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2023-03-22 01:50:26] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 23 ms.
[2023-03-22 01:50:26] [INFO ] Added : 1 causal constraints over 1 iterations in 77 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-22 01:50:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:26] [INFO ] Invariant cache hit.
[2023-03-22 01:50:26] [INFO ] [Real]Absence check using 74 positive place invariants in 22 ms returned sat
[2023-03-22 01:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:26] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-22 01:50:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:50:26] [INFO ] [Nat]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 01:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:27] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-22 01:50:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:27] [INFO ] [Nat]Added 48 Read/Feed constraints in 16 ms returned sat
[2023-03-22 01:50:27] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:50:27] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:50:27] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:50:27] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2023-03-22 01:50:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 404 ms
[2023-03-22 01:50:27] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 22 ms.
[2023-03-22 01:50:28] [INFO ] Added : 138 causal constraints over 29 iterations in 779 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 641 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 11375 reset in 998 ms.
Product exploration explored 100000 steps with 11253 reset in 1012 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 642 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Support contains 57 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:50:31] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:31] [INFO ] Invariant cache hit.
[2023-03-22 01:50:31] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 258/258 places, 584/584 transitions.
Support contains 57 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:31] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:31] [INFO ] Invariant cache hit.
[2023-03-22 01:50:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 01:50:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:32] [INFO ] Invariant cache hit.
[2023-03-22 01:50:32] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:32] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-22 01:50:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:32] [INFO ] Invariant cache hit.
[2023-03-22 01:50:32] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLFireability-06 finished in 40137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p1) U X(X(!F(X(((p1 U p0)&&p2)))))))'
Support contains 48 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:50:32] [INFO ] Computed 82 place invariants in 4 ms
[2023-03-22 01:50:32] [INFO ] Implicit Places using invariants in 148 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 149 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 451 ms :[(AND p0 p2), (AND p1 p0 p2), (AND p0 p2), (AND p0 p2), true, (AND p0 (NOT p2)), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2 p1), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=p1, acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 p1 p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 9}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 9}]], initial=7, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s80 1)) (AND (GEQ s16 1) (GEQ s81 1)) (AND (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s10 1) (GEQ s75 1)) (AND (GEQ s11 1) (GEQ s76 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2582 steps with 5 reset in 12 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-07 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(!p1)&&p0))||G(!p1)))'
Support contains 41 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:33] [INFO ] Invariant cache hit.
[2023-03-22 01:50:33] [INFO ] Implicit Places using invariants in 143 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 144 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, p1, (OR (NOT p0) p1), p1, p1, p1]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(OR (AND (GEQ s36 1) (GEQ s255 1)) (AND (GEQ s26 1) (GEQ s250 1)) (AND (GEQ s41 1) (GEQ s257 1)) (AND (GEQ s29 1) (GEQ s251 1)) (AND (GEQ s39 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 620 ms.
Product exploration explored 100000 steps with 50000 reset in 620 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 p0)))
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-8-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLFireability-08 finished in 1732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 17 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 13 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:50:34] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 01:50:34] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 01:50:35] [INFO ] Implicit Places using invariants in 149 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 150 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/584 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 250/266 places, 576/584 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s19 1) (GEQ s225 1)) (AND (GEQ s19 1) (GEQ s223 1)) (AND (GEQ s24 1) (GEQ s218 1)) (AND (GEQ s18 1) (GEQ s219 1)) (AND (GEQ s24 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1123 reset in 477 ms.
Stack based approach found an accepted trace after 37747 steps with 400 reset with depth 204 and stack size 204 in 184 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-09 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 17 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:50:35] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 01:50:35] [INFO ] Implicit Places using invariants in 161 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 161 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s11 1) (LT s47 1)) (OR (LT s16 1) (LT s48 1)) (OR (LT s11 1) (LT s45 1)) (OR (LT s11 1) (LT s43 1)) (OR (LT s16 1) (LT s44 1)) (OR (LT s16...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-10 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 25 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:36] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:36] [INFO ] Invariant cache hit.
[2023-03-22 01:50:36] [INFO ] Implicit Places using invariants in 150 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 151 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 1 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s19 1) (GEQ s233 1)) (AND (GEQ s19 1) (GEQ s231 1)) (AND (GEQ s24 1) (GEQ s226 1)) (AND (GEQ s18 1) (GEQ s227 1)) (AND (GEQ s24 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-11 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(!p0)&&(F(p2)||p1))) U X(p3)))'
Support contains 105 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:36] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:36] [INFO ] Invariant cache hit.
[2023-03-22 01:50:36] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-22 01:50:36] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:36] [INFO ] Invariant cache hit.
[2023-03-22 01:50:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:50:36] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-22 01:50:36] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:36] [INFO ] Invariant cache hit.
[2023-03-22 01:50:36] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p3), (NOT p3), (AND p1 (NOT p2) (NOT p3)), true, (NOT p2), (OR p0 (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 5}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s18 1) (GEQ s234 1)) (AND (GEQ s20 1) (GEQ s236 1)) (AND (GEQ s22 1) (GEQ s238 1)) (AND (GEQ s24 1) (GEQ s240 1)) (AND (GEQ s19 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-12 finished in 830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 24 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:37] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:37] [INFO ] Invariant cache hit.
[2023-03-22 01:50:37] [INFO ] Implicit Places using invariants in 152 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 153 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 161 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-13 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (LT s91 1) (LT s90 1) (LT s93 1) (LT s92 1) (LT s96 1) (LT s94 1) (LT s97 1) (LT s95 1)) (AND (OR (LT s15 1) (LT s80 1)) (OR (LT s16 1) (LT s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLFireability-13 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 8 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:50:37] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:50:37] [INFO ] Invariant cache hit.
[2023-03-22 01:50:37] [INFO ] Implicit Places using invariants in 161 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 162 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 576
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 576
Applied a total of 16 rules in 8 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:50:37] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2023-03-22 01:50:37] [INFO ] Computed 74 place invariants in 1 ms
[2023-03-22 01:50:37] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-22 01:50:37] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:37] [INFO ] Invariant cache hit.
[2023-03-22 01:50:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:38] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/266 places, 576/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 724 ms. Remains : 250/266 places, 576/584 transitions.
Stuttering acceptance computed with spot in 57 ms :[p0, p0]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s91 1) (GEQ s90 1) (GEQ s93 1) (GEQ s92 1) (GEQ s96 1) (GEQ s94 1) (GEQ s97 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2536 reset in 243 ms.
Product exploration explored 100000 steps with 2528 reset in 254 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 01:50:39] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:39] [INFO ] Invariant cache hit.
[2023-03-22 01:50:39] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-22 01:50:39] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:39] [INFO ] Invariant cache hit.
[2023-03-22 01:50:39] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:39] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-22 01:50:39] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 01:50:39] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:39] [INFO ] Invariant cache hit.
[2023-03-22 01:50:39] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 250/250 places, 576/576 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Product exploration explored 100000 steps with 2554 reset in 242 ms.
Product exploration explored 100000 steps with 2505 reset in 251 ms.
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 01:50:40] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:40] [INFO ] Invariant cache hit.
[2023-03-22 01:50:41] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-22 01:50:41] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:41] [INFO ] Invariant cache hit.
[2023-03-22 01:50:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:41] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-22 01:50:41] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 01:50:41] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:50:41] [INFO ] Invariant cache hit.
[2023-03-22 01:50:41] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 768 ms. Remains : 250/250 places, 576/576 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLFireability-14 finished in 4274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)||G(F(p2))))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-8-LTLFireability-00
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 26 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 9 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:50:41] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 01:50:41] [INFO ] Computed 82 place invariants in 1 ms
[2023-03-22 01:50:42] [INFO ] Implicit Places using invariants in 135 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 135 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/266 places, 576/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 250 transition count 568
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 7 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2023-03-22 01:50:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 01:50:42] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 01:50:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 01:50:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:42] [INFO ] Invariant cache hit.
[2023-03-22 01:50:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:42] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 595 ms. Remains : 242/266 places, 568/584 transitions.
Running random walk in product with property : LamportFastMutEx-COL-8-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s9 1) (GEQ s80 1)) (AND (GEQ s14 1) (GEQ s81 1)) (AND (GEQ s9 1) (GEQ s78 1)) (AND (GEQ s8 1) (GEQ s76 1)) (AND (GEQ s8 1) (GEQ s78 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6576 reset in 544 ms.
Product exploration explored 100000 steps with 6541 reset in 543 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 01:50:44] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:44] [INFO ] Invariant cache hit.
[2023-03-22 01:50:44] [INFO ] [Real]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 01:50:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:44] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-22 01:50:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:50:45] [INFO ] [Nat]Absence check using 74 positive place invariants in 26 ms returned sat
[2023-03-22 01:50:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:45] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2023-03-22 01:50:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:45] [INFO ] [Nat]Added 48 Read/Feed constraints in 22 ms returned sat
[2023-03-22 01:50:45] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2023-03-22 01:50:45] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:50:45] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2023-03-22 01:50:46] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2023-03-22 01:50:47] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 01:50:47] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-22 01:50:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1460 ms
[2023-03-22 01:50:47] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2023-03-22 01:50:47] [INFO ] Added : 143 causal constraints over 29 iterations in 802 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 26 out of 242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 2 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:50:47] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:47] [INFO ] Invariant cache hit.
[2023-03-22 01:50:48] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 01:50:48] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:48] [INFO ] Invariant cache hit.
[2023-03-22 01:50:48] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:48] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-22 01:50:48] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:48] [INFO ] Invariant cache hit.
[2023-03-22 01:50:48] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 242/242 places, 568/568 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 01:50:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:49] [INFO ] Invariant cache hit.
[2023-03-22 01:50:49] [INFO ] [Real]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 01:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:50] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-22 01:50:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:50:50] [INFO ] [Nat]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 01:50:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:50:50] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-22 01:50:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:50] [INFO ] [Nat]Added 48 Read/Feed constraints in 18 ms returned sat
[2023-03-22 01:50:50] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2023-03-22 01:50:50] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-22 01:50:50] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-22 01:50:51] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:50:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:50:52] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-22 01:50:52] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1441 ms
[2023-03-22 01:50:52] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 21 ms.
[2023-03-22 01:50:52] [INFO ] Added : 143 causal constraints over 29 iterations in 811 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6591 reset in 546 ms.
Product exploration explored 100000 steps with 6572 reset in 551 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 26 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:50:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:50:54] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:54] [INFO ] Invariant cache hit.
[2023-03-22 01:50:54] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 242/242 places, 568/568 transitions.
Support contains 26 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 2 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 01:50:54] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:54] [INFO ] Invariant cache hit.
[2023-03-22 01:50:54] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-22 01:50:54] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:54] [INFO ] Invariant cache hit.
[2023-03-22 01:50:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:50:55] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-22 01:50:55] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:50:55] [INFO ] Invariant cache hit.
[2023-03-22 01:50:55] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 242/242 places, 568/568 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLFireability-00 finished in 13479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U G(p2))&&X(X(p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
[2023-03-22 01:50:55] [INFO ] Flatten gal took : 32 ms
[2023-03-22 01:50:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-22 01:50:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 584 transitions and 2560 arcs took 3 ms.
Total runtime 133295 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LamportFastMutEx-COL-8
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA LamportFastMutEx-COL-8-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-8-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-8-LTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-8-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679449880961

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 LamportFastMutEx-COL-8-LTLFireability-00
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for LamportFastMutEx-COL-8-LTLFireability-00
lola: result : false
lola: markings : 16
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 LamportFastMutEx-COL-8-LTLFireability-02
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for LamportFastMutEx-COL-8-LTLFireability-02
lola: result : false
lola: markings : 16
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 LamportFastMutEx-COL-8-LTLFireability-06
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLFireability-00: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1799 4/32 LamportFastMutEx-COL-8-LTLFireability-06 543747 m, 108749 m/sec, 3015312 t fired, .

Time elapsed: 6 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLFireability-00: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1799 8/32 LamportFastMutEx-COL-8-LTLFireability-06 1092712 m, 109793 m/sec, 6109848 t fired, .

Time elapsed: 11 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLFireability-00: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1799 11/32 LamportFastMutEx-COL-8-LTLFireability-06 1571863 m, 95830 m/sec, 9110032 t fired, .

Time elapsed: 16 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 7 (type EXCL) for LamportFastMutEx-COL-8-LTLFireability-06
lola: result : false
lola: markings : 1756903
lola: fired transitions : 10291914
lola: time used : 17.000000
lola: memory pages used : 13
lola: LAUNCH task # 10 (type EXCL) for 9 LamportFastMutEx-COL-8-LTLFireability-14
lola: time limit : 3582 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLFireability-00: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-02: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 3/3582 1/32 LamportFastMutEx-COL-8-LTLFireability-14 113702 m, 22740 m/sec, 375029 t fired, .

Time elapsed: 21 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 10 (type EXCL) for LamportFastMutEx-COL-8-LTLFireability-14
lola: result : false
lola: markings : 239141
lola: fired transitions : 780259
lola: time used : 6.000000
lola: memory pages used : 2
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLFireability-00: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-02: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-06: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLFireability-14: LTL false LTL model checker


Time elapsed: 24 secs. Pages in use: 13

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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is LamportFastMutEx-COL-8, 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 r231-tall-167856416000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;