fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r135-tall-171631130200004
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DatabaseWithMutex-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
430.544 25430.00 43950.00 389.00 FFTTFFFFFFFFFFTT normal

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-171631130200004.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130200004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 17:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 17:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:56 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 3.7K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 17:56 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 19K 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-02-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716320794265

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:46:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 19:46:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:46:35] [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:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:46:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 675 ms
[2024-05-21 19:46:36] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:46:36] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2024-05-21 19:46:36] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-LTLFireability-07 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 6797 steps (0 resets) in 244 ms. (27 steps per ms) remains 0/12 properties
[2024-05-21 19:46:36] [INFO ] Flatten gal took : 15 ms
[2024-05-21 19:46:36] [INFO ] Flatten gal took : 2 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:36] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions 88 arcs in 10 ms.
[2024-05-21 19:46:36] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-21 19:46:36] [INFO ] Reduced 2 identical enabling conditions.
[2024-05-21 19:46:36] [INFO ] Reduced 2 identical enabling conditions.
[2024-05-21 19:46:36] [INFO ] Reduced 2 identical enabling conditions.
[2024-05-21 19:46:36] [INFO ] Reduced 2 identical enabling conditions.
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 10 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2024-05-21 19:46:36] [INFO ] Computed 10 invariants in 22 ms
[2024-05-21 19:46:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 19:46:36] [INFO ] Invariant cache hit.
[2024-05-21 19:46:36] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-21 19:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 48 constraints, problems are : Problem set: 0 solved, 28 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 76 constraints, problems are : Problem set: 0 solved, 28 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 749ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 758ms
Finished structural reductions in LTL mode , in 1 iterations and 1004 ms. Remains : 38/38 places, 32/32 transitions.
Support contains 38 out of 38 places after structural reductions.
[2024-05-21 19:46:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:46:37] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:46:37] [INFO ] Input system was already deterministic with 32 transitions.
Reduction of identical properties reduced properties to check from 16 to 14
RANDOM walk for 507 steps (0 resets) in 20 ms. (24 steps per ms) remains 0/14 properties
FORMULA DatabaseWithMutex-COL-02-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((G(p0)&&F(p1))))'
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-21 19:46:38] [INFO ] Invariant cache hit.
[2024-05-21 19:46:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:46:38] [INFO ] Invariant cache hit.
[2024-05-21 19:46:38] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-21 19:46:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 48 constraints, problems are : Problem set: 0 solved, 28 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 76 constraints, problems are : Problem set: 0 solved, 28 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 822ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 823ms
Finished structural reductions in LTL mode , in 1 iterations and 897 ms. Remains : 38/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-00 finished in 1198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 10 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-05-21 19:46:39] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 19:46:39] [INFO ] Implicit Places using invariants in 32 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-03
Product exploration explored 100000 steps with 12727 reset in 278 ms.
Product exploration explored 100000 steps with 12721 reset in 191 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 p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 201 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
// Phase 1: matrix 32 rows 32 cols
[2024-05-21 19:46:40] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:46:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:46:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-21 19:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:46:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:46:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-21 19:46:40] [INFO ] Computed and/alt/rep : 28/28/28 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 19:46:40] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 32/32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 32 transition count 28
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 28 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 24 transition count 24
Applied a total of 16 rules in 9 ms. Remains 24 /32 variables (removed 8) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2024-05-21 19:46:40] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:46:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 19:46:40] [INFO ] Invariant cache hit.
[2024-05-21 19:46:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-21 19:46:40] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 19:46:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 28 constraints, problems are : Problem set: 0 solved, 20 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 20 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 388ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/32 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 24/32 places, 24/32 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 60 steps (0 resets) in 6 ms. (8 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-21 19:46:42] [INFO ] Invariant cache hit.
[2024-05-21 19:46:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:46:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 19:46:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:46:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-21 19:46:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-21 19:46:42] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 19:46:42] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 12708 reset in 117 ms.
Product exploration explored 100000 steps with 12702 reset in 102 ms.
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-21 19:46:42] [INFO ] Invariant cache hit.
[2024-05-21 19:46:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 19:46:42] [INFO ] Invariant cache hit.
[2024-05-21 19:46:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 19:46:42] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 19:46:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 28 constraints, problems are : Problem set: 0 solved, 20 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 20 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 335ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 24/24 places, 24/24 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-03 finished in 3993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X((!p1||G(p0))) U (p1 U p0))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-05-21 19:46:43] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 19:46:43] [INFO ] Implicit Places using invariants in 104 ms returned [24, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 108 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-04 finished in 341 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(X(X(F(!p0))))))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
[2024-05-21 19:46:43] [INFO ] Invariant cache hit.
[2024-05-21 19:46:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-21 19:46:43] [INFO ] Invariant cache hit.
[2024-05-21 19:46:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-21 19:46:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 32/66 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 40 constraints, problems are : Problem set: 0 solved, 28 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 32/66 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 68 constraints, problems are : Problem set: 0 solved, 28 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 504ms
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 32/32 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, p0, p0]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-05
Product exploration explored 100000 steps with 19707 reset in 68 ms.
Stack based approach found an accepted trace after 88915 steps with 17517 reset with depth 12 and stack size 12 in 57 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-05 finished in 870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2024-05-21 19:46:44] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 19:46:44] [INFO ] Implicit Places using invariants in 30 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-06
Product exploration explored 100000 steps with 1262 reset in 94 ms.
Stack based approach found an accepted trace after 56 steps with 1 reset with depth 47 and stack size 47 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-06 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 34 transition count 24
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 26 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 22 transition count 20
Applied a total of 28 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 20/32 (removed 12) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-21 19:46:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:46:44] [INFO ] Implicit Places using invariants in 28 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/38 places, 20/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 20/38 places, 20/32 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 78 ms.
Stack based approach found an accepted trace after 16 steps with 1 reset with depth 11 and stack size 11 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-08 finished in 218 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)&&F(p1)))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 34 transition count 24
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 30 place count 24 transition count 16
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 42 place count 16 transition count 12
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 46 place count 12 transition count 12
Applied a total of 46 rules in 3 ms. Remains 12 /38 variables (removed 26) and now considering 12/32 (removed 20) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-21 19:46:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:46:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-21 19:46:44] [INFO ] Invariant cache hit.
[2024-05-21 19:46:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-21 19:46:45] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 19:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/38 places, 12/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 12/38 places, 12/32 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-09
Product exploration explored 100000 steps with 27569 reset in 103 ms.
Stack based approach found an accepted trace after 31 steps with 8 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-09 finished in 444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(p1)))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 34 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 30 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 26 transition count 24
Applied a total of 20 rules in 4 ms. Remains 26 /38 variables (removed 12) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2024-05-21 19:46:45] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 19:46:45] [INFO ] Implicit Places using invariants in 24 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 24/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 24/38 places, 24/32 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-10
Product exploration explored 100000 steps with 8727 reset in 76 ms.
Stack based approach found an accepted trace after 646 steps with 55 reset with depth 11 and stack size 11 in 1 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-10 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X((p2&&F(G(!p1))))))'
Support contains 18 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2024-05-21 19:46:45] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 19:46:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-21 19:46:45] [INFO ] Invariant cache hit.
[2024-05-21 19:46:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-21 19:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 48 constraints, problems are : Problem set: 0 solved, 28 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 76 constraints, problems are : Problem set: 0 solved, 28 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 38/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p2)), (OR (NOT p2) p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), true, p1, (NOT p0), (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-11 finished in 967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((F(!p1) U p2))))))'
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 28
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 14 place count 32 transition count 24
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 28 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 18 place count 28 transition count 20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 24 transition count 20
Applied a total of 26 rules in 6 ms. Remains 24 /38 variables (removed 14) and now considering 20/32 (removed 12) transitions.
// Phase 1: matrix 20 rows 24 cols
[2024-05-21 19:46:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:46:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 19:46:46] [INFO ] Invariant cache hit.
[2024-05-21 19:46:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 19:46:46] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-21 19:46:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 20/44 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 32 constraints, problems are : Problem set: 0 solved, 16 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 20/44 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/44 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 48 constraints, problems are : Problem set: 0 solved, 16 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 20/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 24/38 places, 20/32 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-12
Product exploration explored 100000 steps with 19282 reset in 118 ms.
Stack based approach found an accepted trace after 112 steps with 20 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-12 finished in 622 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 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2024-05-21 19:46:47] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 19:46:47] [INFO ] Implicit Places using invariants in 36 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-13 finished in 136 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) U (X(X(F(!p2)))||p1))||X(G(p3))))'
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-21 19:46:47] [INFO ] Invariant cache hit.
[2024-05-21 19:46:47] [INFO ] Implicit Places using invariants in 33 ms returned [28, 29]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 36/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 p2 p1 (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), (AND p0 p2), (AND p0 p2 (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-14
Product exploration explored 100000 steps with 18329 reset in 110 ms.
Product exploration explored 100000 steps with 18215 reset in 122 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 p1) p0 (NOT p3) (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) p3)), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 19 factoid took 355 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X p3), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) p3)), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT (AND (NOT p1) p0 p3 p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 19 factoid took 546 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
Support contains 16 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2024-05-21 19:46:49] [INFO ] Computed 8 invariants in 0 ms
[2024-05-21 19:46:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 19:46:49] [INFO ] Invariant cache hit.
[2024-05-21 19:46:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-21 19:46:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/68 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 44 constraints, problems are : Problem set: 0 solved, 28 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/68 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 72 constraints, problems are : Problem set: 0 solved, 28 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 538ms
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 36/36 places, 32/32 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 p1) (NOT p2) p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p1), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 260 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
Product exploration explored 100000 steps with 11109 reset in 76 ms.
Product exploration explored 100000 steps with 11114 reset in 88 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0)]
Support contains 16 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 32
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 4 place count 36 transition count 32
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 36 transition count 32
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 28 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 28 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 28 rules in 6 ms. Remains 28 /36 variables (removed 8) and now considering 24/32 (removed 8) transitions.
[2024-05-21 19:46:51] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 28 cols
[2024-05-21 19:46:51] [INFO ] Computed 8 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-21 19:46:52] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 7 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 19:46:52] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-21 19:46:52] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-21 19:46:52] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 4/12 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 24/52 variables, 28/40 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 40 constraints, problems are : Problem set: 4 solved, 16 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 6/28 variables, 5/9 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 24/52 variables, 28/40 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 16/56 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/56 constraints. Problems are: Problem set: 4 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 56 constraints, problems are : Problem set: 4 solved, 16 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 16/20 constraints, Known Traps: 4/4 constraints]
After SMT, in 482ms problems are : Problem set: 4 solved, 16 unsolved
Search for dead transitions found 4 dead transitions in 482ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 28/36 places, 20/32 transitions.
Graph (complete) has 40 edges and 28 vertex of which 24 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 24 /28 variables (removed 4) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/36 places, 20/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 500 ms. Remains : 24/36 places, 20/32 transitions.
Support contains 16 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 36 /36 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 36 cols
[2024-05-21 19:46:52] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 19:46:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 19:46:52] [INFO ] Invariant cache hit.
[2024-05-21 19:46:52] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-05-21 19:46:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/68 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/68 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 44 constraints, problems are : Problem set: 0 solved, 28 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 32/68 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 28/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/68 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 72 constraints, problems are : Problem set: 0 solved, 28 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 565ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 565ms
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 36/36 places, 32/32 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-14 finished in 5715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 34 transition count 20
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 20 transition count 12
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 46 place count 12 transition count 12
Applied a total of 46 rules in 1 ms. Remains 12 /38 variables (removed 26) and now considering 12/32 (removed 20) transitions.
// Phase 1: matrix 12 rows 12 cols
[2024-05-21 19:46:53] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:46:53] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 19:46:53] [INFO ] Invariant cache hit.
[2024-05-21 19:46:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-21 19:46:53] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 19:46:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/38 places, 12/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 12/38 places, 12/32 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-15
Product exploration explored 100000 steps with 14217 reset in 56 ms.
Product exploration explored 100000 steps with 14277 reset in 66 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 19:46:53] [INFO ] Invariant cache hit.
[2024-05-21 19:46:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-21 19:46:54] [INFO ] Invariant cache hit.
[2024-05-21 19:46:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-21 19:46:54] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 19:46:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 12/12 places, 12/12 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
RANDOM walk for 15 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Product exploration explored 100000 steps with 14232 reset in 64 ms.
Product exploration explored 100000 steps with 14388 reset in 55 ms.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-05-21 19:46:54] [INFO ] Invariant cache hit.
[2024-05-21 19:46:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-21 19:46:54] [INFO ] Invariant cache hit.
[2024-05-21 19:46:54] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-21 19:46:54] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-21 19:46:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 24 constraints, problems are : Problem set: 0 solved, 8 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 12/12 places, 12/12 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-15 finished in 2024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-02-LTLFireability-03
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 34 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 30 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 26 transition count 24
Applied a total of 20 rules in 6 ms. Remains 26 /38 variables (removed 12) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 26 cols
[2024-05-21 19:46:55] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 19:46:55] [INFO ] Implicit Places using invariants in 29 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 24/38 places, 24/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 38 ms. Remains : 24/38 places, 24/32 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-02-LTLFireability-03
Product exploration explored 100000 steps with 12728 reset in 68 ms.
Product exploration explored 100000 steps with 12731 reset in 78 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 p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 101 steps (0 resets) in 4 ms. (20 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
// Phase 1: matrix 24 rows 24 cols
[2024-05-21 19:46:56] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 19:46:56] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:46:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 19:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:46:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-21 19:46:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-21 19:46:56] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 19:46:56] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-21 19:46:56] [INFO ] Invariant cache hit.
[2024-05-21 19:46:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 19:46:56] [INFO ] Invariant cache hit.
[2024-05-21 19:46:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 19:46:56] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 19:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 28 constraints, problems are : Problem set: 0 solved, 20 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 20 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 333ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 24/24 places, 24/24 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 122 steps (0 resets) in 4 ms. (24 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 341 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-21 19:46:57] [INFO ] Invariant cache hit.
[2024-05-21 19:46:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:46:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 19:46:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:46:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:46:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-21 19:46:57] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 19:46:57] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 12710 reset in 79 ms.
Product exploration explored 100000 steps with 12732 reset in 89 ms.
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 24/24 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-21 19:46:58] [INFO ] Invariant cache hit.
[2024-05-21 19:46:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-21 19:46:58] [INFO ] Invariant cache hit.
[2024-05-21 19:46:58] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-21 19:46:58] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-21 19:46:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 28 constraints, problems are : Problem set: 0 solved, 20 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 24/48 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 20 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 303ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 24/24 places, 24/24 transitions.
Treatment of property DatabaseWithMutex-COL-02-LTLFireability-03 finished in 3499 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) U (X(X(F(!p2)))||p1))||X(G(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' '!(G(F(!p0)))'
[2024-05-21 19:46:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:46:58] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 19:46:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 32 transitions and 88 arcs took 3 ms.
Total runtime 23366 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DatabaseWithMutex-COL-02

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/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: 1802
MODEL NAME: /home/mcc/execution/414/model
38 places, 32 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DatabaseWithMutex-COL-02-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-02-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DatabaseWithMutex-COL-02-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716320819695

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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-02"
export BK_EXAMINATION="LTLFireability"
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-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631130200004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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