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.r488-tall-171631131700011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DatabaseWithMutex-COL-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631131700011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 21K 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 DatabaseWithMutex-COL-04-LTLCardinality-00
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-01
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-02
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-03
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-04
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-05
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-06
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-07
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-08
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-09
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-10
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-11
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-12
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-13
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-14
FORMULA_NAME DatabaseWithMutex-COL-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717179475224

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:17:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:17:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:17:56] [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-31 18:17:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 18:17:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2024-05-31 18:17:57] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 18:17:57] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2024-05-31 18:17:57] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40005 steps (8 resets) in 349 ms. (114 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 11 cols
[2024-05-31 18:17:57] [INFO ] Computed 4 invariants in 6 ms
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 2/19 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-31 18:17:57] [INFO ] Flatten gal took : 14 ms
[2024-05-31 18:17:57] [INFO ] Flatten gal took : 3 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-31 18:17:57] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 14 ms.
[2024-05-31 18:17:57] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:17:57] [INFO ] Computed 28 invariants in 13 ms
[2024-05-31 18:17:57] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-31 18:17:57] [INFO ] Invariant cache hit.
[2024-05-31 18:17:58] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:17:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3004 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2865 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5908ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5912ms
Finished structural reductions in LTL mode , in 1 iterations and 6168 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2024-05-31 18:18:03] [INFO ] Flatten gal took : 16 ms
[2024-05-31 18:18:04] [INFO ] Flatten gal took : 11 ms
[2024-05-31 18:18:04] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 40000 steps (8 resets) in 536 ms. (74 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
[2024-05-31 18:18:04] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 32/268 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:04] [INFO ] Invariant cache hit.
[2024-05-31 18:18:04] [INFO ] Implicit Places using invariants in 75 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 81 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 264 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 4 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-02 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 25 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-31 18:18:05] [INFO ] Computed 24 invariants in 2 ms
[2024-05-31 18:18:05] [INFO ] Implicit Places using invariants in 67 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2024-05-31 18:18:05] [INFO ] Actually due to overlaps returned [24, 25, 26, 27, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 68 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/140 places, 64/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 64/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-03
Product exploration explored 100000 steps with 10694 reset in 241 ms.
Stack based approach found an accepted trace after 23 steps with 2 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-03 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 13 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
[2024-05-31 18:18:05] [INFO ] Invariant cache hit.
[2024-05-31 18:18:05] [INFO ] Implicit Places using invariants in 63 ms returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2024-05-31 18:18:05] [INFO ] Actually due to overlaps returned [24, 25, 26, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/140 places, 64/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 68/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 181 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-04 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:18:05] [INFO ] Computed 28 invariants in 6 ms
[2024-05-31 18:18:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 18:18:05] [INFO ] Invariant cache hit.
[2024-05-31 18:18:05] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2663 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5302ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5304ms
Finished structural reductions in LTL mode , in 1 iterations and 5473 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-06 finished in 5593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:11] [INFO ] Invariant cache hit.
[2024-05-31 18:18:11] [INFO ] Implicit Places using invariants in 66 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 67 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-07
Product exploration explored 100000 steps with 6992 reset in 158 ms.
Stack based approach found an accepted trace after 5267 steps with 372 reset with depth 35 and stack size 35 in 11 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-07 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(p0) U p1)))))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 10 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:11] [INFO ] Invariant cache hit.
[2024-05-31 18:18:11] [INFO ] Implicit Places using invariants in 66 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 67 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-10
Product exploration explored 100000 steps with 156 reset in 129 ms.
Stack based approach found an accepted trace after 1360 steps with 1 reset with depth 1257 and stack size 1257 in 2 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-10 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U X(G(p2)))))'
Support contains 40 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:12] [INFO ] Invariant cache hit.
[2024-05-31 18:18:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 18:18:12] [INFO ] Invariant cache hit.
[2024-05-31 18:18:12] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:18:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5306ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5307ms
Finished structural reductions in LTL mode , in 1 iterations and 5459 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p2), (NOT p2), true, (AND p2 (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-11 finished in 5642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p0) U p1) U (p2||F(p3))))))'
Support contains 80 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:17] [INFO ] Invariant cache hit.
[2024-05-31 18:18:17] [INFO ] Implicit Places using invariants in 51 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 52 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-12
Product exploration explored 100000 steps with 5551 reset in 398 ms.
Product exploration explored 100000 steps with 5519 reset in 348 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) p1 p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))))]
Knowledge based reduction with 20 factoid took 268 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
RANDOM walk for 246 steps (0 resets) in 8 ms. (27 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) p1 p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))), (X p1), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p3) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0))))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2) (NOT p3) p1))), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 551 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:18:20] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 18:18:20] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 18:18:20] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 7 ms returned sat
[2024-05-31 18:18:20] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-31 18:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:18:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 18:18:20] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 18:18:20] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 6 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:18:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2024-05-31 18:18:20] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 18:18:21] [INFO ] Added : 81 causal constraints over 17 iterations in 230 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 80 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:21] [INFO ] Invariant cache hit.
[2024-05-31 18:18:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 18:18:21] [INFO ] Invariant cache hit.
[2024-05-31 18:18:21] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-31 18:18:21] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-31 18:18:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 4 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-31 18:18:21] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:22] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:18:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4342 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 112/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 272 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5654 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 10013ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10015ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10190 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p3) p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))))), (X (X (AND p0 (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 20 factoid took 304 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
RANDOM walk for 738 steps (0 resets) in 9 ms. (73 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) p1 p0), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p3) p1)), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1))))), (X (X (AND p0 (NOT p2) (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2) (NOT p3) p1))), (F (NOT p0))]
Knowledge based reduction with 20 factoid took 685 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 5 states, 15 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
[2024-05-31 18:18:33] [INFO ] Invariant cache hit.
[2024-05-31 18:18:33] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-31 18:18:33] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 18:18:33] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-31 18:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:18:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-31 18:18:33] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 18:18:33] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 2 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 2 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:18:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 411 ms
[2024-05-31 18:18:33] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 18:18:34] [INFO ] Added : 81 causal constraints over 17 iterations in 226 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 5553 reset in 332 ms.
Product exploration explored 100000 steps with 5515 reset in 347 ms.
Support contains 80 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:35] [INFO ] Invariant cache hit.
[2024-05-31 18:18:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:18:35] [INFO ] Invariant cache hit.
[2024-05-31 18:18:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-31 18:18:35] [INFO ] Redundant transitions in 7 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-31 18:18:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:18:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:36] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:18:37] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 160 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/252 variables, 124/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 112/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 272 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 9924ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9927ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10086 ms. Remains : 124/124 places, 128/128 transitions.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-12 finished in 27338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1||G(p2)))))'
Support contains 44 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:18:45] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 18:18:45] [INFO ] Implicit Places using invariants in 65 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 66 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-13 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(F(p1)))) U (p0 U G(p2)))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:18:45] [INFO ] Invariant cache hit.
[2024-05-31 18:18:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 18:18:45] [INFO ] Invariant cache hit.
[2024-05-31 18:18:45] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 168 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 128/268 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 112/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2813 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 5345ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5347ms
Finished structural reductions in LTL mode , in 1 iterations and 5488 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-15
Product exploration explored 100000 steps with 24115 reset in 184 ms.
Product exploration explored 100000 steps with 24048 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 121 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 28602 steps (5 resets) in 154 ms. (184 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 519 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 112
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 112
Applied a total of 32 rules in 15 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
// Phase 1: matrix 112 rows 124 cols
[2024-05-31 18:18:53] [INFO ] Computed 28 invariants in 3 ms
[2024-05-31 18:18:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 18:18:53] [INFO ] Invariant cache hit.
[2024-05-31 18:18:53] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-31 18:18:53] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-31 18:18:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 152 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1977 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2405 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4393ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4395ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/140 places, 112/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4548 ms. Remains : 124/140 places, 112/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 97 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 27029 steps (5 resets) in 88 ms. (303 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 23 factoid took 465 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 7032 reset in 245 ms.
Product exploration explored 100000 steps with 7065 reset in 260 ms.
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-31 18:18:59] [INFO ] Invariant cache hit.
[2024-05-31 18:18:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 18:18:59] [INFO ] Invariant cache hit.
[2024-05-31 18:18:59] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-31 18:18:59] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-31 18:18:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 152 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4413ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4415ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4556 ms. Remains : 124/124 places, 112/112 transitions.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-15 finished in 18299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!p0) U p1) U (p2||F(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(F(p1)))) U (p0 U G(p2)))))'
Found a Lengthening insensitive property : DatabaseWithMutex-COL-04-LTLCardinality-15
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p0)]
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 112
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 112
Applied a total of 32 rules in 9 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
[2024-05-31 18:19:04] [INFO ] Invariant cache hit.
[2024-05-31 18:19:04] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 18:19:04] [INFO ] Invariant cache hit.
[2024-05-31 18:19:04] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-31 18:19:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 152 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2404 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4424ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4426ms
Starting structural reductions in LI_LTL mode, iteration 1 : 124/140 places, 112/128 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4563 ms. Remains : 124/140 places, 112/128 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-15
Product exploration explored 100000 steps with 24125 reset in 142 ms.
Product exploration explored 100000 steps with 24093 reset in 150 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 33355 steps (7 resets) in 83 ms. (397 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (OR p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 587 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-31 18:19:10] [INFO ] Invariant cache hit.
[2024-05-31 18:19:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 18:19:10] [INFO ] Invariant cache hit.
[2024-05-31 18:19:10] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-31 18:19:10] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-31 18:19:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 152 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2395 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4385ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4387ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4532 ms. Remains : 124/124 places, 112/112 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 138 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 31343 steps (7 resets) in 84 ms. (368 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (OR p0 p2))), (F (NOT p0))]
Knowledge based reduction with 23 factoid took 482 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p1), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2) p0)]
Product exploration explored 100000 steps with 7101 reset in 251 ms.
Product exploration explored 100000 steps with 7110 reset in 254 ms.
Support contains 52 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-31 18:19:17] [INFO ] Invariant cache hit.
[2024-05-31 18:19:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 18:19:17] [INFO ] Invariant cache hit.
[2024-05-31 18:19:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-31 18:19:17] [INFO ] Redundant transitions in 0 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-31 18:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 152 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 112/236 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 96/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 248 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints]
After SMT, in 4275ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4430 ms. Remains : 124/124 places, 112/112 transitions.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-15 finished in 17342 ms.
[2024-05-31 18:19:21] [INFO ] Flatten gal took : 9 ms
[2024-05-31 18:19:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 18:19:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 128 transitions and 416 arcs took 3 ms.
Total runtime 85216 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717179670358

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name DatabaseWithMutex-COL-04-LTLCardinality-12
ltl formula formula --ltl=/tmp/1750/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1750/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1750/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1750/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1750/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 141 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 141, there are 151 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~40 levels ~10000 states ~25792 transitions
pnml2lts-mc( 2/ 4): ~40 levels ~20000 states ~52952 transitions
pnml2lts-mc( 2/ 4): ~40 levels ~40000 states ~111436 transitions
pnml2lts-mc( 2/ 4): ~40 levels ~80000 states ~246612 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~160000 states ~496076 transitions
pnml2lts-mc( 3/ 4): ~40 levels ~320000 states ~1137644 transitions
pnml2lts-mc( 0/ 4): ~40 levels ~640000 states ~2471764 transitions
pnml2lts-mc( 1/ 4): ~40 levels ~1280000 states ~7487396 transitions
pnml2lts-mc( 1/ 4): ~40 levels ~2560000 states ~15222648 transitions
pnml2lts-mc( 1/ 4): ~51 levels ~5120000 states ~31371336 transitions
pnml2lts-mc( 1/ 4): ~51 levels ~10240000 states ~62111056 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~20480000 states ~107775096 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553101
pnml2lts-mc( 0/ 4): unique states count: 33553207
pnml2lts-mc( 0/ 4): unique transitions count: 204628547
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 171074051
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553210
pnml2lts-mc( 0/ 4): - cum. max stack depth: 182
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553210 states 204628644 transitions, fanout: 6.099
pnml2lts-mc( 0/ 4): Total exploration time 108.190 sec (108.130 sec minimum, 108.158 sec on average)
pnml2lts-mc( 0/ 4): States per second: 310132, Transitions per second: 1891382
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 294.2MB, 9.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/59.0%
pnml2lts-mc( 0/ 4): Stored 128 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 294.2MB (~256.0MB paged-in)
ltl formula name DatabaseWithMutex-COL-04-LTLCardinality-15
ltl formula formula --ltl=/tmp/1750/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1750/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1750/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1750/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1750/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 141 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 141, there are 150 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~129!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 554
pnml2lts-mc( 0/ 4): unique states count: 868
pnml2lts-mc( 0/ 4): unique transitions count: 2459
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 118
pnml2lts-mc( 0/ 4): - claim found count: 30
pnml2lts-mc( 0/ 4): - claim success count: 872
pnml2lts-mc( 0/ 4): - cum. max stack depth: 320
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 872 states 2550 transitions, fanout: 2.924
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 87200, Transitions per second: 255000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 28.4 B/state, compr.: 5.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 128 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DatabaseWithMutex-COL-04, 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 r488-tall-171631131700011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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