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.r135-tall-171631130200011.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 greatspnxred
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 r135-tall-171631130200011
=====================================================================

--------------------
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 1716320810218

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:46:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 19:46:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:46:51] [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-21 19:46:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:46:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 546 ms
[2024-05-21 19:46:51] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:46:52] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2024-05-21 19:46:52] [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 40008 steps (8 resets) in 400 ms. (99 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 19:46:52] [INFO ] Computed 4 invariants in 3 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 170 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 210ms 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-21 19:46:52] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:46:52] [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-21 19:46:52] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 14 ms.
[2024-05-21 19:46:52] [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 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-21 19:46:52] [INFO ] Computed 28 invariants in 8 ms
[2024-05-21 19:46:52] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 19:46:52] [INFO ] Invariant cache hit.
[2024-05-21 19:46:53] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 19:46:53] [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 3097 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 3058 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 6223ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6228ms
Finished structural reductions in LTL mode , in 1 iterations and 6508 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2024-05-21 19:46:59] [INFO ] Flatten gal took : 19 ms
[2024-05-21 19:46:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:46:59] [INFO ] Input system was already deterministic with 128 transitions.
RANDOM walk for 40000 steps (8 resets) in 797 ms. (50 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
[2024-05-21 19:46:59] [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 17 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 36ms 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 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 19:47:00] [INFO ] Invariant cache hit.
[2024-05-21 19:47:00] [INFO ] Implicit Places using invariants in 89 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 92 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 101 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 280 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 43 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-02 finished in 429 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 22 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-21 19:47:00] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 19:47:00] [INFO ] Implicit Places using invariants in 69 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-21 19:47:00] [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 70 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 2 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 94 ms. Remains : 64/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 43 ms :[p0]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-03
Product exploration explored 100000 steps with 10592 reset in 248 ms.
Stack based approach found an accepted trace after 81 steps with 9 reset with depth 7 and stack size 7 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-03 finished in 405 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 12 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
[2024-05-21 19:47:00] [INFO ] Invariant cache hit.
[2024-05-21 19:47:01] [INFO ] Implicit Places using invariants in 55 ms returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2024-05-21 19:47:01] [INFO ] Actually due to overlaps returned [24, 25, 26, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 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 3 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 71 ms. Remains : 68/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 196 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 85 in 0 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-04 finished in 313 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 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-21 19:47:01] [INFO ] Computed 28 invariants in 7 ms
[2024-05-21 19:47:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 19:47:01] [INFO ] Invariant cache hit.
[2024-05-21 19:47:01] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 19:47:01] [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 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]
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 2775 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 5457ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5459ms
Finished structural reductions in LTL mode , in 1 iterations and 5648 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 77 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 5738 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 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 19:47:07] [INFO ] Invariant cache hit.
[2024-05-21 19:47:07] [INFO ] Implicit Places using invariants in 62 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 62 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 68 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 135 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 6975 reset in 155 ms.
Stack based approach found an accepted trace after 435 steps with 26 reset with depth 38 and stack size 38 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-07 finished in 369 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 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 19:47:07] [INFO ] Invariant cache hit.
[2024-05-21 19:47:07] [INFO ] Implicit Places using invariants in 73 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 74 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 80 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 178 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 157 reset in 128 ms.
Stack based approach found an accepted trace after 477 steps with 1 reset with depth 214 and stack size 214 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-10 finished in 404 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-21 19:47:07] [INFO ] Invariant cache hit.
[2024-05-21 19:47:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 19:47:07] [INFO ] Invariant cache hit.
[2024-05-21 19:47:07] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 19:47:07] [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 2595 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 2831 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 5443ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5446ms
Finished structural reductions in LTL mode , in 1 iterations and 5597 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 181 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 5803 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 8 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 19:47:13] [INFO ] Invariant cache hit.
[2024-05-21 19:47:13] [INFO ] Implicit Places using invariants in 54 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 57 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 69 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 200 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 5510 reset in 367 ms.
Product exploration explored 100000 steps with 5454 reset in 308 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 287 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 199 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 154 steps (0 resets) in 8 ms. (17 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 795 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 178 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 203 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-21 19:47:16] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 19:47:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 19:47:16] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 14 ms returned sat
[2024-05-21 19:47:16] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-21 19:47:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:47:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 19:47:16] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 19:47:16] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 6 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-21 19:47:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 148 ms
[2024-05-21 19:47:16] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 19:47:17] [INFO ] Added : 81 causal constraints over 17 iterations in 232 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 5 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 19:47:17] [INFO ] Invariant cache hit.
[2024-05-21 19:47:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 19:47:17] [INFO ] Invariant cache hit.
[2024-05-21 19:47:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 19:47:17] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-21 19:47:17] [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-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 19:47:17] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-21 19:47:18] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 19:47:18] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-21 19:47:18] [INFO ] Deduced a trap composed of 15 places in 20 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-21 19:47:18] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 19:47:18] [INFO ] Deduced a trap composed of 15 places in 17 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-21 19:47:18] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 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-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:47:19] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 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 4284 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 5606 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 9905ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 9906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10081 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 277 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 221 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 414 steps (0 resets) in 11 ms. (34 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 619 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 238 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 203 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-21 19:47:28] [INFO ] Invariant cache hit.
[2024-05-21 19:47:28] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 19:47:28] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 19:47:28] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-21 19:47:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:47:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 19:47:28] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 19:47:29] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 8 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 19:47:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 422 ms
[2024-05-21 19:47:29] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-21 19:47:29] [INFO ] Added : 81 causal constraints over 17 iterations in 236 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 248 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 5518 reset in 305 ms.
Product exploration explored 100000 steps with 5530 reset in 335 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-21 19:47:30] [INFO ] Invariant cache hit.
[2024-05-21 19:47:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:47:30] [INFO ] Invariant cache hit.
[2024-05-21 19:47:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-21 19:47:30] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-21 19:47:30] [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-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 18 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-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 15 places in 23 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-21 19:47:32] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 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-21 19:47:33] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 19:47:33] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-21 19:47:33] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-21 19:47:33] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 19:47:33] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-21 19:47:33] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 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 4317 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 5697 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 10035ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10036ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10192 ms. Remains : 124/124 places, 128/128 transitions.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-12 finished in 27284 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-21 19:47:40] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 19:47:41] [INFO ] Implicit Places using invariants in 310 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 312 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 314 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 135 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 157 ms.
Product exploration explored 100000 steps with 50000 reset in 159 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 18 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 799 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 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 19:47:41] [INFO ] Invariant cache hit.
[2024-05-21 19:47:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:47:41] [INFO ] Invariant cache hit.
[2024-05-21 19:47:41] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 19:47:41] [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 2602 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 2832 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 5448ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5449ms
Finished structural reductions in LTL mode , in 1 iterations and 5616 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 281 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 24181 reset in 197 ms.
Product exploration explored 100000 steps with 24330 reset in 151 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 123 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 246 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 31672 steps (7 resets) in 147 ms. (214 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 500 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 169 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 156 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 11 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
// Phase 1: matrix 112 rows 124 cols
[2024-05-21 19:47:49] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 19:47:49] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 19:47:49] [INFO ] Invariant cache hit.
[2024-05-21 19:47:49] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-21 19:47:49] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-21 19:47:49] [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 2021 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 4436ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4437ms
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 4589 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 109 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 154 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 31850 steps (7 resets) in 86 ms. (366 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 462 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 147 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)]
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)]
Product exploration explored 100000 steps with 7049 reset in 252 ms.
Product exploration explored 100000 steps with 7085 reset in 263 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-21 19:47:55] [INFO ] Invariant cache hit.
[2024-05-21 19:47:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 19:47:55] [INFO ] Invariant cache hit.
[2024-05-21 19:47:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-21 19:47:55] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-21 19:47:55] [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 2024 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 2476 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 4514ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4515ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4658 ms. Remains : 124/124 places, 112/112 transitions.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-15 finished in 18596 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 281 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 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 6 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
[2024-05-21 19:48:00] [INFO ] Invariant cache hit.
[2024-05-21 19:48:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 19:48:00] [INFO ] Invariant cache hit.
[2024-05-21 19:48:01] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-21 19:48:01] [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 2038 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 2474 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 4525ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4526ms
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 4663 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 24072 reset in 148 ms.
Product exploration explored 100000 steps with 24118 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 130 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 23779 steps (5 resets) in 62 ms. (377 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 530 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 165 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 7 ms. Remains 124 /124 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-21 19:48:07] [INFO ] Invariant cache hit.
[2024-05-21 19:48:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 19:48:07] [INFO ] Invariant cache hit.
[2024-05-21 19:48:07] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-21 19:48:07] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-21 19:48:07] [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 1957 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 2386 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 4354ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4355ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4506 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 106 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)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 26184 steps (5 resets) in 74 ms. (349 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 381 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 162 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 157 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 143 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 7020 reset in 254 ms.
Product exploration explored 100000 steps with 7089 reset in 272 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 8 ms. Remains 124 /124 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-21 19:48:13] [INFO ] Invariant cache hit.
[2024-05-21 19:48:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:48:13] [INFO ] Invariant cache hit.
[2024-05-21 19:48:13] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 19:48:13] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-21 19:48:13] [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 2018 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 2485 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 4516ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4661 ms. Remains : 124/124 places, 112/112 transitions.
Treatment of property DatabaseWithMutex-COL-04-LTLCardinality-15 finished in 17456 ms.
[2024-05-21 19:48:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:48:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 19:48:17] [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 86684 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DatabaseWithMutex-COL-04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 140
TRANSITIONS: 128
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1799
MODEL NAME: /home/mcc/execution/417/model
140 places, 128 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-12 CANNOT_COMPUTE
FORMULA DatabaseWithMutex-COL-04-LTLCardinality-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716321409240

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r135-tall-171631130200011"
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 ;