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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 SafeBus-COL-06-LTLFireability-00
FORMULA_NAME SafeBus-COL-06-LTLFireability-01
FORMULA_NAME SafeBus-COL-06-LTLFireability-02
FORMULA_NAME SafeBus-COL-06-LTLFireability-03
FORMULA_NAME SafeBus-COL-06-LTLFireability-04
FORMULA_NAME SafeBus-COL-06-LTLFireability-05
FORMULA_NAME SafeBus-COL-06-LTLFireability-06
FORMULA_NAME SafeBus-COL-06-LTLFireability-07
FORMULA_NAME SafeBus-COL-06-LTLFireability-08
FORMULA_NAME SafeBus-COL-06-LTLFireability-09
FORMULA_NAME SafeBus-COL-06-LTLFireability-10
FORMULA_NAME SafeBus-COL-06-LTLFireability-11
FORMULA_NAME SafeBus-COL-06-LTLFireability-12
FORMULA_NAME SafeBus-COL-06-LTLFireability-13
FORMULA_NAME SafeBus-COL-06-LTLFireability-14
FORMULA_NAME SafeBus-COL-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716839933103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 19:58:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 19:58:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 19:58:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 19:58:54] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 19:58:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 574 ms
[2024-05-27 19:58:55] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 19:58:55] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 19:58:55] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 19:58:55] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA SafeBus-COL-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 1117 steps (0 resets) in 104 ms. (10 steps per ms) remains 0/14 properties
[2024-05-27 19:58:55] [INFO ] Flatten gal took : 23 ms
[2024-05-27 19:58:55] [INFO ] Flatten gal took : 17 ms
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2024-05-27 19:58:55] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 109 ms.
[2024-05-27 19:58:55] [INFO ] Unfolded 12 HLPN properties in 5 ms.
[2024-05-27 19:58:55] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-27 19:58:55] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-27 19:58:55] [INFO ] Reduced 24 identical enabling conditions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Support contains 138 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 19:58:55] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 19:58:55] [INFO ] Computed 29 invariants in 25 ms
[2024-05-27 19:58:55] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-27 19:58:55] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 19:58:55] [INFO ] Invariant cache hit.
[2024-05-27 19:58:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 19:58:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-27 19:58:56] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 19:58:56] [INFO ] Invariant cache hit.
[2024-05-27 19:58:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 18 ms to minimize.
[2024-05-27 19:58:58] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-27 19:58:59] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 3 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 5 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 14 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-27 19:59:00] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-27 19:59:01] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/49 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:02] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-27 19:59:02] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-27 19:59:03] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/58 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:05] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:06] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 3 ms to minimize.
[2024-05-27 19:59:07] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:09] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/62 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:10] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 14 ms to minimize.
[2024-05-27 19:59:10] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 5 ms to minimize.
[2024-05-27 19:59:10] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-27 19:59:10] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-27 19:59:10] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-27 19:59:10] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 6/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:13] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 20 ms to minimize.
[2024-05-27 19:59:13] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-27 19:59:13] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 3/71 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:15] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/380 variables, and 253 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 43/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/662 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 19:59:34] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-27 19:59:35] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-27 19:59:39] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-27 19:59:40] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-27 19:59:40] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 5/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 667 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/445 constraints, Known Traps: 48/48 constraints]
After SMT, in 60768ms problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60787ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 415/451 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61138 ms. Remains : 138/138 places, 415/451 transitions.
Support contains 138 out of 138 places after structural reductions.
[2024-05-27 19:59:57] [INFO ] Flatten gal took : 105 ms
[2024-05-27 19:59:57] [INFO ] Flatten gal took : 118 ms
[2024-05-27 19:59:57] [INFO ] Input system was already deterministic with 415 transitions.
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 1167 steps (0 resets) in 36 ms. (31 steps per ms) remains 0/15 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(p0)&&F((G(F(p1))||(G(p0)&&F(p1)))))))))'
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 19:59:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:57] [INFO ] Invariant cache hit.
[2024-05-27 19:59:58] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-27 19:59:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:58] [INFO ] Invariant cache hit.
[2024-05-27 19:59:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 19:59:58] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 19:59:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 19:59:58] [INFO ] Invariant cache hit.
[2024-05-27 19:59:58] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:00] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:00:00] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:00:01] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:00:02] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:03] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:00:03] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2024-05-27 20:00:03] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:00:03] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:00:04] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:07] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25957 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:31] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56447ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56451ms
Finished structural reductions in LTL mode , in 1 iterations and 56910 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 367 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-00
Product exploration explored 100000 steps with 7223 reset in 626 ms.
Product exploration explored 100000 steps with 7066 reset in 473 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), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 181 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 117 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 271 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 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 37 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:00:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 20:00:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:00:57] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-27 20:00:57] [INFO ] Redundant transitions in 24 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:00:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:00:57] [INFO ] Invariant cache hit.
[2024-05-27 20:00:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:00:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:01:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:01:01] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:01:02] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:01:03] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:01:03] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:01:03] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:01:03] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-27 20:01:03] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:01:03] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:06] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25543 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:30] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55946ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55950ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56347 ms. Remains : 138/138 places, 415/415 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 219 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 147 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 382 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 70 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4134 reset in 1042 ms.
Product exploration explored 100000 steps with 4014 reset in 1038 ms.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:01:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:56] [INFO ] Invariant cache hit.
[2024-05-27 20:01:56] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-27 20:01:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:56] [INFO ] Invariant cache hit.
[2024-05-27 20:01:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:01:56] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-27 20:01:56] [INFO ] Redundant transitions in 6 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:01:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:01:56] [INFO ] Invariant cache hit.
[2024-05-27 20:01:56] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:01:58] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-27 20:01:58] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:01:59] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:02:00] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:02:01] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:01] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:02:01] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:02:01] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-27 20:02:01] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:02:02] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:02:03] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:02:03] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:02:03] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:02:03] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:02:03] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:05] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25528 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:02:29] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55956ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55960ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56385 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-00 finished in 175163 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((p0||X(X(p0))))))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:02:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:53] [INFO ] Invariant cache hit.
[2024-05-27 20:02:53] [INFO ] Implicit Places using invariants in 366 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 370 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 144 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLFireability-01 finished in 800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0)||(X(p1)&&p2)))) U p3))'
Support contains 89 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:02:53] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:53] [INFO ] Invariant cache hit.
[2024-05-27 20:02:53] [INFO ] Implicit Places using invariants in 125 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 135 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-02
Product exploration explored 100000 steps with 8618 reset in 298 ms.
Product exploration explored 100000 steps with 8633 reset in 306 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 p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 247 steps (0 resets) in 8 ms. (27 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p3), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 4 factoid took 459 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
[2024-05-27 20:02:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 20:02:56] [INFO ] Computed 23 invariants in 3 ms
[2024-05-27 20:02:56] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-27 20:02:56] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 11 ms returned unsat
Proved EG (NOT p3)
[2024-05-27 20:02:56] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:56] [INFO ] Invariant cache hit.
[2024-05-27 20:02:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-27 20:02:56] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-27 20:02:56] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-27 20:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:02:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-27 20:02:56] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 9 ms returned sat
[2024-05-27 20:02:56] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-27 20:02:56] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:02:57] [INFO ] [Nat]Added 43 Read/Feed constraints in 21 ms returned sat
[2024-05-27 20:02:57] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-27 20:02:57] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-27 20:02:57] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 24 places in 810 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:02:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1115 ms
[2024-05-27 20:02:58] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 24 ms.
[2024-05-27 20:02:58] [INFO ] Added : 25 causal constraints over 5 iterations in 151 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2024-05-27 20:02:58] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:02:58] [INFO ] Invariant cache hit.
[2024-05-27 20:02:58] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-27 20:02:58] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 22 ms returned sat
[2024-05-27 20:02:59] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-27 20:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:02:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-27 20:02:59] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 32 ms returned sat
[2024-05-27 20:02:59] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-27 20:02:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:02:59] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-27 20:02:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-05-27 20:03:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1071 ms
[2024-05-27 20:03:00] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 30 ms.
[2024-05-27 20:03:01] [INFO ] Added : 39 causal constraints over 8 iterations in 218 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p3)), (X (X (NOT p3))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p3), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 4 factoid took 440 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-06-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLFireability-02 finished in 7811 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 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:03:01] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:03:01] [INFO ] Computed 29 invariants in 4 ms
[2024-05-27 20:03:01] [INFO ] Implicit Places using invariants in 272 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 273 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 57 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-05-27 20:03:01] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-27 20:03:02] [INFO ] Computed 23 invariants in 9 ms
[2024-05-27 20:03:02] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-27 20:03:02] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:03:02] [INFO ] Invariant cache hit.
[2024-05-27 20:03:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:02] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1183 ms. Remains : 120/138 places, 523/415 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 303 ms.
Stack based approach found an accepted trace after 249 steps with 0 reset with depth 250 and stack size 250 in 1 ms.
FORMULA SafeBus-COL-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-03 finished in 1546 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 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:03:03] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:03:03] [INFO ] Computed 29 invariants in 3 ms
[2024-05-27 20:03:03] [INFO ] Implicit Places using invariants in 221 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 233 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 24 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-04
Product exploration explored 100000 steps with 3923 reset in 223 ms.
Product exploration explored 100000 steps with 3949 reset in 216 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 78 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 22 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:03:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 20:03:04] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 20:03:04] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-27 20:03:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:03:04] [INFO ] Invariant cache hit.
[2024-05-27 20:03:04] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:03:04] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-05-27 20:03:04] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:03:04] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:03:05] [INFO ] Invariant cache hit.
[2024-05-27 20:03:05] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:06] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:03:06] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:03:07] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-27 20:03:08] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:03:09] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:03:09] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2024-05-27 20:03:09] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:03:09] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:03:09] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:10] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:03:10] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:03:10] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2024-05-27 20:03:11] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 20:03:12] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:13] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:03:14] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-27 20:03:14] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:03:14] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-05-27 20:03:14] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:03:14] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:15] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:03:16] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:17] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/374 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 43/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:03:27] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 243 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/374 variables, 132/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 43/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 409/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 652 constraints, problems are : Problem set: 0 solved, 409 unsolved in 29525 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
After SMT, in 59906ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 59910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60566 ms. Remains : 132/132 places, 415/415 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3886 reset in 203 ms.
Product exploration explored 100000 steps with 3922 reset in 214 ms.
Support contains 12 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:04:05] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:04:05] [INFO ] Invariant cache hit.
[2024-05-27 20:04:05] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-27 20:04:05] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:04:05] [INFO ] Invariant cache hit.
[2024-05-27 20:04:06] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:04:06] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-27 20:04:06] [INFO ] Redundant transitions in 1 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:04:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:04:06] [INFO ] Invariant cache hit.
[2024-05-27 20:04:06] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:07] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:04:08] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:04:08] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:04:08] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:04:09] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:04:10] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:11] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:04:12] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 0 ms to minimize.
[2024-05-27 20:04:13] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:04:13] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:04:13] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:04:13] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-27 20:04:13] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:15] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-27 20:04:15] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:04:15] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:04:15] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:04:15] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:04:15] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:16] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:04:17] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:18] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 242/374 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 43/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:04:29] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/374 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 243 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 45/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/374 variables, 132/200 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 43/243 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 409/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 652 constraints, problems are : Problem set: 0 solved, 409 unsolved in 29720 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 132/132 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 45/45 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60658 ms. Remains : 132/132 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-04 finished in 123309 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(p0)))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:05:06] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:05:06] [INFO ] Computed 29 invariants in 2 ms
[2024-05-27 20:05:06] [INFO ] Implicit Places using invariants in 200 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 218 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 223 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-05
Product exploration explored 100000 steps with 14097 reset in 182 ms.
Product exploration explored 100000 steps with 13965 reset in 196 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 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 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:05:07] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 132 cols
[2024-05-27 20:05:07] [INFO ] Computed 23 invariants in 6 ms
[2024-05-27 20:05:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-27 20:05:07] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 10 ms returned sat
[2024-05-27 20:05:08] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-27 20:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:05:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:05:08] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 18 ms returned sat
[2024-05-27 20:05:08] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:05:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:05:08] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2024-05-27 20:05:08] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:05:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-27 20:05:08] [INFO ] Computed and/alt/rep : 66/348/66 causal constraints (skipped 170 transitions) in 27 ms.
[2024-05-27 20:05:08] [INFO ] Added : 50 causal constraints over 10 iterations in 299 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 26 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-05-27 20:05:08] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-27 20:05:08] [INFO ] Computed 23 invariants in 1 ms
[2024-05-27 20:05:08] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-27 20:05:08] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:05:08] [INFO ] Invariant cache hit.
[2024-05-27 20:05:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:05:09] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2024-05-27 20:05:09] [INFO ] Redundant transitions in 1 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-27 20:05:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:05:09] [INFO ] Invariant cache hit.
[2024-05-27 20:05:09] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:05:10] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:05:11] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-27 20:05:12] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:05:12] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:05:12] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:05:12] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:05:12] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:05:13] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:05:13] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
[2024-05-27 20:05:13] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:05:13] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:14] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:05:14] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2024-05-27 20:05:14] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:05:14] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:05:15] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:05:15] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:05:15] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:17] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:05:17] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:05:17] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:18] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:05:18] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:05:18] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:20] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:22] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:23] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:05:23] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:05:24] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 27491 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:39] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2024-05-27 20:05:41] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 57893ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 57897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58679 ms. Remains : 126/132 places, 409/415 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 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 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 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:06:07] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:06:07] [INFO ] Invariant cache hit.
[2024-05-27 20:06:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-27 20:06:07] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-27 20:06:08] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-27 20:06:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:06:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:06:08] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 18 ms returned sat
[2024-05-27 20:06:08] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-27 20:06:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:06:08] [INFO ] [Nat]Added 43 Read/Feed constraints in 17 ms returned sat
[2024-05-27 20:06:08] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-27 20:06:08] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-27 20:06:08] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-27 20:06:08] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:06:08] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:06:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 270 ms
[2024-05-27 20:06:08] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 27 ms.
[2024-05-27 20:06:08] [INFO ] Added : 28 causal constraints over 6 iterations in 140 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14135 reset in 220 ms.
Product exploration explored 100000 steps with 14108 reset in 197 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-05-27 20:06:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:06:09] [INFO ] Invariant cache hit.
[2024-05-27 20:06:09] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-27 20:06:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:06:09] [INFO ] Invariant cache hit.
[2024-05-27 20:06:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:06:09] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-27 20:06:09] [INFO ] Redundant transitions in 3 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-27 20:06:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:06:09] [INFO ] Invariant cache hit.
[2024-05-27 20:06:09] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:11] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-27 20:06:11] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:06:11] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:06:12] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:06:13] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:06:13] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:06:13] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:06:13] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:06:13] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:06:13] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:14] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:06:14] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:06:15] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2024-05-27 20:06:15] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:06:15] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:06:15] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-27 20:06:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:17] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:06:17] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:06:17] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:18] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:06:18] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:06:18] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:20] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:22] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:24] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:06:24] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:06:24] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 27920 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:40] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:06:42] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:06:42] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 58323ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 58327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58798 ms. Remains : 126/126 places, 409/409 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-05 finished in 121596 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(G((F(p2)&&p1))))&&p0)))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:07:08] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:07:08] [INFO ] Computed 29 invariants in 4 ms
[2024-05-27 20:07:08] [INFO ] Implicit Places using invariants in 152 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 154 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-07
Product exploration explored 100000 steps with 3942 reset in 363 ms.
Stack based approach found an accepted trace after 27498 steps with 1072 reset with depth 48 and stack size 48 in 100 ms.
FORMULA SafeBus-COL-06-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-07 finished in 876 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) U p1)))'
Support contains 31 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 21 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:07:08] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:07:08] [INFO ] Invariant cache hit.
[2024-05-27 20:07:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-27 20:07:09] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:07:09] [INFO ] Invariant cache hit.
[2024-05-27 20:07:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:07:09] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-27 20:07:09] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:07:09] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:07:09] [INFO ] Invariant cache hit.
[2024-05-27 20:07:09] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:07:10] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:07:11] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:07:11] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:07:11] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:07:12] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:07:13] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:07:13] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:07:13] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:07:13] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:07:13] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:07:14] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:07:14] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2024-05-27 20:07:14] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:07:15] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:07:15] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:07:15] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:07:15] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:07:15] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:07:15] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:07:18] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25997 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:07:43] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56358ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56853 ms. Remains : 138/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-08
Product exploration explored 100000 steps with 10502 reset in 315 ms.
Product exploration explored 100000 steps with 10461 reset in 318 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p0), (NOT p1)]
RANDOM walk for 599 steps (0 resets) in 11 ms. (49 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (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 7 factoid took 193 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p0), (NOT p1)]
[2024-05-27 20:08:07] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:08:07] [INFO ] Invariant cache hit.
[2024-05-27 20:08:07] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 20:08:07] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (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), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-06-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-06-LTLFireability-08 finished in 58772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:08:07] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:08:07] [INFO ] Invariant cache hit.
[2024-05-27 20:08:07] [INFO ] Implicit Places using invariants in 143 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 144 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-06-LTLFireability-10 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:08:07] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:08:07] [INFO ] Invariant cache hit.
[2024-05-27 20:08:08] [INFO ] Implicit Places using invariants in 155 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 156 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 12 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-05-27 20:08:08] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-27 20:08:08] [INFO ] Computed 23 invariants in 3 ms
[2024-05-27 20:08:08] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-27 20:08:08] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:08:08] [INFO ] Invariant cache hit.
[2024-05-27 20:08:08] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:08:08] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 637 ms. Remains : 126/138 places, 409/415 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 252 ms.
Stack based approach found an accepted trace after 122 steps with 0 reset with depth 123 and stack size 123 in 1 ms.
FORMULA SafeBus-COL-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-11 finished in 949 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 32 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:08:08] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:08:08] [INFO ] Computed 29 invariants in 3 ms
[2024-05-27 20:08:09] [INFO ] Implicit Places using invariants in 131 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 132 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 11 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-05-27 20:08:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-27 20:08:09] [INFO ] Computed 23 invariants in 1 ms
[2024-05-27 20:08:09] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 20:08:09] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:08:09] [INFO ] Invariant cache hit.
[2024-05-27 20:08:09] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:08:09] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 532 ms. Remains : 126/138 places, 409/415 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 417 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 0 ms.
FORMULA SafeBus-COL-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-06-LTLFireability-12 finished in 1014 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))||F(p1)))'
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:08:09] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:08:09] [INFO ] Computed 29 invariants in 4 ms
[2024-05-27 20:08:10] [INFO ] Implicit Places using invariants in 143 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 144 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 132/138 places, 415/415 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SafeBus-COL-06-LTLFireability-14
Product exploration explored 100000 steps with 4349 reset in 309 ms.
Product exploration explored 100000 steps with 4342 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 224 steps (0 resets) in 11 ms. (18 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 19 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 23 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-05-27 20:08:11] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-27 20:08:11] [INFO ] Computed 23 invariants in 7 ms
[2024-05-27 20:08:11] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 20:08:11] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:08:11] [INFO ] Invariant cache hit.
[2024-05-27 20:08:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:08:12] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-05-27 20:08:12] [INFO ] Redundant transitions in 4 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-27 20:08:12] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:08:12] [INFO ] Invariant cache hit.
[2024-05-27 20:08:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:08:15] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:08:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:08:17] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 1 ms to minimize.
[2024-05-27 20:08:17] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:08:18] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:08:19] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:08:32] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:08:32] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:08:32] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:08:32] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:08:32] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 (/ 1.0 3.0))
(s30 (/ 2.0 3.0))
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 (/ 1.0 3.0))
(s40 0.0)
(s41 (/ 2.0 3.0))
(s42 0.0)
(s43 0.0)
(s44 (/ 2.0 3.0))
(s45 (/ 1.0 3.0))
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:08:46] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:08:46] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:09:09] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61473ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/132 places, 523/415 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62101 ms. Remains : 120/132 places, 523/415 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 153 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 143 steps (0 resets) in 10 ms. (13 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 320 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 5643 reset in 349 ms.
Product exploration explored 100000 steps with 5615 reset in 360 ms.
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 17 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-05-27 20:09:15] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:09:15] [INFO ] Invariant cache hit.
[2024-05-27 20:09:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-27 20:09:16] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:09:16] [INFO ] Invariant cache hit.
[2024-05-27 20:09:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:09:16] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-27 20:09:16] [INFO ] Redundant transitions in 5 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-27 20:09:16] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:09:16] [INFO ] Invariant cache hit.
[2024-05-27 20:09:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2024-05-27 20:09:19] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:09:20] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:09:21] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:09:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:09:22] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:09:23] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2024-05-27 20:09:24] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-27 20:09:24] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:09:36] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:09:36] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:09:36] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-05-27 20:09:36] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 0 ms to minimize.
[2024-05-27 20:09:37] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 (/ 1.0 22.0))
(s5 (/ 21.0 22.0))
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 (/ 21.0 44.0))
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 (/ 23.0 44.0))
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 (/ 1.0 22.0))
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 (/ 1.0 22.0))
(s48 0.0)
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:09:50] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-27 20:09:50] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:10:12] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61346ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61353ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62012 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-14 finished in 128066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(X(p0)&&F((G(F(p1))||(G(p0)&&F(p1)))))))))'
Found a Shortening insensitive property : SafeBus-COL-06-LTLFireability-00
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:10:18] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:10:18] [INFO ] Computed 29 invariants in 2 ms
[2024-05-27 20:10:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 20:10:18] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:10:18] [INFO ] Invariant cache hit.
[2024-05-27 20:10:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:10:18] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-27 20:10:18] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:10:18] [INFO ] Invariant cache hit.
[2024-05-27 20:10:18] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:10:20] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:10:21] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:10:22] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:10:22] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2024-05-27 20:10:22] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:10:22] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:10:22] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:10:23] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:10:23] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:10:23] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:10:23] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:10:23] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:10:24] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:10:24] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:10:25] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:10:25] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 12 ms to minimize.
[2024-05-27 20:10:25] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:10:25] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:10:27] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 26367 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:10:52] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56758ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56762ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 57111 ms. Remains : 138/138 places, 415/415 transitions.
Running random walk in product with property : SafeBus-COL-06-LTLFireability-00
Product exploration explored 100000 steps with 7106 reset in 415 ms.
Product exploration explored 100000 steps with 6941 reset in 411 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), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 173 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 213 steps (0 resets) in 9 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 403 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 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:11:17] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:11:17] [INFO ] Invariant cache hit.
[2024-05-27 20:11:17] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-27 20:11:17] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:11:17] [INFO ] Invariant cache hit.
[2024-05-27 20:11:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:11:17] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-27 20:11:17] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:11:17] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:11:17] [INFO ] Invariant cache hit.
[2024-05-27 20:11:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:11:19] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:11:19] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:11:19] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:11:21] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:11:21] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:11:21] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-05-27 20:11:21] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:11:22] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:11:22] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:11:22] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:11:22] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:11:23] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:11:23] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 1 ms to minimize.
[2024-05-27 20:11:23] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:11:24] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:11:24] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:11:24] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:11:26] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25907 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:11:51] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56269ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56625 ms. Remains : 138/138 places, 415/415 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 187 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 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 110 steps (0 resets) in 7 ms. (13 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 318 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4035 reset in 1036 ms.
Product exploration explored 100000 steps with 3922 reset in 1049 ms.
Support contains 61 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:12:16] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:12:16] [INFO ] Invariant cache hit.
[2024-05-27 20:12:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 20:12:16] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:12:16] [INFO ] Invariant cache hit.
[2024-05-27 20:12:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:12:17] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-27 20:12:17] [INFO ] Redundant transitions in 1 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 20:12:17] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:12:17] [INFO ] Invariant cache hit.
[2024-05-27 20:12:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:12:18] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:12:18] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:12:19] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:12:19] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:12:19] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:12:19] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:12:19] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:12:20] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 6 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:12:21] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:12:23] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:12:23] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:12:23] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:12:23] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:12:23] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:12:23] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:12:25] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 26009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 20:12:50] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 56494ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 56498ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56851 ms. Remains : 138/138 places, 415/415 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-00 finished in 175570 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)))'
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(p0)))'
Found a Shortening insensitive property : SafeBus-COL-06-LTLFireability-05
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:13:13] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 20:13:13] [INFO ] Invariant cache hit.
[2024-05-27 20:13:14] [INFO ] Implicit Places using invariants in 159 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Applied a total of 12 rules in 6 ms. Remains 126 /132 variables (removed 6) and now considering 409/415 (removed 6) transitions.
[2024-05-27 20:13:14] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
// Phase 1: matrix 236 rows 126 cols
[2024-05-27 20:13:14] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 20:13:14] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-27 20:13:14] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:13:14] [INFO ] Invariant cache hit.
[2024-05-27 20:13:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:13:14] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 126/138 places, 409/415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 650 ms. Remains : 126/138 places, 409/415 transitions.
Running random walk in product with property : SafeBus-COL-06-LTLFireability-05
Product exploration explored 100000 steps with 14066 reset in 181 ms.
Product exploration explored 100000 steps with 14123 reset in 187 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 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 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:13:15] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:13:15] [INFO ] Invariant cache hit.
[2024-05-27 20:13:15] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:13:15] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-27 20:13:15] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-27 20:13:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:13:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:13:15] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-27 20:13:15] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-27 20:13:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:13:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 14 ms returned sat
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2024-05-27 20:13:15] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2024-05-27 20:13:16] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-27 20:13:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 327 ms
[2024-05-27 20:13:16] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 20 ms.
[2024-05-27 20:13:16] [INFO ] Added : 28 causal constraints over 6 iterations in 140 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-05-27 20:13:16] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:13:16] [INFO ] Invariant cache hit.
[2024-05-27 20:13:16] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-27 20:13:16] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:13:16] [INFO ] Invariant cache hit.
[2024-05-27 20:13:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:13:16] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2024-05-27 20:13:16] [INFO ] Redundant transitions in 2 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-27 20:13:16] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:13:16] [INFO ] Invariant cache hit.
[2024-05-27 20:13:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:13:18] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:13:19] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:13:20] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:13:20] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:13:20] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:13:20] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-27 20:13:20] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:21] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:13:21] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:13:21] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:13:22] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:13:22] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:13:22] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:13:22] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:24] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:13:24] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:13:24] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:25] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:13:25] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:13:25] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:27] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:29] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:30] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:13:31] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:13:31] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 27155 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:46] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:13:48] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:13:48] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 57520ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 57524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58025 ms. Remains : 126/126 places, 409/409 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 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 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 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-27 20:14:14] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:14:14] [INFO ] Invariant cache hit.
[2024-05-27 20:14:14] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:14:14] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-27 20:14:14] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:14:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:14:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 20:14:14] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-27 20:14:15] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-27 20:14:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:14:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 14 ms returned sat
[2024-05-27 20:14:15] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-27 20:14:15] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:14:15] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 0 ms to minimize.
[2024-05-27 20:14:15] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-27 20:14:15] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2024-05-27 20:14:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 325 ms
[2024-05-27 20:14:15] [INFO ] Computed and/alt/rep : 54/270/54 causal constraints (skipped 176 transitions) in 17 ms.
[2024-05-27 20:14:15] [INFO ] Added : 28 causal constraints over 6 iterations in 119 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14052 reset in 187 ms.
Product exploration explored 100000 steps with 14132 reset in 193 ms.
Support contains 7 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 409/409 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-05-27 20:14:15] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:14:15] [INFO ] Invariant cache hit.
[2024-05-27 20:14:16] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-27 20:14:16] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:14:16] [INFO ] Invariant cache hit.
[2024-05-27 20:14:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:14:16] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-27 20:14:16] [INFO ] Redundant transitions in 1 ms returned []
Running 403 sub problems to find dead transitions.
[2024-05-27 20:14:16] [INFO ] Flow matrix only has 236 transitions (discarded 173 similar events)
[2024-05-27 20:14:16] [INFO ] Invariant cache hit.
[2024-05-27 20:14:16] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:17] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-27 20:14:18] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:14:18] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-27 20:14:18] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:14:18] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-27 20:14:18] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:14:19] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2024-05-27 20:14:19] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:14:19] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:14:19] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2024-05-27 20:14:19] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:14:20] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-27 20:14:20] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-27 20:14:20] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-27 20:14:20] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:14:20] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:21] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:14:21] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:14:21] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:14:21] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:14:22] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:14:22] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:14:22] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:24] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:14:24] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:14:24] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:25] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:14:25] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:14:25] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:29] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:14:30] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:14:31] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 236/362 variables, 126/183 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 43/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 13 (OVERLAPS) 0/362 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 226 constraints, problems are : Problem set: 0 solved, 403 unsolved in 27683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:46] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-05-27 20:14:48] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2024-05-27 20:14:49] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 236/362 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 43/229 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 403/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 632 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 37/37 constraints]
After SMT, in 58046ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 58050ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 58621 ms. Remains : 126/126 places, 409/409 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-05 finished in 120908 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))||F(p1)))'
Found a Lengthening insensitive property : SafeBus-COL-06-LTLFireability-14
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 415/415 transitions.
Applied a total of 0 rules in 4 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 20:15:14] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 20:15:14] [INFO ] Computed 29 invariants in 2 ms
[2024-05-27 20:15:14] [INFO ] Implicit Places using invariants in 129 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 141 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/138 places, 415/415 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 409
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 523
Applied a total of 24 rules in 9 ms. Remains 120 /132 variables (removed 12) and now considering 523/415 (removed -108) transitions.
[2024-05-27 20:15:14] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2024-05-27 20:15:14] [INFO ] Computed 23 invariants in 2 ms
[2024-05-27 20:15:15] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-27 20:15:15] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:15:15] [INFO ] Invariant cache hit.
[2024-05-27 20:15:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:15:15] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 120/138 places, 523/415 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 872 ms. Remains : 120/138 places, 523/415 transitions.
Running random walk in product with property : SafeBus-COL-06-LTLFireability-14
Product exploration explored 100000 steps with 5609 reset in 348 ms.
Product exploration explored 100000 steps with 5622 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 188 steps (0 resets) in 13 ms. (13 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 20 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-05-27 20:15:17] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:15:17] [INFO ] Invariant cache hit.
[2024-05-27 20:15:17] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 20:15:17] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:15:17] [INFO ] Invariant cache hit.
[2024-05-27 20:15:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:15:18] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-27 20:15:18] [INFO ] Redundant transitions in 3 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-27 20:15:18] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:15:18] [INFO ] Invariant cache hit.
[2024-05-27 20:15:18] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:15:20] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:15:20] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:15:20] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-27 20:15:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2024-05-27 20:15:21] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2024-05-27 20:15:22] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:15:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-27 20:15:22] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 1 ms to minimize.
[2024-05-27 20:15:22] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:15:23] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2024-05-27 20:15:23] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:15:23] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 20:15:23] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:15:23] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:15:23] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:15:24] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:15:25] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:15:25] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2024-05-27 20:15:25] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:15:25] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-27 20:15:37] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 0 ms to minimize.
[2024-05-27 20:15:38] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:15:51] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:16:13] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61189ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61829 ms. Remains : 120/120 places, 523/523 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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 116 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 231 steps (0 resets) in 9 ms. (23 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 320 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 5607 reset in 352 ms.
Product exploration explored 100000 steps with 5617 reset in 356 ms.
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 523/523 transitions.
Applied a total of 0 rules in 29 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2024-05-27 20:16:21] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:16:21] [INFO ] Invariant cache hit.
[2024-05-27 20:16:21] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-27 20:16:21] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:16:21] [INFO ] Invariant cache hit.
[2024-05-27 20:16:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 20:16:21] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-27 20:16:21] [INFO ] Redundant transitions in 3 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-27 20:16:21] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
[2024-05-27 20:16:21] [INFO ] Invariant cache hit.
[2024-05-27 20:16:21] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:16:24] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:16:24] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:16:24] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:16:24] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 1 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2024-05-27 20:16:25] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:16:26] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:16:27] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-05-27 20:16:27] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-27 20:16:27] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:16:27] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 1 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-27 20:16:28] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:16:29] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/181 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:16:42] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-05-27 20:16:42] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-27 20:16:42] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2024-05-27 20:16:42] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2024-05-27 20:16:42] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/470 variables, 5/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 229 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 43/66 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:16:55] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-27 20:16:55] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 350/470 variables, 120/188 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 43/231 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 517/748 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-27 20:17:17] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 749 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 46/46 constraints]
After SMT, in 61195ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 61202ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61814 ms. Remains : 120/120 places, 523/523 transitions.
Treatment of property SafeBus-COL-06-LTLFireability-14 finished in 128532 ms.
[2024-05-27 20:17:23] [INFO ] Flatten gal took : 51 ms
[2024-05-27 20:17:23] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2024-05-27 20:17:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 415 transitions and 2620 arcs took 17 ms.
Total runtime 1108956 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-06

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 4458
MODEL NAME: /home/mcc/execution/412/model
138 places, 415 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SafeBus-COL-06-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SafeBus-COL-06-LTLFireability-00 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716841562311

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SafeBus-COL-06, 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 r333-tall-171679078300364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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