Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649612300211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is LamportFastMutEx-COL-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612300211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.6K Apr 13 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 07:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 07:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 13 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K May 18 16:42 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-3-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717224836166

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:53:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:53:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:53:57] [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.
[2024-06-01 06:53:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 06:53:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 564 ms
[2024-06-01 06:53:58] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 06:53:58] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-06-01 06:53:58] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 10528 steps (2 resets) in 154 ms. (67 steps per ms) remains 0/23 properties
[2024-06-01 06:53:58] [INFO ] Flatten gal took : 15 ms
[2024-06-01 06:53:58] [INFO ] Flatten gal took : 2 ms
Domain [pid(4), pid(4)] 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.
[2024-06-01 06:53:58] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 28 ms.
[2024-06-01 06:53:58] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Support contains 54 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 114/114 transitions.
Applied a total of 0 rules in 11 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:53:58] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-06-01 06:53:58] [INFO ] Computed 17 invariants in 10 ms
[2024-06-01 06:53:58] [INFO ] Implicit Places using invariants in 176 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 202 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 229 ms. Remains : 68/71 places, 114/114 transitions.
Support contains 54 out of 68 places after structural reductions.
[2024-06-01 06:53:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:53:58] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:53:58] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 3367 steps (0 resets) in 69 ms. (48 steps per ms) remains 0/23 properties
Computed a total of 1 stabilizing places and 3 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&X(X(G(p1))))))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:53:59] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-06-01 06:53:59] [INFO ] Computed 14 invariants in 7 ms
[2024-06-01 06:53:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 06:53:59] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:53:59] [INFO ] Invariant cache hit.
[2024-06-01 06:53:59] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:53:59] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:53:59] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:53:59] [INFO ] Invariant cache hit.
[2024-06-01 06:53:59] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 9 ms to minimize.
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4920 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 9 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:07] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 9146 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 14134ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 14148ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14360 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 315 ms.
Stack based approach found an accepted trace after 176 steps with 0 reset with depth 177 and stack size 176 in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-01 finished in 15071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 111
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 108
Applied a total of 12 rules in 17 ms. Remains 62 /68 variables (removed 6) and now considering 108/114 (removed 6) transitions.
[2024-06-01 06:54:14] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
// Phase 1: matrix 90 rows 62 cols
[2024-06-01 06:54:14] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 06:54:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 06:54:14] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2024-06-01 06:54:14] [INFO ] Invariant cache hit.
[2024-06-01 06:54:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:54:14] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-01 06:54:14] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-01 06:54:14] [INFO ] Flow matrix only has 90 transitions (discarded 18 similar events)
[2024-06-01 06:54:14] [INFO ] Invariant cache hit.
[2024-06-01 06:54:14] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 20/34 constraints. Problems are: Problem set: 16 solved, 89 unsolved
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 3/57 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/57 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 90/152 variables, 62/119 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 18/137 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 2/139 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/140 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/140 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:54:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/152 variables, 3/143 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/143 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/143 constraints. Problems are: Problem set: 18 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 143 constraints, problems are : Problem set: 18 solved, 87 unsolved in 4789 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 18 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 29/34 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 9/43 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 20/63 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/63 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 90/152 variables, 62/125 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 18/143 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 87/230 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 2/232 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:20] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 1/233 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/233 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/152 variables, 4/237 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/237 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/152 variables, 3/240 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 1/241 constraints. Problems are: Problem set: 18 solved, 87 unsolved
[2024-06-01 06:54:25] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/242 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 87 unsolved
At refinement iteration 18 (OVERLAPS) 0/152 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 242 constraints, problems are : Problem set: 18 solved, 87 unsolved in 7832 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 87/105 constraints, Known Traps: 61/61 constraints]
After SMT, in 12647ms problems are : Problem set: 18 solved, 87 unsolved
Search for dead transitions found 18 dead transitions in 12648ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/68 places, 90/114 transitions.
Applied a total of 0 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-06-01 06:54:27] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 12842 ms. Remains : 62/68 places, 90/114 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 56 steps with 0 reset with depth 57 and stack size 57 in 0 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-02 finished in 13057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:54:27] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-06-01 06:54:27] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 06:54:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 06:54:27] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:54:27] [INFO ] Invariant cache hit.
[2024-06-01 06:54:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:54:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:54:27] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:54:27] [INFO ] Invariant cache hit.
[2024-06-01 06:54:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4319 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:32] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:37] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 8745 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13090ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13092ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13233 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 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-3-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-04 finished in 13677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1) U G((p2 U p3))))))'
Support contains 9 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 111
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 111
Applied a total of 6 rules in 9 ms. Remains 65 /68 variables (removed 3) and now considering 111/114 (removed 3) transitions.
[2024-06-01 06:54:40] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 65 cols
[2024-06-01 06:54:40] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 06:54:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:54:41] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
[2024-06-01 06:54:41] [INFO ] Invariant cache hit.
[2024-06-01 06:54:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:54:41] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-01 06:54:41] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 06:54:41] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
[2024-06-01 06:54:41] [INFO ] Invariant cache hit.
[2024-06-01 06:54:41] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 20/34 constraints. Problems are: Problem set: 17 solved, 91 unsolved
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/56 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/61 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/63 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:54:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 93/158 variables, 65/131 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 18/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 149 constraints, problems are : Problem set: 18 solved, 90 unsolved in 4056 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 18 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 30/35 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 3/65 variables, 9/44 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 22/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 93/158 variables, 65/131 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 18/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 90/239 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/239 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/158 variables, 2/241 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/245 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/246 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:49] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/247 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/247 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:54:50] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/158 variables, 1/248 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 0/248 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 17 (OVERLAPS) 0/158 variables, 0/248 constraints. Problems are: Problem set: 18 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 248 constraints, problems are : Problem set: 18 solved, 90 unsolved in 7758 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 90/108 constraints, Known Traps: 61/61 constraints]
After SMT, in 11840ms problems are : Problem set: 18 solved, 90 unsolved
Search for dead transitions found 18 dead transitions in 11842ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/68 places, 93/114 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2024-06-01 06:54:52] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 12017 ms. Remains : 65/68 places, 93/114 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 237 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-05 finished in 12369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&X(G(p1))))'
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:54:53] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-06-01 06:54:53] [INFO ] Computed 14 invariants in 5 ms
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 06:54:53] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:54:53] [INFO ] Invariant cache hit.
[2024-06-01 06:54:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:54:53] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:54:53] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:54:53] [INFO ] Invariant cache hit.
[2024-06-01 06:54:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:53] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:54:56] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:56] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:57] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:54:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:54:59] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:54:59] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:55:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 8801 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13837ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13839ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13969 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-06 finished in 14135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||X(p1)) U (G((p0||X(p1)))||((p0||X(p1))&&(!p2||G(p3)))))))'
Support contains 30 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:55:07] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:55:07] [INFO ] Invariant cache hit.
[2024-06-01 06:55:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 06:55:07] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:55:07] [INFO ] Invariant cache hit.
[2024-06-01 06:55:07] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:55:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:55:07] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:55:07] [INFO ] Invariant cache hit.
[2024-06-01 06:55:07] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:55:08] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4200 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:13] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:17] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 8845 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13073ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13078ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13190 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-09
Product exploration explored 100000 steps with 5132 reset in 227 ms.
Product exploration explored 100000 steps with 5103 reset in 236 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT p3)), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 132 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 7312 steps (1 resets) in 119 ms. (60 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT p3)), (X p0), (X (NOT (AND p3 (NOT p0)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p3))), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 (NOT p3)))), (F (NOT p0)), (F p3), (F (NOT (AND p2 (NOT p3)))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p0 p1 p3)))]
Knowledge based reduction with 25 factoid took 589 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 30 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 06:55:22] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 68 cols
[2024-06-01 06:55:22] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 06:55:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:55:22] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-06-01 06:55:22] [INFO ] Invariant cache hit.
[2024-06-01 06:55:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 06:55:22] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-06-01 06:55:22] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-06-01 06:55:22] [INFO ] Invariant cache hit.
[2024-06-01 06:55:22] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 84/152 variables, 68/151 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 15/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 166 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4918 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 30/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 84/152 variables, 68/152 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 93/260 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:34] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/152 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/152 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/152 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 23 (OVERLAPS) 0/152 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 276 constraints, problems are : Problem set: 0 solved, 93 unsolved in 13679 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 86/86 constraints]
After SMT, in 18618ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 18619ms
Finished structural reductions in LTL mode , in 1 iterations and 18728 ms. Remains : 68/68 places, 96/96 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 p3))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 127 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
RANDOM walk for 4616 steps (0 resets) in 24 ms. (184 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND p2 (NOT p3) p0 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p2 p3))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p3)))), (F (NOT (AND (NOT p3) p2))), (F (NOT (OR (NOT p3) (NOT p2)))), (F (NOT p0)), (F p3), (F (NOT (OR p0 p3))), (F (NOT p1)), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p3)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p1 p3 (NOT p2))))]
Knowledge based reduction with 25 factoid took 591 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 5090 reset in 169 ms.
Product exploration explored 100000 steps with 5060 reset in 176 ms.
Support contains 30 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 06:55:43] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-06-01 06:55:43] [INFO ] Invariant cache hit.
[2024-06-01 06:55:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:55:43] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-06-01 06:55:43] [INFO ] Invariant cache hit.
[2024-06-01 06:55:43] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 06:55:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-06-01 06:55:43] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-06-01 06:55:43] [INFO ] Invariant cache hit.
[2024-06-01 06:55:43] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 84/152 variables, 68/151 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 15/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 166 constraints, problems are : Problem set: 0 solved, 93 unsolved in 4737 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 39/44 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 30/83 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 84/152 variables, 68/152 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 15/167 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 93/260 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/152 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/152 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/152 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 23 (OVERLAPS) 0/152 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 276 constraints, problems are : Problem set: 0 solved, 93 unsolved in 13503 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 86/86 constraints]
After SMT, in 18257ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 18260ms
Finished structural reductions in LTL mode , in 1 iterations and 18363 ms. Remains : 68/68 places, 96/96 transitions.
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-09 finished in 54224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U (G(p1) U p2)))))'
Support contains 18 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 111
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 111
Applied a total of 6 rules in 5 ms. Remains 65 /68 variables (removed 3) and now considering 111/114 (removed 3) transitions.
[2024-06-01 06:56:01] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
// Phase 1: matrix 93 rows 65 cols
[2024-06-01 06:56:01] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 06:56:01] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-01 06:56:01] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
[2024-06-01 06:56:01] [INFO ] Invariant cache hit.
[2024-06-01 06:56:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:56:01] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-01 06:56:01] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 06:56:01] [INFO ] Flow matrix only has 93 transitions (discarded 18 similar events)
[2024-06-01 06:56:01] [INFO ] Invariant cache hit.
[2024-06-01 06:56:01] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 20/34 constraints. Problems are: Problem set: 17 solved, 91 unsolved
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/56 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/61 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/63 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 93/158 variables, 65/131 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 18/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 149 constraints, problems are : Problem set: 18 solved, 90 unsolved in 4118 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 18 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 30/35 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 3 (OVERLAPS) 3/65 variables, 9/44 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 22/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 93/158 variables, 65/131 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 18/149 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 90/239 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/239 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/158 variables, 2/241 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 4/245 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/246 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:09] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/247 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/247 constraints. Problems are: Problem set: 18 solved, 90 unsolved
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/158 variables, 1/248 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 0/248 constraints. Problems are: Problem set: 18 solved, 90 unsolved
At refinement iteration 17 (OVERLAPS) 0/158 variables, 0/248 constraints. Problems are: Problem set: 18 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 248 constraints, problems are : Problem set: 18 solved, 90 unsolved in 7564 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 90/108 constraints, Known Traps: 61/61 constraints]
After SMT, in 11704ms problems are : Problem set: 18 solved, 90 unsolved
Search for dead transitions found 18 dead transitions in 11707ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 65/68 places, 93/114 transitions.
Applied a total of 0 rules in 9 ms. Remains 65 /65 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2024-06-01 06:56:13] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 11945 ms. Remains : 65/68 places, 93/114 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-10
Product exploration explored 100000 steps with 3397 reset in 163 ms.
Stack based approach found an accepted trace after 7027 steps with 232 reset with depth 45 and stack size 45 in 12 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-10 finished in 12343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 18 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:56:14] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 68 cols
[2024-06-01 06:56:14] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 06:56:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 06:56:14] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:14] [INFO ] Invariant cache hit.
[2024-06-01 06:56:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:56:14] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:56:14] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:14] [INFO ] Invariant cache hit.
[2024-06-01 06:56:14] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:14] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:24] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:56:25] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 9444 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13841ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13842ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13973 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-3-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-11 finished in 14327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&G(p2)))))'
Support contains 15 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:56:28] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:28] [INFO ] Invariant cache hit.
[2024-06-01 06:56:28] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:56:28] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:28] [INFO ] Invariant cache hit.
[2024-06-01 06:56:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:56:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:56:28] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:28] [INFO ] Invariant cache hit.
[2024-06-01 06:56:28] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:31] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4388 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 9016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13427ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13428ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13565 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-12 finished in 13825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:56:42] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:42] [INFO ] Invariant cache hit.
[2024-06-01 06:56:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 06:56:42] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:42] [INFO ] Invariant cache hit.
[2024-06-01 06:56:42] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:56:42] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:56:42] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:42] [INFO ] Invariant cache hit.
[2024-06-01 06:56:42] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:42] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:44] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4293 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:50] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:52] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 9021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13338ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13339ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13462 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-13
Product exploration explored 100000 steps with 4758 reset in 123 ms.
Stack based approach found an accepted trace after 4304 steps with 198 reset with depth 21 and stack size 21 in 11 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-13 finished in 13824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((G(p1) U (p0&&G(p1))))))))'
Support contains 9 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 06:56:56] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:56] [INFO ] Invariant cache hit.
[2024-06-01 06:56:56] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 06:56:56] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:56] [INFO ] Invariant cache hit.
[2024-06-01 06:56:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 06:56:56] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-06-01 06:56:56] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-01 06:56:56] [INFO ] Invariant cache hit.
[2024-06-01 06:56:56] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 20/34 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/54 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 10/64 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/65 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/133 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:56:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 2/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 153 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4352 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 35/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/68 variables, 9/49 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 18/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/164 variables, 68/135 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 18/153 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 93/246 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:57:01] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 4/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 5 ms to minimize.
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:57:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/164 variables, 3/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/256 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/164 variables, 1/257 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:57:07] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 2/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/164 variables, 0/259 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 259 constraints, problems are : Problem set: 18 solved, 93 unsolved in 9056 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 68/68 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 66/66 constraints]
After SMT, in 13433ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 13435ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 96/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13559 ms. Remains : 68/68 places, 96/114 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLCardinality-14
Product exploration explored 100000 steps with 4546 reset in 116 ms.
Stack based approach found an accepted trace after 529 steps with 23 reset with depth 23 and stack size 23 in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLCardinality-14 finished in 13777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0||X(p1)) U (G((p0||X(p1)))||((p0||X(p1))&&(!p2||G(p3)))))))'
[2024-06-01 06:57:09] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:57:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 06:57:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 114 transitions and 456 arcs took 4 ms.
Total runtime 192661 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA LamportFastMutEx-COL-3-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225030347

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name LamportFastMutEx-COL-3-LTLCardinality-09
ltl formula formula --ltl=/tmp/3759/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 114 transitions and 456 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3759/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3759/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3759/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3759/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 141 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~72 levels ~10000 states ~20272 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11619
pnml2lts-mc( 0/ 4): unique states count: 15443
pnml2lts-mc( 0/ 4): unique transitions count: 34950
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 15741
pnml2lts-mc( 0/ 4): - claim found count: 4247
pnml2lts-mc( 0/ 4): - claim success count: 15784
pnml2lts-mc( 0/ 4): - cum. max stack depth: 589
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15958 states 36578 transitions, fanout: 2.292
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 145073, Transitions per second: 332527
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 11.6 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 114 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

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-3"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-3, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612300211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;