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.r224-tall-171649612300212.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 itstools
Input is LamportFastMutEx-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-171649612300212
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716561729075

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-24 14:42:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 14:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:42:10] [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-05-24 14:42:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 14:42:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 565 ms
[2024-05-24 14:42:11] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 14:42:11] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 12 ms.
[2024-05-24 14:42:11] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 4 formulas.
FORMULA LamportFastMutEx-COL-3-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 490 steps (0 resets) in 38 ms. (12 steps per ms) remains 0/12 properties
[2024-05-24 14:42:11] [INFO ] Flatten gal took : 14 ms
[2024-05-24 14:42:11] [INFO ] Flatten gal took : 3 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-05-24 14:42:11] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 24 ms.
[2024-05-24 14:42:11] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 42 transitions.
FORMULA LamportFastMutEx-COL-3-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 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 6 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 14:42:11] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-05-24 14:42:11] [INFO ] Computed 17 invariants in 14 ms
[2024-05-24 14:42:11] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-24 14:42:11] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 14:42:11] [INFO ] Invariant cache hit.
[2024-05-24 14:42:11] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 14:42:11] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 14:42:11] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 14:42:11] [INFO ] Invariant cache hit.
[2024-05-24 14:42:11] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 21 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-24 14:42:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 4 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:13] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/57 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 9/66 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/71 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:15] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 96/167 variables, 71/144 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 27/171 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/171 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/171 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 171 constraints, problems are : Problem set: 18 solved, 93 unsolved in 5089 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 34/39 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/39 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/51 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 22/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-05-24 14:42:17] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/75 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/75 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 96/167 variables, 71/146 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 27/173 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 93/266 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:18] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-24 14:42:18] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 3/269 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:42:19] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/271 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:19] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-24 14:42:19] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/273 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:42:20] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/275 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 14:42:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:42:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:42:21] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 3/278 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/278 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/167 variables, 0/278 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 278 constraints, problems are : Problem set: 18 solved, 93 unsolved in 7073 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 70/70 constraints]
After SMT, in 12255ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 12273ms
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 : 71/71 places, 96/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12575 ms. Remains : 71/71 places, 96/114 transitions.
Support contains 65 out of 71 places after structural reductions.
[2024-05-24 14:42:24] [INFO ] Flatten gal took : 12 ms
[2024-05-24 14:42:24] [INFO ] Flatten gal took : 13 ms
[2024-05-24 14:42:24] [INFO ] Input system was already deterministic with 96 transitions.
Reduction of identical properties reduced properties to check from 16 to 14
RANDOM walk for 116 steps (0 resets) in 23 ms. (4 steps per ms) remains 0/14 properties
FORMULA LamportFastMutEx-COL-3-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X(G((p0||G(p1)))))'
Support contains 10 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:42:24] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 14:42:24] [INFO ] Computed 17 invariants in 5 ms
[2024-05-24 14:42:24] [INFO ] Implicit Places using invariants in 293 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 297 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 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.
Finished structural reductions in LTL mode , in 2 iterations and 302 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-03
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 2 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-03 finished in 592 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 U G(p1))))'
Support contains 18 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:42:24] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:24] [INFO ] Invariant cache hit.
[2024-05-24 14:42:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 14:42:25] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:25] [INFO ] Invariant cache hit.
[2024-05-24 14:42:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 14:42:25] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-24 14:42:25] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:25] [INFO ] Invariant cache hit.
[2024-05-24 14:42:25] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 3/71 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 14:42:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:27] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:28] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:29] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:29] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:29] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 84/155 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 24/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 179 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5984 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
[2024-05-24 14:42:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 84/155 variables, 71/162 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 24/186 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 93/279 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:33] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:42:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:33] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:42:34] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 284 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5905 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 79/79 constraints]
After SMT, in 11921ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 11932ms
Finished structural reductions in LTL mode , in 1 iterations and 12093 ms. Remains : 71/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-05 finished in 12266 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 19 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 14 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:42:37] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:37] [INFO ] Invariant cache hit.
[2024-05-24 14:42:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 14:42:37] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:37] [INFO ] Invariant cache hit.
[2024-05-24 14:42:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 14:42:37] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-24 14:42:37] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-24 14:42:37] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:37] [INFO ] Invariant cache hit.
[2024-05-24 14:42:37] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 3/71 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:42:37] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:42:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:42:39] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:40] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:41] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:41] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:42:41] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:41] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 84/155 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 24/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 179 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5769 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:43] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 84/155 variables, 71/162 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 24/186 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 93/279 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:45] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:42:45] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:45] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:46] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 284 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5896 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 79/79 constraints]
After SMT, in 11691ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 11693ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11855 ms. Remains : 71/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 264 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-07 finished in 12269 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' '!(G(F(p0)))'
Support contains 9 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 68 transition count 93
Applied a total of 6 rules in 15 ms. Remains 68 /71 variables (removed 3) and now considering 93/96 (removed 3) transitions.
[2024-05-24 14:42:49] [INFO ] Flow matrix only has 81 transitions (discarded 12 similar events)
// Phase 1: matrix 81 rows 68 cols
[2024-05-24 14:42:49] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 14:42:49] [INFO ] Implicit Places using invariants in 48 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/71 places, 93/96 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 65 transition count 90
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 62 transition count 90
Applied a total of 6 rules in 8 ms. Remains 62 /65 variables (removed 3) and now considering 90/93 (removed 3) transitions.
[2024-05-24 14:42:49] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 62 cols
[2024-05-24 14:42:49] [INFO ] Computed 14 invariants in 3 ms
[2024-05-24 14:42:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 14:42:49] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:42:49] [INFO ] Invariant cache hit.
[2024-05-24 14:42:49] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:42:49] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/71 places, 90/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 62/71 places, 90/96 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-08
Product exploration explored 100000 steps with 3496 reset in 177 ms.
Stack based approach found an accepted trace after 44125 steps with 1546 reset with depth 35 and stack size 35 in 92 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-08 finished in 558 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(G(p0))&&(p0||X(p1)))))'
Support contains 21 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:42:50] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 14:42:50] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 14:42:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 14:42:50] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:50] [INFO ] Invariant cache hit.
[2024-05-24 14:42:50] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 14:42:50] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2024-05-24 14:42:50] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:42:50] [INFO ] Invariant cache hit.
[2024-05-24 14:42:50] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 3/71 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:50] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-24 14:42:51] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:53] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:54] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:42:54] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:42:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 84/155 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 24/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 179 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5833 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:42:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 84/155 variables, 71/162 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 24/186 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 93/279 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:42:58] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:58] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:42:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:42:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 284 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5982 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 79/79 constraints]
After SMT, in 11858ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 11860ms
Finished structural reductions in LTL mode , in 1 iterations and 11981 ms. Remains : 71/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 183 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-09 finished in 12468 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' '!(((!p0 U G(p1))||F((G(p3)||p2))))'
Support contains 24 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:43:02] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:43:02] [INFO ] Invariant cache hit.
[2024-05-24 14:43:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 14:43:02] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:43:02] [INFO ] Invariant cache hit.
[2024-05-24 14:43:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 14:43:02] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-24 14:43:02] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-24 14:43:02] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:43:02] [INFO ] Invariant cache hit.
[2024-05-24 14:43:02] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 3/71 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:43:03] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:04] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 3 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:06] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 13 (OVERLAPS) 84/155 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 24/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/155 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 179 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5753 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 32/84 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:08] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:43:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:43:08] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:09] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 84/155 variables, 71/162 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 24/186 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 93/279 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:11] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 14:43:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-24 14:43:12] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 15 (OVERLAPS) 0/155 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 284 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5839 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 79/79 constraints]
After SMT, in 11614ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 11616ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11780 ms. Remains : 71/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-10
Product exploration explored 100000 steps with 5520 reset in 324 ms.
Stack based approach found an accepted trace after 360 steps with 19 reset with depth 18 and stack size 18 in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-10 finished in 12267 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' '!(G(F(p0)))'
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 68 transition count 93
Applied a total of 6 rules in 9 ms. Remains 68 /71 variables (removed 3) and now considering 93/96 (removed 3) transitions.
[2024-05-24 14:43:14] [INFO ] Flow matrix only has 81 transitions (discarded 12 similar events)
// Phase 1: matrix 81 rows 68 cols
[2024-05-24 14:43:14] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 14:43:14] [INFO ] Implicit Places using invariants in 50 ms returned [44, 45, 46]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/71 places, 93/96 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 65 transition count 90
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 62 transition count 90
Applied a total of 6 rules in 5 ms. Remains 62 /65 variables (removed 3) and now considering 90/93 (removed 3) transitions.
[2024-05-24 14:43:14] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 62 cols
[2024-05-24 14:43:14] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 14:43:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 14:43:14] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:14] [INFO ] Invariant cache hit.
[2024-05-24 14:43:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/71 places, 90/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 62/71 places, 90/96 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-11
Product exploration explored 100000 steps with 5884 reset in 143 ms.
Product exploration explored 100000 steps with 5843 reset in 153 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 70 steps (0 resets) in 6 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-24 14:43:15] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:15] [INFO ] Invariant cache hit.
[2024-05-24 14:43:15] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 14:43:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 14:43:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:43:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 14:43:15] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 14:43:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:15] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-24 14:43:15] [INFO ] Computed and/alt/rep : 66/219/66 causal constraints (skipped 9 transitions) in 6 ms.
[2024-05-24 14:43:15] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-24 14:43:15] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:15] [INFO ] Invariant cache hit.
[2024-05-24 14:43:16] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 14:43:16] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:16] [INFO ] Invariant cache hit.
[2024-05-24 14:43:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:16] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-24 14:43:16] [INFO ] Redundant transitions in 4 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-24 14:43:16] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:16] [INFO ] Invariant cache hit.
[2024-05-24 14:43:16] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 14:43:19] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 78/140 variables, 62/147 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 15/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/140 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 162 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4949 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 41/85 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:22] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:22] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-24 14:43:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 78/140 variables, 62/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 15/174 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 87/261 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:23] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:23] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:24] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:43:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:25] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/140 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/140 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 18 (OVERLAPS) 0/140 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 266 constraints, problems are : Problem set: 0 solved, 87 unsolved in 7004 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 88/88 constraints]
After SMT, in 11989ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 11992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12122 ms. Remains : 62/62 places, 90/90 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 63 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-05-24 14:43:28] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:28] [INFO ] Invariant cache hit.
[2024-05-24 14:43:28] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 14:43:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-24 14:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:43:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 14:43:28] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-24 14:43:28] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:28] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-24 14:43:28] [INFO ] Computed and/alt/rep : 66/219/66 causal constraints (skipped 9 transitions) in 5 ms.
[2024-05-24 14:43:28] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5845 reset in 164 ms.
Product exploration explored 100000 steps with 5854 reset in 153 ms.
Built C files in :
/tmp/ltsmin12366390531486621640
[2024-05-24 14:43:29] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-24 14:43:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:43:29] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-24 14:43:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:43:29] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-24 14:43:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:43:29] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12366390531486621640
Running compilation step : cd /tmp/ltsmin12366390531486621640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 348 ms.
Running link step : cd /tmp/ltsmin12366390531486621640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12366390531486621640;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14365969866573780838.hoa' '--buchi-type=spotba'
LTSmin run took 627 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-3-LTLFireability-11 finished in 15461 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)))'
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:43:30] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 14:43:30] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 14:43:30] [INFO ] Implicit Places using invariants in 58 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 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 63 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-13
Product exploration explored 100000 steps with 5378 reset in 139 ms.
Product exploration explored 100000 steps with 5379 reset in 152 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 81 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-24 14:43:31] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 68 cols
[2024-05-24 14:43:31] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 14:43:31] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 14:43:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 14:43:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:43:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-24 14:43:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 14:43:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:31] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-24 14:43:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 135 ms
[2024-05-24 14:43:31] [INFO ] Computed and/alt/rep : 81/252/75 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-24 14:43:31] [INFO ] Added : 45 causal constraints over 10 iterations in 81 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 96/96 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 93
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 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 12 place count 62 transition count 90
Applied a total of 12 rules in 8 ms. Remains 62 /68 variables (removed 6) and now considering 90/96 (removed 6) transitions.
[2024-05-24 14:43:31] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 62 cols
[2024-05-24 14:43:31] [INFO ] Computed 14 invariants in 0 ms
[2024-05-24 14:43:31] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-24 14:43:31] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:31] [INFO ] Invariant cache hit.
[2024-05-24 14:43:31] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:31] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-24 14:43:31] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-24 14:43:31] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:31] [INFO ] Invariant cache hit.
[2024-05-24 14:43:31] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:31] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 4 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:43:32] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:33] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 14:43:34] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 78/140 variables, 62/123 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 15/138 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 138 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3875 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 22/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:43:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:36] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 78/140 variables, 62/135 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 87/237 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/140 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:38] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 14:43:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 14:43:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-24 14:43:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 14:43:38] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-24 14:43:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/140 variables, 6/243 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/140 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-24 14:43:40] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/140 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/140 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 21 (OVERLAPS) 0/140 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 245 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6529 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 67/67 constraints]
After SMT, in 10428ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 10429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/68 places, 90/96 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10553 ms. Remains : 62/68 places, 90/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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 29 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-24 14:43:42] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
[2024-05-24 14:43:42] [INFO ] Invariant cache hit.
[2024-05-24 14:43:42] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2024-05-24 14:43:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 14:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 14:43:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 14:43:42] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 14:43:42] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 14:43:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-24 14:43:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 14:43:42] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-24 14:43:42] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 14:43:42] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-24 14:43:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 148 ms
[2024-05-24 14:43:42] [INFO ] Computed and/alt/rep : 66/219/66 causal constraints (skipped 9 transitions) in 7 ms.
[2024-05-24 14:43:42] [INFO ] Added : 26 causal constraints over 6 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5872 reset in 141 ms.
Product exploration explored 100000 steps with 5858 reset in 163 ms.
Built C files in :
/tmp/ltsmin8558408813511185903
[2024-05-24 14:43:43] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-24 14:43:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:43:43] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-24 14:43:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:43:43] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-24 14:43:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 14:43:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8558408813511185903
Running compilation step : cd /tmp/ltsmin8558408813511185903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin8558408813511185903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8558408813511185903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4059152801479968167.hoa' '--buchi-type=spotba'
LTSmin run took 246 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-3-LTLFireability-13 finished in 13546 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) U (p1&&G(p0)))))'
Support contains 18 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:43:43] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 14:43:43] [INFO ] Computed 17 invariants in 3 ms
[2024-05-24 14:43:43] [INFO ] Implicit Places using invariants in 54 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 96/96 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 58 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-14
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-14 finished in 194 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(p1)))'
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 14:43:43] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
[2024-05-24 14:43:43] [INFO ] Invariant cache hit.
[2024-05-24 14:43:44] [INFO ] Implicit Places using invariants in 53 ms returned [47, 48, 49]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/71 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.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 68/71 places, 96/96 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-3-LTLFireability-15
Product exploration explored 100000 steps with 6295 reset in 136 ms.
Stack based approach found an accepted trace after 2251 steps with 142 reset with depth 26 and stack size 26 in 4 ms.
FORMULA LamportFastMutEx-COL-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-3-LTLFireability-15 finished in 347 ms.
All properties solved by simple procedures.
Total runtime 93967 ms.

BK_STOP 1716561824373

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649612300212"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;