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.r136-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 itstools
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 r136-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 1716330962264

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:36:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:36:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:36:03] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-21 22:36:03] [INFO ] Transformed 140 places.
[2024-05-21 22:36:03] [INFO ] Transformed 128 transitions.
[2024-05-21 22:36:03] [INFO ] Found NUPN structural information;
[2024-05-21 22:36:03] [INFO ] Parsed PT model containing 140 places and 128 transitions and 416 arcs in 161 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-21 22:36:03] [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 17 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-21 22:36:03] [INFO ] Computed 28 invariants in 21 ms
[2024-05-21 22:36:03] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-21 22:36:03] [INFO ] Invariant cache hit.
[2024-05-21 22:36:04] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 22:36:04] [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 3950 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 4056 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 8061ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8085ms
Finished structural reductions in LTL mode , in 1 iterations and 8476 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 109 out of 140 places after structural reductions.
[2024-05-21 22:36:12] [INFO ] Flatten gal took : 31 ms
[2024-05-21 22:36:12] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:36:12] [INFO ] Input system was already deterministic with 128 transitions.
Reduction of identical properties reduced properties to check from 27 to 21
RANDOM walk for 1787 steps (0 resets) in 101 ms. (17 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-21 22:36:12] [INFO ] Invariant cache hit.
[2024-05-21 22:36:13] [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 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 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 104 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 211 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 4 steps with 0 reset in 3 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-00 finished in 372 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 26 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-21 22:36:13] [INFO ] Computed 24 invariants in 3 ms
[2024-05-21 22:36:13] [INFO ] Implicit Places using invariants in 82 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-21 22:36:13] [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 84 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 113 ms. Remains : 64/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 63 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 14647 reset in 369 ms.
Product exploration explored 100000 steps with 14313 reset in 284 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 268 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 17 steps (0 resets) in 8 ms. (1 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 376 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 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 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 5 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2024-05-21 22:36:15] [INFO ] Computed 16 invariants in 5 ms
[2024-05-21 22:36:15] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 22:36:15] [INFO ] Invariant cache hit.
[2024-05-21 22:36:15] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 22:36:15] [INFO ] Redundant transitions in 2 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-21 22:36:15] [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-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 5 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 23 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-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-21 22:36:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:36:15] [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-21 22:36:16] [INFO ] Deduced a trap composed of 7 places in 26 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 1372 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 1063 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 2451ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2452ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2593 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 231 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 14 steps (0 resets) in 4 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 366 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 75 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))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14388 reset in 237 ms.
Product exploration explored 100000 steps with 14534 reset in 236 ms.
Built C files in :
/tmp/ltsmin2555171836899536652
[2024-05-21 22:36:19] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-21 22:36:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:36:19] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-21 22:36:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:36:19] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-21 22:36:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:36:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2555171836899536652
Running compilation step : cd /tmp/ltsmin2555171836899536652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 330 ms.
Running link step : cd /tmp/ltsmin2555171836899536652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2555171836899536652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12201352652874208970.hoa' '--buchi-type=spotba'
LTSmin run took 1871 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-02 finished in 8112 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 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-21 22:36:21] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 22:36:21] [INFO ] Implicit Places using invariants in 100 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 103 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 109 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 202 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 250 ms.
Product exploration explored 100000 steps with 33333 reset in 265 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 20 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 862 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-21 22:36:22] [INFO ] Invariant cache hit.
[2024-05-21 22:36:22] [INFO ] Implicit Places using invariants in 161 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 163 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 9 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 178 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 88 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 6135 reset in 231 ms.
Product exploration explored 100000 steps with 6113 reset in 277 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 127 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))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 55 steps (0 resets) in 4 ms. (11 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 172 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 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 102 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-21 22:36:23] [INFO ] Computed 12 invariants in 2 ms
[2024-05-21 22:36:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 22:36:23] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-21 22:36:24] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-21 22:36:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:36:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 22:36:24] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 22:36:24] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-21 22:36:24] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-21 22:36:24] [INFO ] Added : 81 causal constraints over 17 iterations in 502 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-21 22:36:24] [INFO ] Invariant cache hit.
[2024-05-21 22:36:25] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 22:36:25] [INFO ] Invariant cache hit.
[2024-05-21 22:36:25] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 22:36:25] [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-21 22:36:25] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:36:25] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 22:36:25] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:36:25] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:36:25] [INFO ] Deduced a trap composed of 15 places in 21 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-21 22:36:26] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-21 22:36:26] [INFO ] Deduced a trap composed of 15 places in 144 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-21 22:36:27] [INFO ] Deduced a trap composed of 15 places in 181 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-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:36:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 3 ms to minimize.
[2024-05-21 22:36:29] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 6 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 5988 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 14180 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 20190ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 20191ms
Finished structural reductions in LTL mode , in 1 iterations and 20675 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 90 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 129 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 59 steps (0 resets) in 4 ms. (11 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 157 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 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 22:36:46] [INFO ] Invariant cache hit.
[2024-05-21 22:36:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 22:36:46] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 22:36:46] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-21 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:36:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 22:36:46] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 22:36:46] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-21 22:36:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 11 ms to minimize.
[2024-05-21 22:36:46] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:36:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:36:46] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:36:46] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:36:46] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:36:47] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:36:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 384 ms
[2024-05-21 22:36:47] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 22:36:47] [INFO ] Added : 108 causal constraints over 22 iterations in 474 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6124 reset in 258 ms.
Product exploration explored 100000 steps with 6139 reset in 224 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 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 15 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 22:36:48] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-21 22:36:48] [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-21 22:36:48] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 22:36:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:36:48] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-21 22:36:48] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:36:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:36:48] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:36:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:36:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 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-21 22:36:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:36:49] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:36:49] [INFO ] Deduced a trap composed of 9 places in 24 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-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 4 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-21 22:36:50] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 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 4184 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 7845 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 12049ms problems are : Problem set: 32 solved, 80 unsolved
Search for dead transitions found 32 dead transitions in 12051ms
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.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 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 12087 ms. Remains : 92/124 places, 96/128 transitions.
Built C files in :
/tmp/ltsmin2837976609793436073
[2024-05-21 22:37:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2837976609793436073
Running compilation step : cd /tmp/ltsmin2837976609793436073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin2837976609793436073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2837976609793436073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11363483083057464160.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-21 22:37:15] [INFO ] Computed 12 invariants in 4 ms
[2024-05-21 22:37:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 22:37:15] [INFO ] Invariant cache hit.
[2024-05-21 22:37:15] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 22:37:15] [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-21 22:37:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:37:16] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:37:16] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:37:16] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 22:37:16] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 22:37:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:37:16] [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-21 22:37:17] [INFO ] Deduced a trap composed of 15 places in 30 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-21 22:37:17] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:37:17] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:37:18] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 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 4944 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 14237 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 19203ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19205ms
Finished structural reductions in LTL mode , in 1 iterations and 19482 ms. Remains : 124/124 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin11998386621927324068
[2024-05-21 22:37:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11998386621927324068
Running compilation step : cd /tmp/ltsmin11998386621927324068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin11998386621927324068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11998386621927324068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10962991365624663967.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:37:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:37:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 22:37:50] [INFO ] Time to serialize gal into /tmp/LTL12153761876142615919.gal : 2 ms
[2024-05-21 22:37:50] [INFO ] Time to serialize properties into /tmp/LTL2332113281250725115.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12153761876142615919.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15867161263479769010.hoa' '-atoms' '/tmp/LTL2332113281250725115.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2332113281250725115.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15867161263479769010.hoa
Detected timeout of ITS tools.
[2024-05-21 22:38:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:38:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 22:38:05] [INFO ] Time to serialize gal into /tmp/LTL6642880839458668019.gal : 2 ms
[2024-05-21 22:38:05] [INFO ] Time to serialize properties into /tmp/LTL8676704294275178541.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6642880839458668019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8676704294275178541.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(("(((((MesBuffReply_3_4==1)||(MesBuffReply_4_4==1))||((MesBuffReply_1_3==1)||(MesBuffReply_2_1==1)))||(((MesBuffReply_2_2==1)||(M...837
Formula 0 simplified : G(!"(((((MesBuffReply_3_4==1)||(MesBuffReply_4_4==1))||((MesBuffReply_1_3==1)||(MesBuffReply_2_1==1)))||(((MesBuffReply_2_2==1)||(Me...829
Detected timeout of ITS tools.
[2024-05-21 22:38:20] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:38:20] [INFO ] Applying decomposition
[2024-05-21 22:38:20] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17410189485223482782.txt' '-o' '/tmp/graph17410189485223482782.bin' '-w' '/tmp/graph17410189485223482782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17410189485223482782.bin' '-l' '-1' '-v' '-w' '/tmp/graph17410189485223482782.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:38:20] [INFO ] Decomposing Gal with order
[2024-05-21 22:38:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:38:20] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-21 22:38:20] [INFO ] Flatten gal took : 40 ms
[2024-05-21 22:38:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 22:38:20] [INFO ] Time to serialize gal into /tmp/LTL1403817186956816908.gal : 3 ms
[2024-05-21 22:38:20] [INFO ] Time to serialize properties into /tmp/LTL15010823525640386832.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1403817186956816908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15010823525640386832.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(((((i2.u33.MesBuffReply_3_4==1)||(i5.u41.MesBuffReply_4_4==1))||((i0.u30.MesBuffReply_1_3==1)||(i7.u28.MesBuffReply_2_1==1)))|...1055
Formula 0 simplified : G(!"(((((i2.u33.MesBuffReply_3_4==1)||(i5.u41.MesBuffReply_4_4==1))||((i0.u30.MesBuffReply_1_3==1)||(i7.u28.MesBuffReply_2_1==1)))||...1047
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
880 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.82904,229872,1,0,509753,442,1421,579636,167,2999,691695
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-05 finished in 128495 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 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 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-21 22:38:30] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 22:38:30] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 22:38:30] [INFO ] Invariant cache hit.
[2024-05-21 22:38:30] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 22:38:30] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 22:38:30] [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 1460 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 1692 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 3165ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3166ms
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 3306 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 86 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 9918 reset in 230 ms.
Product exploration explored 100000 steps with 9934 reset in 230 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 259 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 97 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 6 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 329 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 80 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-05-21 22:38:35] [INFO ] Invariant cache hit.
[2024-05-21 22:38:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 22:38:35] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 10 ms returned sat
[2024-05-21 22:38:35] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-21 22:38:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:38:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 22:38:35] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 20 ms returned sat
[2024-05-21 22:38:35] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-21 22:38:35] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 22:38:35] [INFO ] Added : 30 causal constraints over 6 iterations in 53 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-21 22:38:35] [INFO ] Invariant cache hit.
[2024-05-21 22:38:35] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 22:38:35] [INFO ] Invariant cache hit.
[2024-05-21 22:38:36] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-21 22:38:36] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 22:38:36] [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 1455 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 1661 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 3134ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3250 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 272 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 68 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 5 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 354 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 67 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-05-21 22:38:40] [INFO ] Invariant cache hit.
[2024-05-21 22:38:40] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 22:38:40] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 11 ms returned sat
[2024-05-21 22:38:40] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 22:38:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:38:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 22:38:40] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 19 ms returned sat
[2024-05-21 22:38:40] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-21 22:38:40] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-21 22:38:40] [INFO ] Added : 30 causal constraints over 6 iterations in 70 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p0))
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 9829 reset in 225 ms.
Product exploration explored 100000 steps with 9741 reset in 244 ms.
Built C files in :
/tmp/ltsmin2738827516459239309
[2024-05-21 22:38:41] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-21 22:38:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:38:41] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-21 22:38:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:38:41] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-21 22:38:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:38:41] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2738827516459239309
Running compilation step : cd /tmp/ltsmin2738827516459239309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin2738827516459239309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2738827516459239309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13320503678544729425.hoa' '--buchi-type=spotba'
LTSmin run took 5081 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-06 finished in 15588 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 1 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 11 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
[2024-05-21 22:38:46] [INFO ] Invariant cache hit.
[2024-05-21 22:38:46] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 22:38:46] [INFO ] Invariant cache hit.
[2024-05-21 22:38:46] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-21 22:38:46] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 22:38: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 1414 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 1664 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 3093ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3093ms
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 3226 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 7242 reset in 183 ms.
Product exploration explored 100000 steps with 7233 reset in 191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 43 ms :[(NOT p0)]
RANDOM walk for 62 steps (0 resets) in 4 ms. (12 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 106 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 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-21 22:38:50] [INFO ] Invariant cache hit.
[2024-05-21 22:38:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 22:38:50] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 13 ms returned sat
[2024-05-21 22:38:50] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-21 22:38:50] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 22:38:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:38:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 22:38:50] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 11 ms returned sat
[2024-05-21 22:38:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-21 22:38:50] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 22:38:50] [INFO ] Added : 15 causal constraints over 4 iterations in 62 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 3 ms. Remains 88 /88 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-21 22:38:50] [INFO ] Invariant cache hit.
[2024-05-21 22:38:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 22:38:50] [INFO ] Invariant cache hit.
[2024-05-21 22:38:50] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-21 22:38:50] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-21 22:38:50] [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 1646 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 3150ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3268 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 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 34 ms :[(NOT p0)]
RANDOM walk for 52 steps (0 resets) in 5 ms. (8 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 118 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-21 22:38:54] [INFO ] Invariant cache hit.
[2024-05-21 22:38:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 22:38:54] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 10 ms returned sat
[2024-05-21 22:38:54] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-21 22:38:54] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 22:38:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:38:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 22:38:54] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 9 ms returned sat
[2024-05-21 22:38:54] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 22:38:54] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-21 22:38:55] [INFO ] Added : 15 causal constraints over 4 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7220 reset in 200 ms.
Product exploration explored 100000 steps with 7218 reset in 196 ms.
Built C files in :
/tmp/ltsmin7086898671595829825
[2024-05-21 22:38:55] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-21 22:38:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:38:55] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-21 22:38:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:38:55] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-21 22:38:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:38:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7086898671595829825
Running compilation step : cd /tmp/ltsmin7086898671595829825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin7086898671595829825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7086898671595829825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9785768463964191130.hoa' '--buchi-type=spotba'
LTSmin run took 3740 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-07 finished in 13146 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-21 22:38:59] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 22:38:59] [INFO ] Implicit Places using invariants in 85 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 86 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 90 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 296 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 9584 reset in 196 ms.
Product exploration explored 100000 steps with 9574 reset in 171 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 1576 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 237 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 8235 steps (1 resets) in 244 ms. (33 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 2161 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 239 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 263 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-21 22:39:04] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 22:39:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 22:39:04] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 22:39:05] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-21 22:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:39:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 22:39:05] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 22:39:05] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 22:39:05] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-21 22:39:05] [INFO ] Added : 27 causal constraints over 6 iterations in 88 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 8 ms. Remains 40 /124 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-21 22:39:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 22:39:05] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 22:39:05] [INFO ] Invariant cache hit.
[2024-05-21 22:39:05] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-21 22:39:05] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 22:39:05] [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 435 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 534 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 978ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 979ms
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 1089 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 2415 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 248 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 601 steps (0 resets) in 14 ms. (40 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 2860 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 222 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 223 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-21 22:39:12] [INFO ] Invariant cache hit.
[2024-05-21 22:39:12] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 22:39:12] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 22:39:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 22:39:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:39:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 22:39:12] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-21 22:39:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 22:39:12] [INFO ] Computed and/alt/rep : 32/160/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 22:39:12] [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 252 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 12376 reset in 218 ms.
Stack based approach found an accepted trace after 109 steps with 15 reset with depth 10 and stack size 10 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-08 finished in 13608 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 11 ms. Remains 57 /140 variables (removed 83) and now considering 49/128 (removed 79) transitions.
// Phase 1: matrix 49 rows 57 cols
[2024-05-21 22:39:13] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 22:39:13] [INFO ] Implicit Places using invariants in 81 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-21 22:39:13] [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 2 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 100 ms. Remains : 49/140 places, 49/128 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 7597 reset in 140 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-09 finished in 340 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-21 22:39:13] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 22:39:13] [INFO ] Implicit Places using invariants in 92 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 93 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 96 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 274 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 4 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-10 finished in 401 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 14 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-21 22:39:13] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 22:39:13] [INFO ] Implicit Places using invariants in 83 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-21 22:39:13] [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 84 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 101 ms. Remains : 48/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 142 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-11 finished in 303 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-21 22:39:14] [INFO ] Computed 28 invariants in 1 ms
[2024-05-21 22:39:14] [INFO ] Implicit Places using invariants in 102 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 108 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 110 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 384 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 24441 reset in 136 ms.
Product exploration explored 100000 steps with 24434 reset in 154 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 461 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 209 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
// Phase 1: matrix 128 rows 124 cols
[2024-05-21 22:39:15] [INFO ] Computed 12 invariants in 2 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 101 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-21 22:39:15] [INFO ] Deduced a trap composed of 15 places in 20 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-21 22:39:15] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 23 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-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 22:39:16] [INFO ] Deduced a trap composed of 15 places in 26 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 594 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 703ms 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 505 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2024-05-21 22:39:17] [INFO ] Invariant cache hit.
[2024-05-21 22:39:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 22:39:17] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-21 22:39:17] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-21 22:39:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:39:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 22:39:17] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 22:39:17] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-21 22:39:17] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-21 22:39:17] [INFO ] Added : 27 causal constraints over 6 iterations in 91 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 1 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 11 ms. Remains 40 /124 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-21 22:39:17] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 22:39:17] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 22:39:17] [INFO ] Invariant cache hit.
[2024-05-21 22:39:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-21 22:39:17] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-21 22:39:17] [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 430 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 541 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 982ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 984ms
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 1108 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 182 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 39 ms :[(NOT p0)]
RANDOM walk for 156 steps (0 resets) in 8 ms. (17 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 176 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 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-05-21 22:39:19] [INFO ] Invariant cache hit.
[2024-05-21 22:39:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 22:39:19] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 10 ms returned sat
[2024-05-21 22:39:19] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 22:39:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:39:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 22:39:19] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-21 22:39:19] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 22:39:19] [INFO ] Computed and/alt/rep : 32/160/32 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 22:39:19] [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 91 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-12 finished in 5411 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-21 22:39:19] [INFO ] Computed 28 invariants in 2 ms
[2024-05-21 22:39:19] [INFO ] Implicit Places using invariants in 103 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 104 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 106 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 97 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 3 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 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-21 22:39:19] [INFO ] Invariant cache hit.
[2024-05-21 22:39:19] [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 326 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 48495 reset in 122 ms.
Product exploration explored 100000 steps with 48484 reset in 127 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 526 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 263 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
RANDOM walk for 409 steps (0 resets) in 7 ms. (51 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 573 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 128 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Stuttering acceptance computed with spot in 137 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 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-21 22:39:22] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 22:39:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 22:39:22] [INFO ] Invariant cache hit.
[2024-05-21 22:39:22] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 22:39:22] [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-21 22:39:22] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:39:22] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-21 22:39:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:39:22] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-21 22:39:23] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 22:39:23] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:39:23] [INFO ] Deduced a trap composed of 15 places in 28 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-21 22:39:23] [INFO ] Deduced a trap composed of 15 places in 28 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-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-21 22:39:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 22:39:25] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-21 22:39:25] [INFO ] Deduced a trap composed of 15 places in 29 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 4912 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 14161 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 19098ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 19099ms
Finished structural reductions in LTL mode , in 1 iterations and 19377 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 212 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 145 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
RANDOM walk for 1974 steps (0 resets) in 12 ms. (151 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 268 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 125 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true]
Product exploration explored 100000 steps with 48464 reset in 120 ms.
Product exploration explored 100000 steps with 48456 reset in 119 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 143 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 1 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 25 ms. Remains 124 /124 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2024-05-21 22:39:43] [INFO ] Redundant transitions in 4 ms returned []
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 136 rows 124 cols
[2024-05-21 22:39:43] [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-21 22:39:43] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 1 places in 26 ms of which 0 ms to minimize.
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-21 22:39:43] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 1 places in 21 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 1 places in 28 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 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-21 22:39:44] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 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-21 22:39:44] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-21 22:39:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 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-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-21 22:39:45] [INFO ] Deduced a trap composed of 5 places in 29 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 3911 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 4593 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 8534ms problems are : Problem set: 71 solved, 49 unsolved
Search for dead transitions found 71 dead transitions in 8536ms
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.0 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 0 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 4 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 8582 ms. Remains : 57/124 places, 73/128 transitions.
Built C files in :
/tmp/ltsmin7652303875343113783
[2024-05-21 22:39:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7652303875343113783
Running compilation step : cd /tmp/ltsmin7652303875343113783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin7652303875343113783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7652303875343113783;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18182481598262277231.hoa' '--buchi-type=spotba'
LTSmin run took 381 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-15 finished in 32566 ms.
All properties solved by simple procedures.
Total runtime 228989 ms.

BK_STOP 1716331192418

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
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 r136-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 ;