Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628200147.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r241-tall-171649628200147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-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 1716553537967

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-24 12:25:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:25:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 12:25:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 12:25:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 706 ms
[2024-05-24 12:25:40] [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 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 12:25:40] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 7 ms.
[2024-05-24 12:25:40] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 14 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 10019 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 12:25:40] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 12:25:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 12:25:40] [INFO ] After 99ms 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.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 12:25:40] [INFO ] Flatten gal took : 12 ms
[2024-05-24 12:25:40] [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.
[2024-05-24 12:25:40] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 24 ms.
[2024-05-24 12:25:40] [INFO ] Unfolded 13 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 138 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 29 ms. Remains 176 /176 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2024-05-24 12:25:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:25:40] [INFO ] Computed 50 invariants in 9 ms
[2024-05-24 12:25:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-24 12:25:40] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:40] [INFO ] Invariant cache hit.
[2024-05-24 12:25:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 12:25:41] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-24 12:25:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:41] [INFO ] Invariant cache hit.
[2024-05-24 12:25:41] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 176/176 places, 354/354 transitions.
Support contains 138 out of 176 places after structural reductions.
[2024-05-24 12:25:41] [INFO ] Flatten gal took : 32 ms
[2024-05-24 12:25:41] [INFO ] Flatten gal took : 32 ms
[2024-05-24 12:25:41] [INFO ] Input system was already deterministic with 354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:25:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:41] [INFO ] Invariant cache hit.
[2024-05-24 12:25:41] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-05-24 12:25:41] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:25:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-24 12:25:41] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:25:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 12:25:41] [INFO ] After 30ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:25:41] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 3 ms to minimize.
[2024-05-24 12:25:42] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2024-05-24 12:25:42] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-24 12:25:42] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-24 12:25:42] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 12:25:42] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-24 12:25:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 525 ms
[2024-05-24 12:25:42] [INFO ] After 567ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 12:25:42] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 6 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 44 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 44 ms. Remains : 164/176 places, 342/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1293928 steps, run timeout after 3001 ms. (steps per millisecond=431 ) properties seen :{}
Probabilistic random walk after 1293928 steps, saw 420540 distinct states, run finished after 3002 ms. (steps per millisecond=431 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:25:45] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2024-05-24 12:25:45] [INFO ] Computed 50 invariants in 13 ms
[2024-05-24 12:25:45] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-24 12:25:45] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:25:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-24 12:25:45] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:25:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 12:25:45] [INFO ] After 28ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:25:45] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2024-05-24 12:25:45] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-24 12:25:46] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 12:25:46] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2024-05-24 12:25:46] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2024-05-24 12:25:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 432 ms
[2024-05-24 12:25:46] [INFO ] After 472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 12:25:46] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 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 15 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-24 12:25:46] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:25:46] [INFO ] Invariant cache hit.
[2024-05-24 12:25:46] [INFO ] Implicit Places using invariants in 158 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 161 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 10 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 186 ms. Remains : 158/164 places, 342/342 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 1285195 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :{}
Probabilistic random walk after 1285195 steps, saw 417287 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:25:49] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2024-05-24 12:25:49] [INFO ] Computed 44 invariants in 7 ms
[2024-05-24 12:25:49] [INFO ] [Real]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-24 12:25:49] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:25:49] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-24 12:25:49] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:25:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:49] [INFO ] After 17ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:25:49] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-24 12:25:49] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2024-05-24 12:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2024-05-24 12:25:49] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 12:25:49] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 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 11 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 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-24 12:25:49] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:25:49] [INFO ] Invariant cache hit.
[2024-05-24 12:25:50] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 12:25:50] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:25:50] [INFO ] Invariant cache hit.
[2024-05-24 12:25:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:50] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-24 12:25:50] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 12:25:50] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:25:50] [INFO ] Invariant cache hit.
[2024-05-24 12:25:50] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 158/158 places, 342/342 transitions.
Graph (trivial) has 150 edges and 158 vertex of which 30 / 158 are part of one of the 6 SCC in 2 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
Graph (trivial) has 36 edges and 61 vertex of which 30 / 61 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 37 transition count 150
Drop transitions removed 30 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 183 place count 37 transition count 108
Applied a total of 183 rules in 25 ms. Remains 37 /158 variables (removed 121) and now considering 108/342 (removed 234) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 37 cols
[2024-05-24 12:25:50] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 12:25:50] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2024-05-24 12:25:50] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 12:25:50] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 12:25:50] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
FORMULA LamportFastMutEx-COL-6-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA LamportFastMutEx-COL-6-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 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.
[2024-05-24 12:25:50] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:25:50] [INFO ] Computed 50 invariants in 1 ms
[2024-05-24 12:25:50] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-24 12:25:50] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:50] [INFO ] Invariant cache hit.
[2024-05-24 12:25:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-24 12:25:51] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-24 12:25:51] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-24 12:25:51] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:51] [INFO ] Invariant cache hit.
[2024-05-24 12:25:51] [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 526 ms. Remains : 176/176 places, 354/354 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
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 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s110 s111 s112 s113 s114 s115))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 446 reset in 299 ms.
Stack based approach found an accepted trace after 365 steps with 0 reset with depth 366 and stack size 366 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-00 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 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 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
Applied a total of 12 rules in 14 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2024-05-24 12:25:51] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-05-24 12:25:51] [INFO ] Computed 50 invariants in 2 ms
[2024-05-24 12:25:51] [INFO ] Implicit Places using invariants in 159 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 161 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 0 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 9 ms. Remains 158 /164 variables (removed 6) and now considering 342/348 (removed 6) transitions.
[2024-05-24 12:25:52] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2024-05-24 12:25:52] [INFO ] Computed 44 invariants in 1 ms
[2024-05-24 12:25:52] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 12:25:52] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:25:52] [INFO ] Invariant cache hit.
[2024-05-24 12:25:52] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:52] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 315 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 501 ms. Remains : 158/176 places, 342/354 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-01 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 1 (ADD s62 s63 s64 s65 s66 s67))], 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 239 ms.
Stack based approach found an accepted trace after 252 steps with 0 reset with depth 253 and stack size 253 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-01 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(p0)) U p1))))'
Support contains 54 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.
[2024-05-24 12:25:52] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:25:52] [INFO ] Computed 50 invariants in 2 ms
[2024-05-24 12:25:52] [INFO ] Implicit Places using invariants in 119 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 121 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 124 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, 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, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 251 steps with 0 reset with depth 252 and stack size 252 in 1 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-03 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 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 13 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2024-05-24 12:25:53] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-05-24 12:25:53] [INFO ] Computed 50 invariants in 2 ms
[2024-05-24 12:25:53] [INFO ] Implicit Places using invariants in 117 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 119 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 0 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 9 ms. Remains 158 /164 variables (removed 6) and now considering 342/348 (removed 6) transitions.
[2024-05-24 12:25:53] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2024-05-24 12:25:53] [INFO ] Computed 44 invariants in 1 ms
[2024-05-24 12:25:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 12:25:53] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:25:53] [INFO ] Invariant cache hit.
[2024-05-24 12:25:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:53] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 335 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 476 ms. Remains : 158/176 places, 342/354 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s62 s63 s64 s65 s66 s67))], 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 210 ms.
Stack based approach found an accepted trace after 866 steps with 0 reset with depth 867 and stack size 867 in 2 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-05 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 12 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.
[2024-05-24 12:25:53] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:25:53] [INFO ] Computed 50 invariants in 4 ms
[2024-05-24 12:25:54] [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 123 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 2 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 128 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT (ADD s44 s45 s46 s47 s48 s49) (ADD s68 s69 s70 s71 s72 s73))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20903 reset in 200 ms.
Product exploration explored 100000 steps with 20896 reset in 214 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 12:25:55] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2024-05-24 12:25:55] [INFO ] Computed 44 invariants in 1 ms
[2024-05-24 12:25:55] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-24 12:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:25:55] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-24 12:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:25:55] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2024-05-24 12:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:25:55] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-05-24 12:25:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:55] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2024-05-24 12:25:55] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-24 12:25:55] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-24 12:25:55] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-24 12:25:55] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 12:25:55] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 12:25:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 736 ms
[2024-05-24 12:25:56] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 18 ms.
[2024-05-24 12:25:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-24 12:25:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 12:25:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-24 12:25:57] [INFO ] Added : 152 causal constraints over 31 iterations in 822 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 12 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.
[2024-05-24 12:25:57] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:57] [INFO ] Invariant cache hit.
[2024-05-24 12:25:57] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-24 12:25:57] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:57] [INFO ] Invariant cache hit.
[2024-05-24 12:25:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:57] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-24 12:25:57] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:57] [INFO ] Invariant cache hit.
[2024-05-24 12:25:57] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 12:25:58] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:25:58] [INFO ] Invariant cache hit.
[2024-05-24 12:25:58] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2024-05-24 12:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:25:58] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-24 12:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:25:58] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2024-05-24 12:25:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:25:58] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-24 12:25:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:25:58] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2024-05-24 12:25:58] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 12:25:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-24 12:25:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-24 12:25:59] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 4 ms to minimize.
[2024-05-24 12:25:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-24 12:25:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-24 12:25:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 421 ms
[2024-05-24 12:25:59] [INFO ] Computed and/alt/rep : 234/1176/234 causal constraints (skipped 24 transitions) in 21 ms.
[2024-05-24 12:25:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-24 12:25:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-05-24 12:25:59] [INFO ] Added : 118 causal constraints over 24 iterations in 672 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20899 reset in 209 ms.
Product exploration explored 100000 steps with 20937 reset in 210 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 12 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 20 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2024-05-24 12:26:00] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-24 12:26:00] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:26:00] [INFO ] Invariant cache hit.
[2024-05-24 12:26:00] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 170/170 places, 354/354 transitions.
Built C files in :
/tmp/ltsmin17481938429980727390
[2024-05-24 12:26:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17481938429980727390
Running compilation step : cd /tmp/ltsmin17481938429980727390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 596 ms.
Running link step : cd /tmp/ltsmin17481938429980727390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17481938429980727390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7278216754286192567.hoa' '--buchi-type=spotba'
LTSmin run took 232 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-06 finished in 7795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 12 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.
[2024-05-24 12:26:01] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:26:01] [INFO ] Computed 50 invariants in 1 ms
[2024-05-24 12:26:01] [INFO ] Implicit Places using invariants in 117 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 2 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 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s44 s45 s46 s47 s48 s49) (ADD s164 s165 s166 s167 s168 s169))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-07 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 78 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.
[2024-05-24 12:26:01] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:26:01] [INFO ] Invariant cache hit.
[2024-05-24 12:26:02] [INFO ] Implicit Places using invariants in 88 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 89 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 96 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 322 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-COL-6-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-08 finished in 977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(G(p1))))))'
Support contains 54 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.
[2024-05-24 12:26:02] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:26:02] [INFO ] Invariant cache hit.
[2024-05-24 12:26:03] [INFO ] Implicit Places using invariants in 106 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 107 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 112 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ (ADD s32 s33 s34 s35 s36 s37) (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 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-09 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 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 8 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2024-05-24 12:26:03] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-05-24 12:26:03] [INFO ] Computed 50 invariants in 2 ms
[2024-05-24 12:26:03] [INFO ] Implicit Places using invariants in 116 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 117 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 0 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 7 ms. Remains 158 /164 variables (removed 6) and now considering 342/348 (removed 6) transitions.
[2024-05-24 12:26:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2024-05-24 12:26:03] [INFO ] Computed 44 invariants in 1 ms
[2024-05-24 12:26:03] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-24 12:26:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2024-05-24 12:26:03] [INFO ] Invariant cache hit.
[2024-05-24 12:26:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:03] [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 SI_LTL mode, iteration 2 : 158/176 places, 342/354 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 464 ms. Remains : 158/176 places, 342/354 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s44 s45 s46 s47 s48 s49))], 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 3002 reset in 197 ms.
Stack based approach found an accepted trace after 6194 steps with 212 reset with depth 120 and stack size 120 in 15 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-11 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 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 11 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
[2024-05-24 12:26:03] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2024-05-24 12:26:03] [INFO ] Computed 50 invariants in 1 ms
[2024-05-24 12:26:04] [INFO ] Implicit Places using invariants in 107 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 108 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 4 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 123 ms. Remains : 164/176 places, 348/354 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s140 s141 s142 s143 s144 s145))], 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 2345 reset in 197 ms.
Product exploration explored 100000 steps with 2377 reset in 203 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 79 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 25 ms :[(NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-24 12:26:04] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2024-05-24 12:26:04] [INFO ] Computed 44 invariants in 3 ms
[2024-05-24 12:26:04] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2024-05-24 12:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:26:04] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-24 12:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:26:05] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-24 12:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:26:05] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-24 12:26:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:05] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 12:26:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 742 ms
[2024-05-24 12:26:05] [INFO ] Computed and/alt/rep : 228/1200/228 causal constraints (skipped 24 transitions) in 17 ms.
[2024-05-24 12:26:06] [INFO ] Added : 185 causal constraints over 37 iterations in 825 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 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 5 ms. Remains 164 /164 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2024-05-24 12:26:06] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:06] [INFO ] Invariant cache hit.
[2024-05-24 12:26:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-24 12:26:06] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:06] [INFO ] Invariant cache hit.
[2024-05-24 12:26:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:07] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-24 12:26:07] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 12:26:07] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:07] [INFO ] Invariant cache hit.
[2024-05-24 12:26:07] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 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 59 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 29 ms :[(NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-24 12:26:07] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:07] [INFO ] Invariant cache hit.
[2024-05-24 12:26:07] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2024-05-24 12:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:26:07] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 12:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:26:07] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2024-05-24 12:26:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:26:07] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-24 12:26:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:07] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2024-05-24 12:26:08] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-24 12:26:08] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 12:26:08] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-24 12:26:08] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-24 12:26:08] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
[2024-05-24 12:26:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-24 12:26:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 382 ms
[2024-05-24 12:26:08] [INFO ] Computed and/alt/rep : 228/1200/228 causal constraints (skipped 24 transitions) in 18 ms.
[2024-05-24 12:26:09] [INFO ] Added : 178 causal constraints over 36 iterations in 819 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2345 reset in 187 ms.
Product exploration explored 100000 steps with 2367 reset in 209 ms.
Built C files in :
/tmp/ltsmin13559332121166010932
[2024-05-24 12:26:09] [INFO ] Computing symmetric may disable matrix : 348 transitions.
[2024-05-24 12:26:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:26:09] [INFO ] Computing symmetric may enable matrix : 348 transitions.
[2024-05-24 12:26:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:26:09] [INFO ] Computing Do-Not-Accords matrix : 348 transitions.
[2024-05-24 12:26:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:26:09] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13559332121166010932
Running compilation step : cd /tmp/ltsmin13559332121166010932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 683 ms.
Running link step : cd /tmp/ltsmin13559332121166010932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13559332121166010932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased434444506484087306.hoa' '--buchi-type=spotba'
LTSmin run took 2049 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-12 finished in 8487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||(F(!p0)&&F((G(p1)||(X(p1)&&G(p2))))))))'
Support contains 54 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.
[2024-05-24 12:26:12] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2024-05-24 12:26:12] [INFO ] Computed 50 invariants in 1 ms
[2024-05-24 12:26:12] [INFO ] Implicit Places using invariants in 100 ms returned [110, 111, 112, 113, 114, 115]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 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 105 ms. Remains : 170/176 places, 354/354 transitions.
Stuttering acceptance computed with spot in 371 ms :[p0, p0, p0, (AND p0 (NOT p1)), (AND p2 (NOT p1) p0), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-6-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1 p2), acceptance={1} source=6 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 8}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 1 (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=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2198 reset in 446 ms.
Product exploration explored 100000 steps with 2161 reset in 448 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) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 9 states, 31 edges and 3 AP (stutter sensitive) to 8 states, 27 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p2 (NOT p1) p0), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-24 12:26:14] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2024-05-24 12:26:14] [INFO ] Computed 44 invariants in 8 ms
[2024-05-24 12:26:14] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 12:26:14] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-24 12:26:14] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-24 12:26:14] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2024-05-24 12:26:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:15] [INFO ] After 56ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2024-05-24 12:26:15] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2024-05-24 12:26:15] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2024-05-24 12:26:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2024-05-24 12:26:15] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-24 12:26:15] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 18 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 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 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 164/170 places, 348/354 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 782947 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :{}
Probabilistic random walk after 782947 steps, saw 277187 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:26:18] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 164 cols
[2024-05-24 12:26:18] [INFO ] Computed 44 invariants in 3 ms
[2024-05-24 12:26:18] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-24 12:26:18] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:26:18] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-24 12:26:18] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:26:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:18] [INFO ] After 54ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 12:26:18] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2024-05-24 12:26:18] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2024-05-24 12:26:18] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-24 12:26:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2024-05-24 12:26:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 541 ms
[2024-05-24 12:26:19] [INFO ] After 839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-24 12:26:19] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 18 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 4 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.
[2024-05-24 12:26:19] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:19] [INFO ] Invariant cache hit.
[2024-05-24 12:26:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-24 12:26:19] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:19] [INFO ] Invariant cache hit.
[2024-05-24 12:26:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:19] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-24 12:26:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 12:26:19] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
[2024-05-24 12:26:19] [INFO ] Invariant cache hit.
[2024-05-24 12:26:19] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 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: 6
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 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 210 place count 86 transition count 204
Iterating global reduction 1 with 6 rules applied. Total rules applied 216 place count 86 transition count 204
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 222 place count 86 transition count 198
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 228 place count 80 transition count 198
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 234 place count 80 transition count 198
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 240 place count 80 transition count 192
Applied a total of 240 rules in 14 ms. Remains 80 /164 variables (removed 84) and now considering 192/348 (removed 156) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 192 rows 80 cols
[2024-05-24 12:26:19] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 12:26:20] [INFO ] [Real]Absence check using 14 positive place invariants in 1 ms returned sat
[2024-05-24 12:26:20] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 12:26:20] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:26:20] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:26:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2024-05-24 12:26:20] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:26:20] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 12:26:20] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND p2 p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p2) p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 238 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 48 out of 170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 354/354 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2024-05-24 12:26:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 170 cols
[2024-05-24 12:26:20] [INFO ] Computed 44 invariants in 3 ms
[2024-05-24 12:26:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 12:26:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:26:20] [INFO ] Invariant cache hit.
[2024-05-24 12:26:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-24 12:26:20] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-24 12:26:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 12:26:20] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
[2024-05-24 12:26:20] [INFO ] Invariant cache hit.
[2024-05-24 12:26:20] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 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 p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 51 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 2157 reset in 257 ms.
Product exploration explored 100000 steps with 2164 reset in 267 ms.
Built C files in :
/tmp/ltsmin940913789224835898
[2024-05-24 12:26:22] [INFO ] Computing symmetric may disable matrix : 354 transitions.
[2024-05-24 12:26:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:26:22] [INFO ] Computing symmetric may enable matrix : 354 transitions.
[2024-05-24 12:26:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:26:22] [INFO ] Computing Do-Not-Accords matrix : 354 transitions.
[2024-05-24 12:26:22] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 12:26:22] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin940913789224835898
Running compilation step : cd /tmp/ltsmin940913789224835898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 661 ms.
Running link step : cd /tmp/ltsmin940913789224835898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin940913789224835898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12452515149891291475.hoa' '--buchi-type=spotba'
LTSmin run took 1261 ms.
FORMULA LamportFastMutEx-COL-6-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-6-LTLCardinality-15 finished in 11660 ms.
All properties solved by simple procedures.
Total runtime 44628 ms.

BK_STOP 1716553584998

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r241-tall-171649628200147"
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 ;