Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 20K Apr 11 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 11 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 164K Apr 11 18:00 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 12K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 61K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 337K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 234K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 61K 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-PT-04-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717181589172

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:53:10] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-31 18:53:10] [INFO ] Transformed 140 places.
[2024-05-31 18:53:10] [INFO ] Transformed 128 transitions.
[2024-05-31 18:53:10] [INFO ] Found NUPN structural information;
[2024-05-31 18:53:10] [INFO ] Parsed PT model containing 140 places and 128 transitions and 416 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-31 18:53:10] [INFO ] Reduced 12 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 109 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 21 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:53:10] [INFO ] Computed 28 invariants in 20 ms
[2024-05-31 18:53:10] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-31 18:53:10] [INFO ] Invariant cache hit.
[2024-05-31 18:53:11] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:53:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/268 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 308 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4137 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 3/140 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/268 variables, 140/308 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 112/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 420 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4151 ms.
Refiners :[Domain max(s): 140/140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
After SMT, in 8364ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8378ms
Finished structural reductions in LTL mode , in 1 iterations and 8778 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 109 out of 140 places after structural reductions.
[2024-05-31 18:53:19] [INFO ] Flatten gal took : 35 ms
[2024-05-31 18:53:19] [INFO ] Flatten gal took : 15 ms
[2024-05-31 18:53:19] [INFO ] Input system was already deterministic with 128 transitions.
Reduction of identical properties reduced properties to check from 27 to 21
RANDOM walk for 2384 steps (0 resets) in 83 ms. (28 steps per ms) remains 0/21 properties
FORMULA DatabaseWithMutex-PT-04-LTLFireability-13 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' '!((p0 U X(G(p1))))'
Support contains 20 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:53:20] [INFO ] Invariant cache hit.
[2024-05-31 18:53:20] [INFO ] Implicit Places using invariants in 144 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 149 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-00
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-00 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Applied a total of 132 rules in 24 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-31 18:53:20] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 18:53:20] [INFO ] Implicit Places using invariants in 72 ms returned [0, 2, 5, 7, 8, 12, 13, 15, 16, 18, 19, 20, 23, 25, 26, 33, 36, 41, 42, 43, 44, 46, 47, 49, 51, 57, 60, 62, 63, 64, 65, 70]
[2024-05-31 18:53:20] [INFO ] Actually due to overlaps returned [0, 8, 18, 26, 25, 42, 47, 70]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 74 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/140 places, 64/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 64/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 14475 reset in 433 ms.
Product exploration explored 100000 steps with 14431 reset in 293 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 p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 213 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 14 steps (0 resets) in 6 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 355 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 36 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2024-05-31 18:53:22] [INFO ] Computed 16 invariants in 3 ms
[2024-05-31 18:53:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 18:53:22] [INFO ] Invariant cache hit.
[2024-05-31 18:53:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-31 18:53:22] [INFO ] Redundant transitions in 2 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-31 18:53:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 4/64 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 8 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 6 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 3 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 18:53:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 64/128 variables, 64/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 155 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1686 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 4/64 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 64/128 variables, 64/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 48/203 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 203 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1157 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
After SMT, in 2861ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2862ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2995 ms. Remains : 64/64 places, 64/64 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 p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14475 reset in 222 ms.
Product exploration explored 100000 steps with 14504 reset in 232 ms.
Support contains 36 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 18:53:26] [INFO ] Invariant cache hit.
[2024-05-31 18:53:26] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 18:53:26] [INFO ] Invariant cache hit.
[2024-05-31 18:53:26] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-31 18:53:26] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-31 18:53:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 4/64 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-31 18:53:27] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 64/128 variables, 64/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 155 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1355 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 4/64 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 64/128 variables, 64/155 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 48/203 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 203 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1031 ms.
Refiners :[Domain max(s): 64/64 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
After SMT, in 2395ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2396ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2535 ms. Remains : 64/64 places, 64/64 transitions.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-02 finished in 8647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(G(p2)&&p1))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:53:29] [INFO ] Computed 28 invariants in 1 ms
[2024-05-31 18:53:29] [INFO ] Implicit Places using invariants in 80 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 81 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Product exploration explored 100000 steps with 33333 reset in 246 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 p0 p1 p2), (X p2), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-03 finished in 826 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((X(X(p1))||p0)))'
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:53:30] [INFO ] Invariant cache hit.
[2024-05-31 18:53:30] [INFO ] Implicit Places using invariants in 93 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 106 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-05
Product exploration explored 100000 steps with 6105 reset in 234 ms.
Product exploration explored 100000 steps with 6132 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:53:31] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 18:53:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 18:53:31] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-31 18:53:31] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-31 18:53:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:53:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 18:53:31] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 18:53:31] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 18:53:31] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 18:53:32] [INFO ] Added : 81 causal constraints over 17 iterations in 504 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 16 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:53:32] [INFO ] Invariant cache hit.
[2024-05-31 18:53:32] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 18:53:32] [INFO ] Invariant cache hit.
[2024-05-31 18:53:32] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:53:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:53:34] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 11 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:53:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 16/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 284 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4922 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 4/124 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 112/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 396 constraints, problems are : Problem set: 0 solved, 112 unsolved in 14431 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 19370ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19374ms
Finished structural reductions in LTL mode , in 1 iterations and 19632 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 64 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 18:53:52] [INFO ] Invariant cache hit.
[2024-05-31 18:53:52] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 18:53:52] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-31 18:53:52] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-05-31 18:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:53:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 18:53:53] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-31 18:53:53] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:53:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 354 ms
[2024-05-31 18:53:53] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 18:53:54] [INFO ] Added : 108 causal constraints over 22 iterations in 470 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6117 reset in 262 ms.
Product exploration explored 100000 steps with 6135 reset in 250 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 16 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 128
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 124 transition count 128
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 124 transition count 128
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 17 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:53:54] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:53:54] [INFO ] Computed 12 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 5 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 8/134 constraints. Problems are: Problem set: 8 solved, 104 unsolved
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:53:55] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/137 constraints. Problems are: Problem set: 8 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/137 constraints. Problems are: Problem set: 8 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 4/124 variables, 2/139 constraints. Problems are: Problem set: 8 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/143 constraints. Problems are: Problem set: 8 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/147 constraints. Problems are: Problem set: 8 solved, 104 unsolved
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-31 18:53:56] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:53:57] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-31 18:53:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 13/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 16 solved, 96 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 10 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/284 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/284 constraints. Problems are: Problem set: 32 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 284 constraints, problems are : Problem set: 32 solved, 80 unsolved in 4127 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 32 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 4/92 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 24/116 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/116 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 32/120 variables, 4/120 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 32/152 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/153 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/153 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 4/124 variables, 3/156 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 4/160 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 80/364 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/364 constraints. Problems are: Problem set: 32 solved, 80 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/364 constraints. Problems are: Problem set: 32 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 364 constraints, problems are : Problem set: 32 solved, 80 unsolved in 8076 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 80/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 12227ms problems are : Problem set: 32 solved, 80 unsolved
Search for dead transitions found 32 dead transitions in 12229ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 96/128 transitions.
Graph (complete) has 224 edges and 124 vertex of which 92 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 92 /124 variables (removed 32) and now considering 96/96 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/124 places, 96/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12269 ms. Remains : 92/124 places, 96/128 transitions.
Support contains 16 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:54:07] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 18:54:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 18:54:07] [INFO ] Invariant cache hit.
[2024-05-31 18:54:07] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:54:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:54:07] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:54:07] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:54:07] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:54:07] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:54:08] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:54:08] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:54:08] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:54:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:54:09] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:54:10] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:54:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 16/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 284 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4905 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 4/124 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 112/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 396 constraints, problems are : Problem set: 0 solved, 112 unsolved in 14483 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 19414ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19416ms
Finished structural reductions in LTL mode , in 1 iterations and 19677 ms. Remains : 124/124 places, 128/128 transitions.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-05 finished in 56767 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(((p1 U p2)||p0))))'
Support contains 20 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 15 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2024-05-31 18:54:26] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 18:54:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 18:54:26] [INFO ] Invariant cache hit.
[2024-05-31 18:54:27] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-31 18:54:27] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-31 18:54:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1493 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1649 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3151ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3152ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3423 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-06
Product exploration explored 100000 steps with 9998 reset in 221 ms.
Product exploration explored 100000 steps with 9774 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F p0), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-05-31 18:54:31] [INFO ] Invariant cache hit.
[2024-05-31 18:54:31] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:54:31] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 10 ms returned sat
[2024-05-31 18:54:31] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-31 18:54:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:54:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:54:31] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 25 ms returned sat
[2024-05-31 18:54:31] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 18:54:31] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 18:54:32] [INFO ] Added : 30 causal constraints over 6 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Support contains 20 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-31 18:54:32] [INFO ] Invariant cache hit.
[2024-05-31 18:54:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 18:54:32] [INFO ] Invariant cache hit.
[2024-05-31 18:54:32] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-31 18:54:32] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-31 18:54:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1475 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1701 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3191ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3192ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3291 ms. Remains : 88/88 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p2), (F p0), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-05-31 18:54:36] [INFO ] Invariant cache hit.
[2024-05-31 18:54:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:54:36] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 11 ms returned sat
[2024-05-31 18:54:36] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 18:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:54:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:54:36] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 19 ms returned sat
[2024-05-31 18:54:36] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-31 18:54:36] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 18:54:36] [INFO ] Added : 30 causal constraints over 6 iterations in 68 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 9890 reset in 218 ms.
Product exploration explored 100000 steps with 9995 reset in 226 ms.
Support contains 20 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 88 transition count 64
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 56 transition count 48
Applied a total of 64 rules in 5 ms. Remains 56 /88 variables (removed 32) and now considering 48/80 (removed 32) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-31 18:54:37] [INFO ] Computed 24 invariants in 0 ms
[2024-05-31 18:54:37] [INFO ] Implicit Places using invariants in 81 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2024-05-31 18:54:37] [INFO ] Actually due to overlaps returned [0, 6, 14, 20, 19, 32, 36, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 82 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/88 places, 48/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 48/88 places, 48/80 transitions.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-06 finished in 10210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Applied a total of 100 rules in 7 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2024-05-31 18:54:37] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 18:54:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 18:54:37] [INFO ] Invariant cache hit.
[2024-05-31 18:54:37] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-31 18:54:37] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-31 18:54:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1476 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1689 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3175ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3291 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 7232 reset in 182 ms.
Product exploration explored 100000 steps with 7225 reset in 190 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 54 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-31 18:54:41] [INFO ] Invariant cache hit.
[2024-05-31 18:54:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:54:41] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 18 ms returned sat
[2024-05-31 18:54:41] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 18:54:41] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 18:54:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:54:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 18:54:41] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 16 ms returned sat
[2024-05-31 18:54:41] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-31 18:54:41] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 18:54:41] [INFO ] Added : 15 causal constraints over 4 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-31 18:54:41] [INFO ] Invariant cache hit.
[2024-05-31 18:54:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-31 18:54:41] [INFO ] Invariant cache hit.
[2024-05-31 18:54:41] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-31 18:54:41] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-31 18:54:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1508 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1679 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3195ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3196ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3313 ms. Remains : 88/88 places, 80/80 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)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-31 18:54:45] [INFO ] Invariant cache hit.
[2024-05-31 18:54:45] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:54:45] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 18 ms returned sat
[2024-05-31 18:54:45] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-31 18:54:45] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 18:54:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:54:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 18:54:45] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 15 ms returned sat
[2024-05-31 18:54:45] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-31 18:54:45] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 18:54:45] [INFO ] Added : 15 causal constraints over 4 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7218 reset in 187 ms.
Product exploration explored 100000 steps with 7214 reset in 194 ms.
Support contains 32 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 80/80 transitions.
Applied a total of 0 rules in 9 ms. Remains 88 /88 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-31 18:54:46] [INFO ] Invariant cache hit.
[2024-05-31 18:54:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 18:54:46] [INFO ] Invariant cache hit.
[2024-05-31 18:54:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-31 18:54:46] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-31 18:54:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/168 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 200 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1508 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 12/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 3/88 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 80/168 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 14 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1717 ms.
Refiners :[Domain max(s): 88/88 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3235ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3359 ms. Remains : 88/88 places, 80/80 transitions.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-07 finished in 12556 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((X(G(p0))&&(p1||X((F(G(p2)) U p3))))))'
Support contains 6 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:54:49] [INFO ] Computed 28 invariants in 7 ms
[2024-05-31 18:54:49] [INFO ] Implicit Places using invariants in 95 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 96 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-08
Product exploration explored 100000 steps with 9628 reset in 200 ms.
Product exploration explored 100000 steps with 9552 reset in 168 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 p1 (NOT p0) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 1342 ms. Reduced automaton from 6 states, 22 edges and 4 AP (stutter sensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
RANDOM walk for 8923 steps (1 resets) in 108 ms. (81 steps per ms) remains 0/21 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND (NOT p0) p1 (NOT p3)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND (OR p0 p1 p3) (OR (NOT p2) p3)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F p3), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 1911 ms. Reduced automaton from 5 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:54:54] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 18:54:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 18:54:54] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-31 18:54:54] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-31 18:54:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:54:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 18:54:54] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-31 18:54:54] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-31 18:54:54] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 18:54:54] [INFO ] Added : 27 causal constraints over 6 iterations in 87 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 124 transition count 104
Reduce places removed 28 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 60 rules applied. Total rules applied 84 place count 96 transition count 72
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 40 rules applied. Total rules applied 124 place count 64 transition count 64
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 132 place count 56 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 56 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 40 transition count 48
Applied a total of 164 rules in 6 ms. Remains 40 /124 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-31 18:54:54] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 18:54:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 18:54:54] [INFO ] Invariant cache hit.
[2024-05-31 18:54:54] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-31 18:54:55] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-31 18:54:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/39 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 48/88 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 88 constraints, problems are : Problem set: 0 solved, 32 unsolved in 444 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/39 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 48/88 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/88 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 120 constraints, problems are : Problem set: 0 solved, 32 unsolved in 540 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 991ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 991ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/124 places, 48/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1096 ms. Remains : 40/124 places, 48/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 2225 ms. Reduced automaton from 5 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
RANDOM walk for 1056 steps (0 resets) in 10 ms. (96 steps per ms) remains 0/21 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND (NOT p0) p1 (NOT p3)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (AND (OR p0 p1 p3) (OR (NOT p2) p3)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p1 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1 p2))), (F p3), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 2841 ms. Reduced automaton from 5 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
[2024-05-31 18:55:01] [INFO ] Invariant cache hit.
[2024-05-31 18:55:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 18:55:01] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-31 18:55:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 18:55:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:55:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 18:55:01] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-31 18:55:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 18:55:01] [INFO ] Computed and/alt/rep : 32/160/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 18:55:01] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 12433 reset in 208 ms.
Stack based approach found an accepted trace after 366 steps with 40 reset with depth 6 and stack size 6 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-08 finished in 12637 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 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 140 transition count 97
Reduce places removed 35 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 67 rules applied. Total rules applied 98 place count 105 transition count 65
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 130 place count 73 transition count 65
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 130 place count 73 transition count 49
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 162 place count 57 transition count 49
Applied a total of 162 rules in 9 ms. Remains 57 /140 variables (removed 83) and now considering 49/128 (removed 79) transitions.
// Phase 1: matrix 49 rows 57 cols
[2024-05-31 18:55:02] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 18:55:02] [INFO ] Implicit Places using invariants in 77 ms returned [0, 2, 5, 6, 7, 10, 11, 12, 13, 15, 16, 17, 19, 20, 21, 26, 29, 32, 33, 34, 35, 36, 37, 38, 39, 44, 47, 48, 49, 50, 51, 55]
[2024-05-31 18:55:02] [INFO ] Actually due to overlaps returned [0, 7, 15, 21, 20, 33, 37, 55]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 87 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/140 places, 49/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 49/140 places, 49/128 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 7666 reset in 139 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-09 finished in 308 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(p1)&&p0)) U (F(p1)&&G(p2)))&&X(F(p3))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:55:02] [INFO ] Computed 28 invariants in 1 ms
[2024-05-31 18:55:02] [INFO ] Implicit Places using invariants in 84 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 94 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p3), (NOT p1), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-10
Entered a terminal (fully accepting) state of product in 422 steps with 3 reset in 2 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-10 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 96
Reduce places removed 36 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 68 rules applied. Total rules applied 100 place count 104 transition count 64
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 6 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-31 18:55:02] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 18:55:03] [INFO ] Implicit Places using invariants in 78 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2024-05-31 18:55:03] [INFO ] Actually due to overlaps returned [0, 6, 14, 20, 19, 32, 36, 54]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 79 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/140 places, 48/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 48/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 137 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-11 finished in 259 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||F(p1))) U X(G(p0))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:55:03] [INFO ] Computed 28 invariants in 1 ms
[2024-05-31 18:55:03] [INFO ] Implicit Places using invariants in 83 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 84 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 156 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-12
Product exploration explored 100000 steps with 24541 reset in 136 ms.
Product exploration explored 100000 steps with 24377 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 387 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:55:04] [INFO ] Computed 12 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/100 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 52/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/107 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/124 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/124 variables, 17/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 128/252 variables, 124/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/252 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/100 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 52/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/107 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/124 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 17/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/124 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 128/252 variables, 124/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/252 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:55:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
Problem apf2 is UNSAT
After SMT solving in domain Int declared 252/252 variables, and 271 constraints, problems are : Problem set: 1 solved, 0 unsolved in 537 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 633ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 451 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-31 18:55:05] [INFO ] Invariant cache hit.
[2024-05-31 18:55:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-31 18:55:05] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 18:55:05] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 18:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:55:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 18:55:05] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-31 18:55:05] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 18:55:05] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-31 18:55:06] [INFO ] Added : 27 causal constraints over 6 iterations in 87 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 124 transition count 100
Reduce places removed 32 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 64 rules applied. Total rules applied 92 place count 92 transition count 68
Reduce places removed 32 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 36 rules applied. Total rules applied 128 place count 60 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 132 place count 56 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 56 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 40 transition count 48
Applied a total of 164 rules in 7 ms. Remains 40 /124 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-31 18:55:06] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 18:55:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 18:55:06] [INFO ] Invariant cache hit.
[2024-05-31 18:55:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-31 18:55:06] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-31 18:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/39 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 48/88 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 88 constraints, problems are : Problem set: 0 solved, 32 unsolved in 447 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 3/39 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 48/88 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/88 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 120 constraints, problems are : Problem set: 0 solved, 32 unsolved in 530 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 987ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 988ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/124 places, 48/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1096 ms. Remains : 40/124 places, 48/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 161 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-31 18:55:07] [INFO ] Invariant cache hit.
[2024-05-31 18:55:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 18:55:07] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-31 18:55:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 18:55:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:55:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 18:55:07] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-31 18:55:07] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 18:55:07] [INFO ] Computed and/alt/rep : 32/160/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 18:55:07] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 150 ms.
Stack based approach found an accepted trace after 54 steps with 0 reset with depth 55 and stack size 55 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-12 finished in 4632 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 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-31 18:55:07] [INFO ] Computed 28 invariants in 1 ms
[2024-05-31 18:55:07] [INFO ] Implicit Places using invariants in 89 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 90 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-14 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1)))||(!p2 U (p3||G(!p2))))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-31 18:55:08] [INFO ] Invariant cache hit.
[2024-05-31 18:55:08] [INFO ] Implicit Places using invariants in 104 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 114 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p3) p2), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 48484 reset in 122 ms.
Product exploration explored 100000 steps with 48453 reset in 128 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 p1 p0 p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 441 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
RANDOM walk for 278 steps (0 resets) in 5 ms. (46 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (F (NOT p0)), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 582 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:55:10] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 18:55:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 18:55:10] [INFO ] Invariant cache hit.
[2024-05-31 18:55:10] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:55:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:10] [INFO ] Deduced a trap composed of 15 places in 15 ms of which 1 ms to minimize.
[2024-05-31 18:55:10] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:55:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:55:10] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:55:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:11] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:55:11] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 5 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:55:12] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:55:13] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 16/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 284 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4875 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 4/124 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 112/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 396 constraints, problems are : Problem set: 0 solved, 112 unsolved in 14412 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 19306ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19307ms
Finished structural reductions in LTL mode , in 1 iterations and 19569 ms. Remains : 124/124 places, 128/128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p3)]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
RANDOM walk for 506 steps (0 resets) in 11 ms. (42 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p3)]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p3))]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Product exploration explored 100000 steps with 48486 reset in 105 ms.
Product exploration explored 100000 steps with 48477 reset in 123 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 124 transition count 128
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 31 place count 124 transition count 136
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 51 place count 124 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 124 transition count 136
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 63 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2024-05-31 18:55:30] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 136 rows 124 cols
[2024-05-31 18:55:30] [INFO ] Computed 12 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 4 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 1 places in 17 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-31 18:55:31] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 14/141 constraints. Problems are: Problem set: 30 solved, 90 unsolved
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 6/147 constraints. Problems are: Problem set: 32 solved, 88 unsolved
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-31 18:55:32] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/149 constraints. Problems are: Problem set: 32 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/149 constraints. Problems are: Problem set: 32 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 5/154 constraints. Problems are: Problem set: 32 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/158 constraints. Problems are: Problem set: 32 solved, 88 unsolved
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-31 18:55:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 7/165 constraints. Problems are: Problem set: 39 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/165 constraints. Problems are: Problem set: 39 solved, 81 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 10 (OVERLAPS) 136/260 variables, 124/289 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/289 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/289 constraints. Problems are: Problem set: 71 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 289 constraints, problems are : Problem set: 71 solved, 49 unsolved in 4014 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 71 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 29/86 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/86 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 51/108 variables, 7/93 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 51/144 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/144 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 16/124 variables, 5/149 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 16/165 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/165 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 136/260 variables, 124/289 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 49/338 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 0/338 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/260 variables, 0/338 constraints. Problems are: Problem set: 71 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 338 constraints, problems are : Problem set: 71 solved, 49 unsolved in 4903 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 49/120 constraints, Known Traps: 29/29 constraints]
After SMT, in 8964ms problems are : Problem set: 71 solved, 49 unsolved
Search for dead transitions found 71 dead transitions in 8967ms
Found 71 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 71 transitions
Dead transitions reduction (with SMT) removed 71 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 65/128 transitions.
Graph (complete) has 198 edges and 124 vertex of which 61 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 0 output transitions
Reduce places removed 4 places and 0 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 57 transition count 73
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 57 transition count 73
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 17 place count 57 transition count 73
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 17 rules in 11 ms. Remains 57 /124 variables (removed 67) and now considering 73/65 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/124 places, 73/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8996 ms. Remains : 57/124 places, 73/128 transitions.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-31 18:55:39] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 18:55:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 18:55:39] [INFO ] Invariant cache hit.
[2024-05-31 18:55:40] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-31 18:55:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:40] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:55:40] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:55:40] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:55:40] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-31 18:55:40] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:41] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:55:41] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:41] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 4/124 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-31 18:55:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 16/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 284 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4947 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 24/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 4/124 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 128/252 variables, 124/284 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 112/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 396 constraints, problems are : Problem set: 0 solved, 112 unsolved in 14397 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 24/24 constraints]
After SMT, in 19357ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19361ms
Finished structural reductions in LTL mode , in 1 iterations and 19603 ms. Remains : 124/124 places, 128/128 transitions.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-15 finished in 51498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
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((X(X(p1))||p0)))'
Found a Shortening insensitive property : DatabaseWithMutex-PT-04-LTLFireability-05
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 124 transition count 112
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 124 transition count 96
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 108 transition count 96
Applied a total of 64 rules in 10 ms. Remains 108 /140 variables (removed 32) and now considering 96/128 (removed 32) transitions.
// Phase 1: matrix 96 rows 108 cols
[2024-05-31 18:55:59] [INFO ] Computed 28 invariants in 1 ms
[2024-05-31 18:55:59] [INFO ] Implicit Places using invariants in 74 ms returned [5, 10, 11, 17, 23, 29, 30, 36, 40, 49, 64, 76, 78, 87, 98, 106]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 90 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 92/140 places, 96/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 102 ms. Remains : 92/140 places, 96/128 transitions.
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-05
Product exploration explored 100000 steps with 9867 reset in 233 ms.
Product exploration explored 100000 steps with 9850 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 40 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 96 rows 92 cols
[2024-05-31 18:56:00] [INFO ] Computed 12 invariants in 0 ms
[2024-05-31 18:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-31 18:56:01] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-31 18:56:01] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-31 18:56:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:56:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 18:56:01] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-31 18:56:01] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 18:56:01] [INFO ] Computed and/alt/rep : 80/144/80 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 18:56:01] [INFO ] Added : 38 causal constraints over 8 iterations in 86 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 16 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-31 18:56:01] [INFO ] Invariant cache hit.
[2024-05-31 18:56:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 18:56:01] [INFO ] Invariant cache hit.
[2024-05-31 18:56:01] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-31 18:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:01] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:56:01] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:01] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 4/92 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:56:02] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:56:03] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-31 18:56:03] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:56:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:56:03] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 96/188 variables, 92/219 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:03] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 220 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3068 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 96/188 variables, 92/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 80/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 300 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3847 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 24/24 constraints]
After SMT, in 6928ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6929ms
Finished structural reductions in LTL mode , in 1 iterations and 7118 ms. Remains : 92/92 places, 96/96 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 p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 38 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 18:56:09] [INFO ] Invariant cache hit.
[2024-05-31 18:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 18:56:09] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-31 18:56:09] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-31 18:56:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:56:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-31 18:56:09] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-31 18:56:09] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 18:56:09] [INFO ] Computed and/alt/rep : 80/144/80 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-31 18:56:09] [INFO ] Added : 38 causal constraints over 8 iterations in 176 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9854 reset in 228 ms.
Product exploration explored 100000 steps with 9874 reset in 228 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 16 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-31 18:56:10] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 18:56:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:10] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:56:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-31 18:56:10] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:56:10] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:56:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 4/92 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:56:11] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 96/188 variables, 92/219 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 220 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3017 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 96/188 variables, 92/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 80/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 300 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3888 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 24/24 constraints]
After SMT, in 6929ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6930ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6947 ms. Remains : 92/92 places, 96/96 transitions.
Support contains 16 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-31 18:56:17] [INFO ] Invariant cache hit.
[2024-05-31 18:56:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 18:56:17] [INFO ] Invariant cache hit.
[2024-05-31 18:56:17] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-31 18:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:17] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:17] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:17] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:17] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:17] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 4/92 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-31 18:56:18] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-31 18:56:19] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 96/188 variables, 92/219 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 18:56:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/188 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 220 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3028 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 4/92 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 96/188 variables, 92/220 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 80/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 300 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3923 ms.
Refiners :[Domain max(s): 92/92 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 24/24 constraints]
After SMT, in 6963ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6963ms
Finished structural reductions in LTL mode , in 1 iterations and 7170 ms. Remains : 92/92 places, 96/96 transitions.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-05 finished in 24798 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(((p1 U p2)||p0))))'
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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1)))||(!p2 U (p3||G(!p2))))))'
[2024-05-31 18:56:24] [INFO ] Flatten gal took : 11 ms
[2024-05-31 18:56:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-31 18:56:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 128 transitions and 416 arcs took 4 ms.
Total runtime 194495 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : DatabaseWithMutex-PT-04-LTLFireability-02
Could not compute solution for formula : DatabaseWithMutex-PT-04-LTLFireability-05
Could not compute solution for formula : DatabaseWithMutex-PT-04-LTLFireability-06
Could not compute solution for formula : DatabaseWithMutex-PT-04-LTLFireability-07
FORMULA DatabaseWithMutex-PT-04-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717181987369

--------------------
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
mcc2024
ltl formula name DatabaseWithMutex-PT-04-LTLFireability-02
ltl formula formula --ltl=/tmp/3665/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3665/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3665/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3665/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3665/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name DatabaseWithMutex-PT-04-LTLFireability-05
ltl formula formula --ltl=/tmp/3665/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3665/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3665/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3665/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3665/ltl_1_
terminate called after throwing an instance of 'terminate called after throwing an instance of 'std::runtime_error'
std::runtime_error'
what(): too many children for formula
what(): too many children for formula
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name DatabaseWithMutex-PT-04-LTLFireability-06
ltl formula formula --ltl=/tmp/3665/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3665/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3665/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3665/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3665/ltl_2_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name DatabaseWithMutex-PT-04-LTLFireability-07
ltl formula formula --ltl=/tmp/3665/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3665/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3665/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3665/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3665/ltl_3_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name DatabaseWithMutex-PT-04-LTLFireability-15
ltl formula formula --ltl=/tmp/3665/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 140 places, 128 transitions and 416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3665/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3665/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3665/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3665/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 142 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 141, there are 176 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30
pnml2lts-mc( 0/ 4): unique states count: 30
pnml2lts-mc( 0/ 4): unique transitions count: 29
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 40
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45 states 120 transitions, fanout: 2.667
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 53.3 B/state, compr.: 9.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 128 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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