Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679508009441

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 18:00:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 18:00:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:00:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 18:00:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 18:00:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 468 ms
[2023-03-22 18:00:11] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 18:00:11] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2023-03-22 18:00:11] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10033 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=109 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 18:00:12] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-22 18:00:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 18:00:12] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 18:00:12] [INFO ] Flatten gal took : 14 ms
[2023-03-22 18:00:12] [INFO ] Flatten gal took : 3 ms
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 18:00:12] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 25 ms.
[2023-03-22 18:00:12] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Support contains 144 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 10 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:12] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 18:00:12] [INFO ] Computed 50 place invariants in 6 ms
[2023-03-22 18:00:12] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-22 18:00:12] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:12] [INFO ] Invariant cache hit.
[2023-03-22 18:00:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:12] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-22 18:00:12] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:12] [INFO ] Invariant cache hit.
[2023-03-22 18:00:12] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 176/176 places, 354/354 transitions.
Support contains 144 out of 176 places after structural reductions.
[2023-03-22 18:00:12] [INFO ] Flatten gal took : 33 ms
[2023-03-22 18:00:12] [INFO ] Flatten gal took : 23 ms
[2023-03-22 18:00:13] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 18:00:13] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:13] [INFO ] Invariant cache hit.
[2023-03-22 18:00:13] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-22 18:00:13] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:00:13] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:13] [INFO ] After 47ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:13] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 4 ms to minimize.
[2023-03-22 18:00:13] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2023-03-22 18:00:13] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-22 18:00:14] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:00:15] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2084 ms
[2023-03-22 18:00:15] [INFO ] After 2167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-22 18:00:15] [INFO ] After 2362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 57 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 164/176 places, 342/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1291036 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :{}
Probabilistic random walk after 1291036 steps, saw 419748 distinct states, run finished after 3003 ms. (steps per millisecond=429 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:18] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-22 18:00:18] [INFO ] Computed 50 place invariants in 10 ms
[2023-03-22 18:00:18] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 18:00:19] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 18:00:19] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:19] [INFO ] After 37ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:19] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-22 18:00:19] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 18 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 17 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 13 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 18:00:19] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:00:19] [INFO ] Invariant cache hit.
[2023-03-22 18:00:19] [INFO ] Implicit Places using invariants in 149 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 152 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 175 ms. Remains : 158/164 places, 342/342 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1396728 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :{}
Probabilistic random walk after 1396728 steps, saw 445019 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:22] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:00:22] [INFO ] Computed 44 place invariants in 5 ms
[2023-03-22 18:00:22] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:00:22] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:22] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:00:22] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:22] [INFO ] After 31ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:22] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2023-03-22 18:00:22] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 4 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2023-03-22 18:00:23] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2023-03-22 18:00:24] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2023-03-22 18:00:24] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 0 ms to minimize.
[2023-03-22 18:00:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1370 ms
[2023-03-22 18:00:24] [INFO ] After 1430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 18:00:24] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 18:00:24] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:00:24] [INFO ] Invariant cache hit.
[2023-03-22 18:00:24] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-22 18:00:24] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:00:24] [INFO ] Invariant cache hit.
[2023-03-22 18:00:24] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:24] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-22 18:00:24] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 18:00:24] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:00:24] [INFO ] Invariant cache hit.
[2023-03-22 18:00:24] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 158/158 places, 342/342 transitions.
Graph (trivial) has 102 edges and 158 vertex of which 30 / 158 are part of one of the 6 SCC in 3 ms
Free SCC test removed 24 places
Drop transitions removed 60 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 426 edges and 134 vertex of which 127 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 127 transition count 186
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 38 place count 127 transition count 150
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 140 place count 61 transition count 150
Applied a total of 140 rules in 22 ms. Remains 61 /158 variables (removed 97) and now considering 150/342 (removed 192) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 61 cols
[2023-03-22 18:00:24] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-22 18:00:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 18:00:24] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 18:00:24] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:24] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 18:00:24] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 6 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 12 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 12 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 18:00:25] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 18:00:25] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 18:00:25] [INFO ] Implicit Places using invariants in 110 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 112 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 164 transition count 342
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 158 transition count 342
Applied a total of 12 rules in 10 ms. Remains 158 /164 variables (removed 6) and now considering 342/348 (removed 6) transitions.
[2023-03-22 18:00:25] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 18:00:25] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-22 18:00:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-22 18:00:25] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 18:00:25] [INFO ] Invariant cache hit.
[2023-03-22 18:00:25] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:25] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 158/176 places, 342/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 451 ms. Remains : 158/176 places, 342/354 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s44 s45 s46 s47 s48 s49) (ADD s56 s57 s58 s59 s60 s61)), p1:(GT 2 (ADD s56 s57 s58 s59 s60 s61))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 333 ms.
Stack based approach found an accepted trace after 314 steps with 0 reset with depth 315 and stack size 315 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-00 finished in 1074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 30 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:26] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 18:00:26] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-22 18:00:26] [INFO ] Implicit Places using invariants in 124 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 125 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s38 s39 s40 s41 s42 s43) (ADD s146 s147 s148 s149 s150 s151)), p0:(AND (LEQ (ADD s56 s57 s58 s59 s60 s61) (ADD s50 s51 s52 s53 s54 s55)) (LEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Stack based approach found an accepted trace after 484 steps with 0 reset with depth 485 and stack size 485 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-01 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 36 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 12 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 18:00:26] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 18:00:26] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-22 18:00:27] [INFO ] Implicit Places using invariants in 105 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 107 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 274 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 3 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-02 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)))'
Support contains 60 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 9 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 18:00:27] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:27] [INFO ] Invariant cache hit.
[2023-03-22 18:00:27] [INFO ] Implicit Places using invariants in 106 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 107 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/176 places, 348/354 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ 3 (ADD s32 s33 s34 s35 s36 s37)), p0:(LEQ (ADD s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 38 steps with 3 reset in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-03 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U p1))'
Support contains 42 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:27] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 18:00:27] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-22 18:00:27] [INFO ] Implicit Places using invariants in 113 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 115 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 120 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6375 steps with 250 reset in 26 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-05 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(G(p0))&&G(p1)))&&F(G((!p0 U p2)))))'
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 12 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:27] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:27] [INFO ] Invariant cache hit.
[2023-03-22 18:00:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-22 18:00:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:28] [INFO ] Invariant cache hit.
[2023-03-22 18:00:28] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:28] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-22 18:00:28] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 18:00:28] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:28] [INFO ] Invariant cache hit.
[2023-03-22 18:00:28] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 521 ms. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 4}, { cond=p1, acceptance={1} source=1 dest: 5}], [{ cond=(OR p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=p0, acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 1}, { cond=p1, acceptance={1} source=5 dest: 5}]], initial=0, aps=[p1:(GT 2 (ADD s50 s51 s52 s53 s54 s55)), p2:(LEQ 1 (ADD s110 s111 s112 s113 s114 s115)), p0:(GT 3 (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Stack based approach found an accepted trace after 484 steps with 0 reset with depth 485 and stack size 485 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-07 finished in 1375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:29] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:29] [INFO ] Invariant cache hit.
[2023-03-22 18:00:29] [INFO ] Implicit Places using invariants in 112 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 113 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 7 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 18:00:29] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 18:00:29] [INFO ] Computed 44 place invariants in 6 ms
[2023-03-22 18:00:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 18:00:29] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:29] [INFO ] Invariant cache hit.
[2023-03-22 18:00:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:29] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 164/176 places, 348/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT (ADD s146 s147 s148 s149 s150 s151) (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4772 reset in 357 ms.
Product exploration explored 100000 steps with 4775 reset in 316 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
[2023-03-22 18:00:30] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:30] [INFO ] Invariant cache hit.
[2023-03-22 18:00:31] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-22 18:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:31] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-22 18:00:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:00:31] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-22 18:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:31] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-22 18:00:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:31] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:00:31] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:00:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 18:00:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-22 18:00:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2023-03-22 18:00:31] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-22 18:00:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-22 18:00:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 18:00:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-22 18:00:32] [INFO ] Added : 154 causal constraints over 32 iterations in 957 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 48 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 16 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:00:32] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:32] [INFO ] Invariant cache hit.
[2023-03-22 18:00:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 18:00:32] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:32] [INFO ] Invariant cache hit.
[2023-03-22 18:00:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:32] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-22 18:00:32] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 18:00:32] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:32] [INFO ] Invariant cache hit.
[2023-03-22 18:00:33] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 164/164 places, 348/348 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-22 18:00:33] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:33] [INFO ] Invariant cache hit.
[2023-03-22 18:00:33] [INFO ] [Real]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 18:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:33] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-22 18:00:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:00:33] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 18:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:34] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-22 18:00:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:00:34] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2023-03-22 18:00:34] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-22 18:00:34] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-22 18:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2023-03-22 18:00:34] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 21 ms.
[2023-03-22 18:00:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 18:00:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 18:00:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-03-22 18:00:35] [INFO ] Added : 154 causal constraints over 32 iterations in 955 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4731 reset in 264 ms.
Product exploration explored 100000 steps with 4736 reset in 263 ms.
Support contains 48 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:00:35] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:35] [INFO ] Invariant cache hit.
[2023-03-22 18:00:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-22 18:00:35] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:35] [INFO ] Invariant cache hit.
[2023-03-22 18:00:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:36] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-22 18:00:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 18:00:36] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:36] [INFO ] Invariant cache hit.
[2023-03-22 18:00:36] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 452 ms. Remains : 164/164 places, 348/348 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-08 finished in 7014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&(p1 U (p2||G(p1)))))))))'
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:36] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 18:00:36] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-22 18:00:36] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-22 18:00:36] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:36] [INFO ] Invariant cache hit.
[2023-03-22 18:00:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:36] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-22 18:00:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 18:00:36] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:36] [INFO ] Invariant cache hit.
[2023-03-22 18:00:36] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (LEQ 3 (ADD s110 s111 s112 s113 s114 s115)) (LEQ (ADD s158 s159 s160 s161 s162 s163) (ADD s56 s57 s58 s59 s60 s61)))) (GT 3 (ADD s110 s1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4390 reset in 331 ms.
Product exploration explored 100000 steps with 4443 reset in 290 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 432 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 18:00:38] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:38] [INFO ] Invariant cache hit.
[2023-03-22 18:00:38] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2) p0))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (F p0), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 11 factoid took 887 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2023-03-22 18:00:39] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:39] [INFO ] Invariant cache hit.
[2023-03-22 18:00:39] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 18:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:39] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-22 18:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:00:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 18:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:39] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 18:00:39] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 17 ms returned sat
[2023-03-22 18:00:39] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-22 18:00:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-22 18:00:40] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 18:00:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2023-03-22 18:00:40] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2023-03-22 18:00:40] [INFO ] Added : 73 causal constraints over 16 iterations in 357 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:40] [INFO ] Invariant cache hit.
[2023-03-22 18:00:40] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 18:00:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:40] [INFO ] Invariant cache hit.
[2023-03-22 18:00:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:40] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-22 18:00:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 18:00:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:40] [INFO ] Invariant cache hit.
[2023-03-22 18:00:40] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 176/176 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:41] [INFO ] Invariant cache hit.
[2023-03-22 18:00:41] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p0 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 10 factoid took 484 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2023-03-22 18:00:42] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:42] [INFO ] Invariant cache hit.
[2023-03-22 18:00:42] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-22 18:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:42] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-22 18:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:00:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 18:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:42] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-22 18:00:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 21 ms returned sat
[2023-03-22 18:00:42] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2023-03-22 18:00:42] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 18:00:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 18:00:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2023-03-22 18:00:42] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2023-03-22 18:00:43] [INFO ] Added : 73 causal constraints over 16 iterations in 360 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4409 reset in 250 ms.
Product exploration explored 100000 steps with 4410 reset in 264 ms.
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:43] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:43] [INFO ] Invariant cache hit.
[2023-03-22 18:00:43] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-22 18:00:43] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:43] [INFO ] Invariant cache hit.
[2023-03-22 18:00:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:44] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-22 18:00:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 18:00:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:44] [INFO ] Invariant cache hit.
[2023-03-22 18:00:44] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 176/176 places, 354/354 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-09 finished in 8059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(!p0))))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:44] [INFO ] Invariant cache hit.
[2023-03-22 18:00:44] [INFO ] Implicit Places using invariants in 126 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 128 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, true, p0]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s158 s159 s160 s161 s162 s163))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 227 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 187 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-10 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0)) U p1))))'
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 2 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:44] [INFO ] Invariant cache hit.
[2023-03-22 18:00:44] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-22 18:00:44] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:44] [INFO ] Invariant cache hit.
[2023-03-22 18:00:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 18:00:45] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-22 18:00:45] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:45] [INFO ] Invariant cache hit.
[2023-03-22 18:00:45] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 176/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 (ADD s44 s45 s46 s47 s48 s49)), p0:(AND (LEQ 3 (ADD s110 s111 s112 s113 s114 s115)) (LEQ (ADD s32 s33 s34 s35 s36 s37) (ADD s44 s45 s46 s47 s48 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 544 reset in 198 ms.
Stack based approach found an accepted trace after 484 steps with 1 reset with depth 124 and stack size 124 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-12 finished in 948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((p1 U p2)))))'
Support contains 24 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:45] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:45] [INFO ] Invariant cache hit.
[2023-03-22 18:00:45] [INFO ] Implicit Places using invariants in 118 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55)), p2:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s152 s153 s154 s155 s156 s157)), p1:(GT 3 (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8840 reset in 287 ms.
Product exploration explored 100000 steps with 8958 reset in 248 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:47] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2023-03-22 18:00:47] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 18:00:47] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:47] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:00:47] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:47] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:47] [INFO ] After 35ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:47] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2023-03-22 18:00:47] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 18:00:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-03-22 18:00:47] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 18:00:47] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 7 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/170 places, 348/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1195243 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :{}
Probabilistic random walk after 1195243 steps, saw 394370 distinct states, run finished after 3002 ms. (steps per millisecond=398 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:50] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 18:00:50] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-22 18:00:50] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:50] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-22 18:00:50] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:50] [INFO ] After 28ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:51] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-22 18:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-22 18:00:51] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-22 18:00:51] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:00:51] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:51] [INFO ] Invariant cache hit.
[2023-03-22 18:00:51] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 18:00:51] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:51] [INFO ] Invariant cache hit.
[2023-03-22 18:00:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:51] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-22 18:00:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 18:00:51] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:51] [INFO ] Invariant cache hit.
[2023-03-22 18:00:51] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 164/164 places, 348/348 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 164 transition count 258
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 90 place count 164 transition count 222
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 192 place count 98 transition count 222
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 92 transition count 252
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 92 transition count 246
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 86 transition count 246
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 86 transition count 246
Applied a total of 222 rules in 15 ms. Remains 86 /164 variables (removed 78) and now considering 246/348 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 86 cols
[2023-03-22 18:00:51] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 18:00:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 18:00:51] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:51] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-22 18:00:51] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 18:00:52] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2023-03-22 18:00:52] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-22 18:00:52] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 18:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:52] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-22 18:00:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:00:52] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2023-03-22 18:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:52] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 18:00:52] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:52] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2023-03-22 18:00:52] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 19 ms.
[2023-03-22 18:00:53] [INFO ] Added : 11 causal constraints over 3 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 18:00:53] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:53] [INFO ] Invariant cache hit.
[2023-03-22 18:00:53] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 18:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:53] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-22 18:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:00:53] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 18:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:00:53] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 18:00:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-03-22 18:00:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 432 ms
[2023-03-22 18:00:53] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 20 ms.
[2023-03-22 18:00:54] [INFO ] Added : 78 causal constraints over 17 iterations in 352 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:00:54] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:54] [INFO ] Invariant cache hit.
[2023-03-22 18:00:54] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-22 18:00:54] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:54] [INFO ] Invariant cache hit.
[2023-03-22 18:00:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:54] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-22 18:00:54] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:54] [INFO ] Invariant cache hit.
[2023-03-22 18:00:54] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 170/170 places, 354/354 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:55] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:00:55] [INFO ] Invariant cache hit.
[2023-03-22 18:00:55] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:00:55] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:55] [INFO ] After 30ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:55] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 18:00:55] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:00:55] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-22 18:00:55] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-22 18:00:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 270 ms
[2023-03-22 18:00:55] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-22 18:00:55] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 6 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/170 places, 348/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1260627 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :{}
Probabilistic random walk after 1260627 steps, saw 412709 distinct states, run finished after 3005 ms. (steps per millisecond=419 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:00:58] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 18:00:58] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-22 18:00:58] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:58] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:00:59] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:59] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:59] [INFO ] After 35ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:00:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-22 18:00:59] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-22 18:00:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-22 18:00:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2023-03-22 18:00:59] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-22 18:00:59] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:00:59] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:59] [INFO ] Invariant cache hit.
[2023-03-22 18:00:59] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 18:00:59] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:59] [INFO ] Invariant cache hit.
[2023-03-22 18:00:59] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:00:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-22 18:00:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 18:00:59] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:00:59] [INFO ] Invariant cache hit.
[2023-03-22 18:00:59] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 164/164 places, 348/348 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 164 transition count 258
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 90 place count 164 transition count 222
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 192 place count 98 transition count 222
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 92 transition count 252
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 92 transition count 246
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 86 transition count 246
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 86 transition count 246
Applied a total of 222 rules in 10 ms. Remains 86 /164 variables (removed 78) and now considering 246/348 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 86 cols
[2023-03-22 18:00:59] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 18:00:59] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:00:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 18:00:59] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:01:00] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-22 18:01:00] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 18:01:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2023-03-22 18:01:00] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 18:01:00] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 18:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:00] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-22 18:01:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:01:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 18:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:01] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 18:01:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-22 18:01:01] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 21 ms.
[2023-03-22 18:01:01] [INFO ] Added : 11 causal constraints over 3 iterations in 118 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 18:01:01] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:01:01] [INFO ] Invariant cache hit.
[2023-03-22 18:01:01] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 18:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:01] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-22 18:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:01:01] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 18:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:01] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-22 18:01:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2023-03-22 18:01:01] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:01:01] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:01:01] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-22 18:01:01] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2023-03-22 18:01:02] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 18:01:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 18:01:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-03-22 18:01:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 467 ms
[2023-03-22 18:01:02] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 15 ms.
[2023-03-22 18:01:02] [INFO ] Added : 78 causal constraints over 17 iterations in 369 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 8899 reset in 239 ms.
Product exploration explored 100000 steps with 8912 reset in 218 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:01:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 18:01:03] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:01:03] [INFO ] Invariant cache hit.
[2023-03-22 18:01:03] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 170 ms. Remains : 170/170 places, 354/354 transitions.
Support contains 24 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:01:03] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:01:03] [INFO ] Invariant cache hit.
[2023-03-22 18:01:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-22 18:01:03] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:01:03] [INFO ] Invariant cache hit.
[2023-03-22 18:01:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:03] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-22 18:01:03] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:01:03] [INFO ] Invariant cache hit.
[2023-03-22 18:01:04] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 170/170 places, 354/354 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-14 finished in 18341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&X(!p0)) U G(p1)))))'
Support contains 48 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:01:04] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 18:01:04] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-22 18:01:04] [INFO ] Implicit Places using invariants in 108 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 110 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Applied a total of 0 rules in 1 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ (ADD s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-15 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&(p1 U (p2||G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((p1 U p2)))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-6-LTLCardinality-14
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Support contains 24 out of 176 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 176/176 places, 354/354 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2023-03-22 18:01:05] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2023-03-22 18:01:05] [INFO ] Invariant cache hit.
[2023-03-22 18:01:05] [INFO ] Implicit Places using invariants in 123 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 124 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 170/176 places, 354/354 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 170 transition count 348
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 164 transition count 348
Applied a total of 12 rules in 5 ms. Remains 164 /170 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2023-03-22 18:01:05] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 18:01:05] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 18:01:05] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 18:01:05] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:05] [INFO ] Invariant cache hit.
[2023-03-22 18:01:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:05] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 164/176 places, 348/354 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 470 ms. Remains : 164/176 places, 348/354 transitions.
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s50 s51 s52 s53 s54 s55)), p2:(LEQ (ADD s0 s1 s2 s3 s4 s5) (ADD s146 s147 s148 s149 s150 s151)), p1:(GT 3 (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8950 reset in 228 ms.
Product exploration explored 100000 steps with 8904 reset in 249 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:01:06] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:06] [INFO ] Invariant cache hit.
[2023-03-22 18:01:06] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:01:06] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 18:01:06] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:01:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:06] [INFO ] After 31ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:01:06] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2023-03-22 18:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-22 18:01:06] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-22 18:01:06] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 164/164 places, 348/348 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1289519 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :{}
Probabilistic random walk after 1289519 steps, saw 420895 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:01:09] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:09] [INFO ] Invariant cache hit.
[2023-03-22 18:01:09] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:01:09] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 18:01:09] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:01:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:09] [INFO ] After 28ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 18:01:10] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-22 18:01:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-22 18:01:10] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-22 18:01:10] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 164/164 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:01:10] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:10] [INFO ] Invariant cache hit.
[2023-03-22 18:01:10] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-22 18:01:10] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:10] [INFO ] Invariant cache hit.
[2023-03-22 18:01:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:10] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-22 18:01:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 18:01:10] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:10] [INFO ] Invariant cache hit.
[2023-03-22 18:01:10] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 164/164 places, 348/348 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 164 transition count 258
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 90 place count 164 transition count 222
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 30 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 1 with 102 rules applied. Total rules applied 192 place count 98 transition count 222
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 204 place count 92 transition count 252
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 210 place count 92 transition count 246
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 216 place count 86 transition count 246
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 86 transition count 246
Applied a total of 222 rules in 20 ms. Remains 86 /164 variables (removed 78) and now considering 246/348 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 86 cols
[2023-03-22 18:01:10] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-22 18:01:10] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:01:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 18:01:10] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:01:10] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-22 18:01:10] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F p2)]
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 18:01:11] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2023-03-22 18:01:11] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-22 18:01:11] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 18:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:11] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-22 18:01:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:01:11] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-22 18:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:11] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-22 18:01:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:11] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:01:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2023-03-22 18:01:11] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2023-03-22 18:01:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-22 18:01:12] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-22 18:01:12] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-22 18:01:12] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-22 18:01:12] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-22 18:01:12] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2023-03-22 18:01:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 539 ms
[2023-03-22 18:01:12] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 18 ms.
[2023-03-22 18:01:13] [INFO ] Added : 171 causal constraints over 35 iterations in 831 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 18:01:13] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:13] [INFO ] Invariant cache hit.
[2023-03-22 18:01:13] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 18:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:13] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-22 18:01:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:01:13] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2023-03-22 18:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:13] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-22 18:01:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:13] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-22 18:01:13] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2023-03-22 18:01:13] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-22 18:01:13] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:01:13] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2023-03-22 18:01:13] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-03-22 18:01:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1166 ms
[2023-03-22 18:01:14] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 16 ms.
[2023-03-22 18:01:15] [INFO ] Added : 179 causal constraints over 38 iterations in 890 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:01:15] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:15] [INFO ] Invariant cache hit.
[2023-03-22 18:01:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-22 18:01:15] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:15] [INFO ] Invariant cache hit.
[2023-03-22 18:01:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:15] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-22 18:01:15] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:15] [INFO ] Invariant cache hit.
[2023-03-22 18:01:16] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 164/164 places, 348/348 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 944 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2023-03-22 18:01:17] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:17] [INFO ] Invariant cache hit.
[2023-03-22 18:01:17] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 18:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:17] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 18:01:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:01:17] [INFO ] [Nat]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 18:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:17] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 18:01:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:17] [INFO ] [Nat]Added 36 Read/Feed constraints in 20 ms returned sat
[2023-03-22 18:01:17] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-22 18:01:17] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 18:01:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-22 18:01:17] [INFO ] Added : 66 causal constraints over 14 iterations in 358 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-22 18:01:17] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:17] [INFO ] Invariant cache hit.
[2023-03-22 18:01:17] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2023-03-22 18:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:18] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-22 18:01:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:01:18] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-22 18:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:01:18] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-22 18:01:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:01:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2023-03-22 18:01:19] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1140 ms
[2023-03-22 18:01:19] [INFO ] Computed and/alt/rep : 222/1098/222 causal constraints (skipped 30 transitions) in 15 ms.
[2023-03-22 18:01:20] [INFO ] Added : 179 causal constraints over 38 iterations in 921 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 8919 reset in 219 ms.
Product exploration explored 100000 steps with 8889 reset in 229 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:01:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 18:01:21] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:21] [INFO ] Invariant cache hit.
[2023-03-22 18:01:21] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 164/164 places, 348/348 transitions.
Support contains 24 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 348/348 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2023-03-22 18:01:21] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:21] [INFO ] Invariant cache hit.
[2023-03-22 18:01:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-22 18:01:21] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:21] [INFO ] Invariant cache hit.
[2023-03-22 18:01:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 18:01:21] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-22 18:01:21] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2023-03-22 18:01:21] [INFO ] Invariant cache hit.
[2023-03-22 18:01:21] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 164/164 places, 348/348 transitions.
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-14 finished in 17093 ms.
[2023-03-22 18:01:21] [INFO ] Flatten gal took : 21 ms
[2023-03-22 18:01:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 18:01:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 354 transitions and 1536 arcs took 3 ms.
Total runtime 70776 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2186/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2186/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2186/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : LamportFastMutEx-COL-6-LTLCardinality-08
Could not compute solution for formula : LamportFastMutEx-COL-6-LTLCardinality-09
Could not compute solution for formula : LamportFastMutEx-COL-6-LTLCardinality-14

BK_STOP 1679508083348

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name LamportFastMutEx-COL-6-LTLCardinality-08
ltl formula formula --ltl=/tmp/2186/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 176 places, 354 transitions and 1536 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2186/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2186/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2186/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2186/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name LamportFastMutEx-COL-6-LTLCardinality-09
ltl formula formula --ltl=/tmp/2186/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 176 places, 354 transitions and 1536 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2186/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2186/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2186/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2186/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5572d985c3f4]
1: pnml2lts-mc(+0xa2496) [0x5572d985c496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fb8813dc140]
3: pnml2lts-mc(+0x405be5) [0x5572d9bbfbe5]
4: pnml2lts-mc(+0x164ad3) [0x5572d991ead3]
5: pnml2lts-mc(+0x272e0a) [0x5572d9a2ce0a]
6: pnml2lts-mc(+0xb61f0) [0x5572d98701f0]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fb88122f4d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fb88122f67a]
9: pnml2lts-mc(+0xa1581) [0x5572d985b581]
10: pnml2lts-mc(+0xa1910) [0x5572d985b910]
11: pnml2lts-mc(+0xa32a2) [0x5572d985d2a2]
12: pnml2lts-mc(+0xa50f4) [0x5572d985f0f4]
13: pnml2lts-mc(+0xa516b) [0x5572d985f16b]
14: pnml2lts-mc(+0x3f34b3) [0x5572d9bad4b3]
15: pnml2lts-mc(+0x7c63d) [0x5572d983663d]
16: pnml2lts-mc(+0x67d86) [0x5572d9821d86]
17: pnml2lts-mc(+0x60a8a) [0x5572d981aa8a]
18: pnml2lts-mc(+0x5eb15) [0x5572d9818b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fb881217d0a]
20: pnml2lts-mc(+0x6075e) [0x5572d981a75e]
ltl formula name LamportFastMutEx-COL-6-LTLCardinality-14
ltl formula formula --ltl=/tmp/2186/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 176 places, 354 transitions and 1536 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2186/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2186/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2186/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2186/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-6"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-6, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418800371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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